At 08:09 PM 3/29/2001 -0800, Milton Brown wrote:

>How specifically is it wrong?

You're stating this without any proof or evidence:

"But, primes are not decidable in polynomial time,

example of this number and infinitely many others.

Therefore, primes are not in P."

Do you have a proof that it can't be decided if a number is prime in poly

time? If the ERH is true, they are in P. Even w/o the ERH, there are

algorithms (Adleman-Pomerance-Rumley and variations) that are very close to

poly, and definitely sub-exponential, whereas all known algorithms for all

NP-complete problems are exponential.

>Could you define "knowledgeable person"?

A person familiar with these topics.

+--------------------------------------------------------+

| Jud McCranie |

| |

| 137*2^261147+1 is prime! (78,616 digits, 5/2/00) |

+--------------------------------------------------------+