Problemintro
Smallest prime factor table
Also called spf table, factor table.
Given n, compute the smallest prime factor of every k up to n so any k can be factored quickly.
Given n, compute the smallest prime factor of every k up to n so any k can be factored quickly.
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 XZ33DG Edit this page History Report an error