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
-
329 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
600 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
10697 Solvers
-
Determine the number of odd integers in a vector
706 Solvers
-
170 Solvers
More from this Author55
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!