Question: (4 pts) The following algorithm tests Goldbach's Conjecture for specific numbers. It takes an even number 2x and checks whether it is the sum of

(4 pts) The following algorithm tests Goldbach's Conjecture for specific numbers. It takes an even number 2x and checks whether it is the sum of two primes. Input x (a positive integer) For p 1 to x Check whether p is a prime using the polytime prime-testing algorithm Check whether 2 - p is a prime using the polytime prime-testing algorithm If p and 2x_p are both prime then Accept Reject Is this a polytime algorithm? Explain
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
