The brute force method to check if n is prime would be to iterate from 1 to n and check if any number divides n . If the count is exactly 2 ( 1 ...
確定! 回上一頁