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: Brown Bannister on 1 Apr 2010 01:40 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? 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? Thanks, M. M. M.
From: Dann Corbit on 1 Apr 2010 02:32 In article <6104e670-729d-45d9-8902-17e67b770825 @b30g2000yqd.googlegroups.com>, brownbannister(a)beatlesfan.com says... > > 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 2/2=1 3/3=1 5/5=1 7/7=1 > 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? He's wrong. > 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? We don't have to wonder.
From: What you are reading is Philosophy and P Versus NP. on 1 Apr 2010 02:53 On Mar 31, 11:32 pm, Dann Corbit <dcor...(a)connx.com> wrote: > In article <6104e670-729d-45d9-8902-17e67b770825 > @b30g2000yqd.googlegroups.com>, brownbannis...(a)beatlesfan.com says... > > > > > 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 > > 2/2=1 > 3/3=1 > 5/5=1 > 7/7=1 > > > 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? > > He's wrong. > > > 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? > > We don't have to wonder. Hi, Well what if we put it this way? 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.
From: John Jones on 1 Apr 2010 06:08 Brown Bannister wrote: > the "Poor Man's Prime" conjecture guesses a prime number is not > divisible by 2, 3, 4, 5, 6, 7, 8, 9, or 10. We "make a conjecture", and we "make a guess", is standard English. But we don't "make a conjecture make a guess". You'll have to tighten up your grammar.
From: What you are reading is Philosophy and P Versus NP. on 1 Apr 2010 09:25
On Apr 1, 4:10 am, master1729 <tommy1...(a)gmail.com> wrote: > > Brown Bannister 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 poor man is deluded and thinks all prime numbers > > are 11 or greater. > > > > 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? > > > Largely irrelevant. It is so obviously wrong. > > > A pretty feeble April Fools joke. > > its not a joke , its just " musatov math ". > > euh .. ok , so it is a joke , but musatov math is a joke everyday , not just on april the 1st. > > > > > > > Regards, > > Martin Brown- Hide quoted text - > > - Show quoted text -- Hide quoted text - > > - Show quoted text - If my math is a joke every day then what are you doing complaining? h1>Items to sort</h1><form action="response.lasso" method="post"><table> <tr> <th>ORDER</th> <th>ITEM</ th> </tr>[iterate: $items, local:'item'] <tr> <td><select name="order"> [loop: $order] [local:'loop_count' = loop_count] // put this on one line <option value="[#loop_count->(setformat: -padchar='0', -padding=3) & ] [(#item->value->(find:'order') == loop_count) ? '1' | (#item->value- >(find:'order') < loop_count) ? '2' | '0']_[#item- >name]" [(#item->value->(find:'order') == loop_count) ? ' SELECTED']>[loop_count] [/loop] </select> </td> <td>[#item->value->(find:'name')]</td> </tr>[/ iterate]</table><input type="submit" name="submit" value="Update"></ form> |