Timeline for How long iterations of $x \to (p \!\!\! \mod \!\! x)$ can be?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 20, 2018 at 6:08 | comment | added | Neil Strickland | @GerhardPaseman I did observe that, but when I checked systematically for the number of factors of $p+1$, the listed primes did not stand out. | |
| Jul 20, 2018 at 5:51 | comment | added | Gerhard Paseman | You might note that for each of your listed primes p, p+1 has many divisors, more than Mersenne primes, giving lots of chances to "slow" the dynamic down. One observes something similar for natural numbers n in place of p with n+1,n+2,n+3, etc. having many divisors. Gerhard "Probably Some Nice Congruence Conditions" Paseman, 2018.07.19. | |
| Jul 18, 2018 at 17:05 | history | edited | Neil Strickland | CC BY-SA 4.0 |
added 119 characters in body
|
| Jul 18, 2018 at 16:30 | history | answered | Neil Strickland | CC BY-SA 4.0 |