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 Solvers5
Suggested Problems
-
Find perfect placement of non-rotating dominoes (easier)
388 Solvers
-
Longest run of consecutive numbers
6617 Solvers
-
Split a string into chunks of specified length
2128 Solvers
-
306 Solvers
-
Return fibonacci sequence do not use loop and condition
869 Solvers
More from this Author63
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.)