Theoremintro
Fundamental theorem of arithmetic
Also called unique factorization theorem.
Every integer greater than 1 factors uniquely, up to order, into primes.
Every integer greater than 1 factors uniquely, up to order, into primes.
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 CRFS04 Edit this page History Report an error