Proof. If the algorithm returns COMPOSITE from step 1 or 3, then clearly n is composite. Otherwise, COMPOSITE is returned from step 4, then by Theorem 1, n ...
確定! 回上一頁