Timeline for If $p_{n}$ is the largest prime factor of $p_{n-1}+p_{n-2}+m$, then $p_{n}$ is bounded
Current License: CC BY-SA 3.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 22, 2017 at 20:35 | history | edited | Robert Israel | CC BY-SA 3.0 |
deleted 4 characters in body
|
Mar 22, 2017 at 20:34 | comment | added | Robert Israel | For the case $m=1$, see OEIS sequence A284170 which I recently contributed. | |
Mar 22, 2017 at 8:25 | comment | added | Elizabeth S. Q. Goodman | Speaking of heuristics: if the sequence were not bounded, it would make quite a prime number generator. | |
Mar 21, 2017 at 19:41 | history | edited | Robert Israel | CC BY-SA 3.0 |
added 1 character in body
|
Mar 21, 2017 at 15:43 | history | edited | Robert Israel | CC BY-SA 3.0 |
added 7 characters in body
|
Mar 21, 2017 at 0:22 | comment | added | Brian Hopkins | In line 3, I believe ``unusual for $p_n$'' should reference $p_{n+1}$. (I could not offer this as an edit since it did not require changing at least six characters---questionable requirement.) | |
Mar 17, 2017 at 20:20 | history | edited | Robert Israel | CC BY-SA 3.0 |
added 1 character in body
|
Mar 17, 2017 at 19:56 | history | answered | Robert Israel | CC BY-SA 3.0 |