Problemintro
Integer factorization
Also called prime factorization, factoring.
Given n, find its prime factorization; the basis of RSA's hardness.
Given n, find its prime factorization; the basis of RSA's hardness.
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 PEWPF5 Edit this page History Report an error