Timeline for On roots of irreducible quadratics modulo composites
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 19, 2022 at 19:52 | comment | added | Turbo | Ok. I did not reject your answer and I kept it as it is. | |
| Apr 19, 2022 at 16:05 | comment | added | Max Alekseyev | @Turbo: It's easy to construct polynomial $(a^2\bmod N)x^2-1$ that will be irreducible over $\mathbb Q$. | |
| Apr 19, 2022 at 15:58 | vote | accept | Turbo | ||
| Apr 19, 2022 at 15:58 | vote | accept | Turbo | ||
| Apr 19, 2022 at 15:58 | |||||
| Apr 19, 2022 at 15:58 | vote | accept | Turbo | ||
| Apr 19, 2022 at 15:58 | |||||
| Apr 19, 2022 at 15:57 | comment | added | Turbo | I think the argument would not apply if the polynomial is irreducible and $|a|$ is large. | |
| Apr 18, 2022 at 20:21 | comment | added | Max Alekseyev | E.g., consider $a^2x^2-1$. | |
| Apr 18, 2022 at 19:49 | comment | added | Turbo | That is correct. Thank you. Is there an example if only $|a|$ is large? | |
| Apr 18, 2022 at 18:46 | comment | added | Max Alekseyev | Same idea works for $(x+u)^2-v^2$ where $u,v$ are large integers. | |
| Apr 18, 2022 at 18:40 | comment | added | Turbo | @MaxAleseyev What if $|a|$ or $|b|$ or $|c|$ is large? | |
| Apr 18, 2022 at 18:39 | vote | accept | Turbo | ||
| Apr 19, 2022 at 15:58 | |||||
| Apr 18, 2022 at 18:30 | history | answered | Max Alekseyev | CC BY-SA 4.0 |