Algorithmadvanced
Heuristic GCD
Also called Char-Geddes-Gonnet heuristic GCD, GCD by Kronecker substitution.
Computes integer polynomial GCDs by evaluating at a large integer and reading the GCD from the result.
Computes integer polynomial GCDs by evaluating at a large integer and reading the GCD from the result.
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 N1KXF6 Edit this page History Report an error