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
-
Remove any row in which a NaN appears
8549 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
471 Solvers
-
Two-output anonymous function?
75 Solvers
-
207 Solvers
-
Integer Sequence - II : New Fibonacci
480 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!