Timeline for A limit concerning prime numbers
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 7, 2013 at 6:24 | comment | added | The Masked Avenger | If I read Igor Rivin's post correctly, then it seems Walter Feit proved for prime powers $g_n$ that they are large enough, and so that if I replace $f_n$ greatest prime factor with $f_n$ greatest prime power factor, this modified statement is a consequence of Feit's Theorem B. | |
| Jul 7, 2013 at 5:14 | comment | added | Igor Rivin | The argument does show that the OP's statement holds with $\limsup$ instead of $\lim...$ | |
| Jul 7, 2013 at 4:08 | comment | added | The Masked Avenger | I thought I could. A possible attack is to show f_n is really large for n prime, and then apply that fact recursively, but I think a proof by contradiction will be easier. | |
| Jul 7, 2013 at 2:06 | history | edited | The Masked Avenger | CC BY-SA 3.0 |
added 239 characters in body
|
| Jul 7, 2013 at 1:48 | comment | added | Uep | Can you explain why $f_n$ is greater than $n$th prime for $n$ sufficiently large? | |
| Jul 7, 2013 at 1:09 | history | answered | The Masked Avenger | CC BY-SA 3.0 |