Problem 46681. Determine the kth Primitive Root of Unity
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
David Hill
on 13 Oct 2020
See: https://en.wikipedia.org/wiki/Root_of_unity_modulo_n
kth root of unity modulo n (prime number), such that k
Rafael S.T. Vieira
on 14 Oct 2020
Thanks, David. I will try once again. (I've deleted my previous comment since you changed the problem description and to not confuse people.)
Solution Comments
Show commentsProblem Recent Solvers4
Suggested Problems
-
What is the distance from point P(x,y) to the line Ax + By + C = 0?
545 Solvers
-
Optimally fill a container with elements of different sizes
22 Solvers
-
211 Solvers
-
interesting center of magic matrix
108 Solvers
-
112 Solvers
More from this Author57
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!