Determine all prime numbers less than n (input) that have a kth (k<prime number) root of unity modulo (prime number) and determine the primitive kth root of unity for each of those prime numbers (modulo those prime numbers).

Solution Stats

5 Solutions

5 Solvers

Last Solution submitted on Oct 12, 2025

Last 200 Solutions

Problem Comments

Solution Comments

Show comments
Loading...