The "Poor Man's Prime" conjecture
in [Theory]
|
Prev: [GR] > The Number 401 - Aleph + Tav
Next: Though a computer may express reality, reality is never contingent on the observations or predictions of it by machines.
From: Ostap S. B. M. Bender Jr. on 1 Apr 2010 21:01 On Mar 31, 10:40 pm, Brown Bannister <brownbannis...(a)beatlesfan.com> wrote: > The "Poor Man's Prime conjecture" guesses all prime numbers are not > divisible by 2, 3, 4, 5, 6, 7, 8, 9, or 10 and > the "Poor Man's Prime" conjecture guesses a prime number is not > divisible by 2, 3, 4, 5, 6, 7, 8, 9, or 10. > > 1. What can we tell the poor man about his guess? The second conjecture is TRUE. Example: 11. The first conjecture can be TRUE or FALSE, depending on the interpretation of "or" in "2, 3, 4, 5, 6, 7, 8, 9, or 10" > 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? That English is not a precise language. |