Timeline for Square roots and prime numbers
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 7 at 18:42 | comment | added | GH from MO | My response and the linked OEIS page make it clear that there is no counterexample up to $2\cdot 10^{12}$. Also, it suffices to check odd numbers only (cf. my response). | |
| Aug 7 at 17:45 | comment | added | Aline Houfty | It was proven with a simple code that there is no counterexample for$ \ \ n<100e6 \ \ $(just adjust the Python code in the main post). | |
| Aug 7 at 1:41 | history | edited | Aline Houfty | CC BY-SA 4.0 |
added 1 character in body
|
| Aug 7 at 1:41 | history | edited | Aline Houfty | CC BY-SA 4.0 |
deleted 3 characters in body
|
| S Aug 7 at 1:40 | review | First answers | |||
| Aug 7 at 7:27 | |||||
| S Aug 7 at 1:40 | history | edited | Aline Houfty | CC BY-SA 4.0 |
added 28 characters in body
|
| Aug 7 at 1:22 | comment | added | GH from MO | Yes, I emphasized this in my response: "The goal would be to prove that there is no such $m$ (regardless of $n$)." | |
| Aug 7 at 1:20 | history | edited | Aline Houfty | CC BY-SA 4.0 |
deleted 1 character in body
|
| Aug 7 at 1:18 | history | edited | Aline Houfty | CC BY-SA 4.0 |
added 4 characters in body
|
| Aug 7 at 1:17 | history | edited | Aline Houfty | CC BY-SA 4.0 |
added 2 characters in body
|
| Aug 7 at 1:16 | history | edited | Aline Houfty | CC BY-SA 4.0 |
edited body
|
| S Aug 7 at 1:15 | review | First answers | |||
| Aug 7 at 1:38 | |||||
| S Aug 7 at 1:15 | history | answered | Aline Houfty | CC BY-SA 4.0 |