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
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers6
Suggested Problems
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2157 Solvers
-
322 Solvers
-
Optimally fill a container with elements of different sizes
25 Solvers
-
There are 10 types of people in the world
1411 Solvers
-
Big numbers, repeated least significant digits
90 Solvers
More from this Author65
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
See: https://en.wikipedia.org/wiki/Root_of_unity_modulo_n
kth root of unity modulo n (prime number), such that k
Thanks, David. I will try once again. (I've deleted my previous comment since you changed the problem description and to not confuse people.)