Algorithmadvanced
Dixon's random squares algorithm
Also called Dixon's factorization method.
Generates random squares and finds a congruence of squares via smooth residues; first subexponential factoring method.
Generates random squares and finds a congruence of squares via smooth residues; first subexponential factoring method.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 11JRDA Edit this page History Report an error