Algorithmcore
Pollard's rho algorithm
Also called Pollard rho, rho method.
Finds a factor by pseudorandom iteration and cycle detection modulo an unknown prime factor.
Finds a factor by pseudorandom iteration and cycle detection modulo an unknown prime 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 ZGK3CY Edit this page History Report an error