Timeline for Largest prime divisor of a sum
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2011 at 1:54 | comment | added | Woett | Indeed, I should have mentioned that explicitly. | |
| Nov 4, 2011 at 21:42 | history | edited | Charles | CC BY-SA 3.0 |
TeX
|
| Nov 4, 2011 at 19:57 | comment | added | Greg Martin | The product of all the primes up to $n/\log n$ is only $\exp(O(n/\log n))$, true, so the only way the $c=1$ conjecture could fail is if these smallish primes occurred to higher and higher powers (on average). | |
| Apr 6, 2011 at 11:59 | history | answered | Woett | CC BY-SA 2.5 |