Timeline for Prime factors of the members of a certain recurrence
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 16, 2014 at 19:43 | comment | added | The Masked Avenger | I suspect that it is more accurate to say "both $n$ and $n^2+1$ have all prime factors below a given bound". However, I haven't read Lehmer's paper nor Stormer's. | |
| Oct 13, 2014 at 15:07 | history | edited | so-called friend Don | CC BY-SA 3.0 |
deleted 12 characters in body
|
| Oct 13, 2014 at 15:01 | history | answered | so-called friend Don | CC BY-SA 3.0 |