The "Poor Man's Prime conjecture" guesses all prime numbers are divisible
in [Math]
|
Prev: X-intercepts in circular functions
Next: Geometry Principle deriving the speed of light purely out of math and not physics #554 Correcting Math
From: What you are reading is Philosophy and P Versus NP. on 1 Apr 2010 02:52 On Mar 31, 11:27 pm, "R Swipe" <dopie...(a)verizon.net> wrote: > "Brown Bannister" <brownbannis...(a)beatlesfan.com> wrote in message > > news:6104e670-729d-45d9-8902-17e67b770825(a)b30g2000yqd.googlegroups.com... > > > The"Poor Man's Prime conjecture guesses all prime numbers are not > > divisible by 2, 3, 4, 5, 6, 7, 8, 9, or 10 but > > I don't know what the word 'divisible' means and > > I don't know what the word 'algorithm' means and > > I don't know what the word 'conjecture' means and > > I don't know what the word 'prime' means and > > I don't know what the word 'number' means and > > I don't know what the word 'factor' means and > > I don't know what the word 'felching' means and > > Post it a third time, you Google-posting fuckwit. The "Poor Man's Prime conjecture" guesses all prime numbers are divisible by numbers other than 2, 3, 4, 5, 6, 7, 8, 9, or 10. 1. What can we tell the poor man about his (revised) guess? 2. What are the implications of the poor man's guess being true versus what are the implications of the poor man's guess being false? No problem you insulting anonymous convenience. M. M. M. |