provide solution/explanation
Extracted text: Suppose we have a huge positive integer. Call it n. We suspect that n is prime, but we want to prove it. How can we do this? O Use a computer in an attempt to find a set of primes {p1, p2, p3, ..., pk}, where k is some positive integer larger than 1, such that that n = p1 + p2 + p3 +...+ pk. If such a set can be found, thenn is prime. If no such set can be found, then n is not prime. O Use a computer in an attempt to find a set of primes {p1, p2, p3, ..., pk}, where k is some positive integer larger than 1, such that that n = p1 x p2 x p3 x...x pk. If such a set can be found, then n is prime. If no such set can be found, then n is not prime. O Use a computer to test every positive integer k such that 1 < k="">< n,="" and="" see="" if="" any="" of="" them="" divides="" n="" without="" a="" remainder.="" if="" any="" of="" them="" does,="" then="" n="" is="" prime.="" if="" none="" of="" them="" does,="" then="" n="" is="" not="" prime.="" o="" use="" a="" computer="" to="" test="" every="" positive="" integer="" k="" such="" that="" 1="">< k="">< n,="" and="" see="" if="" any="" of="" them="" divides="" n="" without="" a="" remainder.="" if="" any="" of="" them="" does,="" then="" n="" is="" not="" prime.="" if="" none="" of="" them="" does,="" then="" n="" is="">