Conceptcore
Cycle decomposition of a permutation
Also called cycle notation, disjoint cycles.
Writes a permutation as a product of disjoint cycles.
Writes a permutation as a product of disjoint cycles.
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 C390V9 Edit this page History Report an error