Timeline for Is $(p^2-1)/2$ never squarefull when $p > 3$ is a Mersenne prime?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 16, 2017 at 22:39 | history | edited | Stefan Kohl♦ | CC BY-SA 3.0 |
Language editing.
|
| Apr 13, 2012 at 14:16 | history | edited | A.L | CC BY-SA 3.0 |
added 47 characters in body; deleted 69 characters in body; deleted 8 characters in body
|
| Apr 6, 2012 at 19:13 | answer | added | Zack Wolske | timeline score: 2 | |
| Apr 6, 2012 at 18:25 | comment | added | Zack Wolske | The condition "for every prime $q$ dividing $n$, $q^2$ also divides $n$" is called being powerful in the literature. So after dividing out the factors of $2$, you'd like to know if $2^{p-1} - 1$ is ever powerful when $2^p - 1$ is prime. Ribenboim has some conjectures related to similar questions in "The New Book Of Prime Number Records", in the section on Wieferich primes. | |
| Apr 6, 2012 at 15:45 | history | edited | A.L | CC BY-SA 3.0 |
added 5 characters in body; added 1 characters in body
|
| Apr 6, 2012 at 15:37 | answer | added | Philip van Reeuwijk | timeline score: 3 | |
| Apr 6, 2012 at 14:30 | history | asked | A.L | CC BY-SA 3.0 |