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
-
Number of 1s in the Binary Representation of a Number
456 Solvers
-
616 Solvers
-
9514 Solvers
-
Compute a dot product of two vectors x and y
1001 Solvers
-
Permute diagonal and antidiagonal
463 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!