Timeline for Is the product of first $n$ prime numbers $+1$ another prime number? [closed]
Current License: CC BY-SA 2.5
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 23, 2014 at 12:00 | comment | added | Amr | @MattNoonan Then square it ? | |
| Dec 21, 2013 at 15:16 | history | closed |
Andy Putman Andrey Rekalo Stefan Kohl♦ Daniel Moskovich Chris Godsil |
Not suitable for this site | |
| Dec 21, 2013 at 1:57 | review | Close votes | |||
| Dec 21, 2013 at 15:16 | |||||
| Jan 11, 2010 at 15:28 | vote | accept | kolistivra | ||
| Jan 11, 2010 at 10:00 | answer | added | Pete L. Clark | timeline score: 8 | |
| Jan 11, 2010 at 6:28 | history | edited | Alon Amit | CC BY-SA 2.5 |
Added +1 to p1p2...pn
|
| Jan 11, 2010 at 6:27 | comment | added | Matt Noonan | But what if there is only one composite number!? | |
| Jan 11, 2010 at 6:13 | comment | added | Bjorn Poonen | I am reminded of Hendrik Lenstra's proof that there are infinitely many composite numbers: Suppose that there are only finitely many composite numbers. Multiply them together. DON'T add 1! | |
| Jan 11, 2010 at 5:53 | comment | added | Mariano Suárez-Álvarez | I agree that finding a counterexample is not the only solution (tertium non datum, and all that...) but I am sure other arguments are consideravly more involved! | |
| Jan 11, 2010 at 5:41 | answer | added | Qiaochu Yuan | timeline score: 10 | |
| Jan 11, 2010 at 4:36 | comment | added | Qiaochu Yuan | Finding a counterexample is the only solution. That's the definition of what it means to disprove a universally quantified statement. | |
| Jan 11, 2010 at 4:07 | comment | added | t3suji | I once had this as discrete math homework, the suggested solution was to multiply out and look up a prime number table :) | |
| Jan 11, 2010 at 4:01 | comment | added | Jason DeVito - on hiatus | Though the prime factors for n=6 are not entirely obvious without a calculator... | |
| Jan 11, 2010 at 3:40 | comment | added | Mariano Suárez-Álvarez | You need only check up to $n=6$... | |
| Jan 11, 2010 at 3:32 | history | asked | kolistivra | CC BY-SA 2.5 |