Problemcore
Discrete root
Given a, k and prime n, find all x with x to the k congruent to a modulo n, using primitive roots and discrete logarithms.
Given a, k and prime n, find all x with x to the k congruent to a modulo n, using primitive roots and discrete logarithms.
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 J18RAX Edit this page History Report an error