Techniquecore
Congruence of squares
Also called Kraitchik's method, x^2 ≡ y^2 mod n.
Finds x, y with x^2 ≡ y^2 (mod n) but x ≢ ±y; gcd(x−y, n) then gives a nontrivial factor.
Finds x, y with x^2 ≡ y^2 (mod n) but x ≢ ±y; gcd(x−y, n) then gives a nontrivial factor.
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 MAND5E Edit this page History Report an error