Timeline for question in prime numbers
Current License: CC BY-SA 2.5
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 22, 2010 at 16:50 | vote | accept | Asterios Gkantzounis | ||
| Dec 22, 2010 at 16:43 | vote | accept | Asterios Gkantzounis | ||
| Dec 22, 2010 at 16:44 | |||||
| Dec 22, 2010 at 16:43 | vote | accept | Asterios Gkantzounis | ||
| Dec 22, 2010 at 16:43 | |||||
| Dec 22, 2010 at 16:43 | vote | accept | Asterios Gkantzounis | ||
| Dec 22, 2010 at 16:43 | |||||
| Dec 15, 2010 at 9:14 | comment | added | Asterios Gkantzounis | thats true but with not equal | |
| Dec 15, 2010 at 8:56 | comment | added | S. Carnahan♦ | You don't really need the $n$ in the statement of your question. You can just ask if for all primes $p$ and all strings of $2p$ consecutive positive integers at least 3 of the integers have smallest prime factor greater than or equal to $p$. | |
| Dec 15, 2010 at 8:42 | comment | added | Dr Shello | @asterios: no justification for an interesting question needed! Upvotes are justification enough!! | |
| Dec 15, 2010 at 1:57 | comment | added | Aaron Meyerowitz | A (locally) maximal interval of numbers each divisible by a prime less than $p_n$ will start and end at an even integer, so you might as well try for $2p_n+1$. | |
| Dec 15, 2010 at 0:01 | answer | added | Aaron Meyerowitz | timeline score: 12 | |
| Dec 14, 2010 at 18:40 | history | edited | Kevin O'Bryant | CC BY-SA 2.5 |
texified, punctuation
|
| Dec 14, 2010 at 17:25 | answer | added | Gerhard Paseman | timeline score: 4 | |
| Dec 14, 2010 at 17:23 | answer | added | Thomas Bloom | timeline score: 2 | |
| Dec 14, 2010 at 16:41 | comment | added | Asterios Gkantzounis | this is not homework. this is a question that i found by myself and i think that it is interesting because i ha not found it in any text or book.if you have already see this please let me know | |
| Dec 14, 2010 at 16:26 | history | asked | Asterios Gkantzounis | CC BY-SA 2.5 |