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
-
Make an awesome ramp for a tiny motorcycle stuntman
748 Solvers
-
347 Solvers
-
Determine the number of odd integers in a vector
823 Solvers
-
367 Solvers
-
Integer Sequence - II : New Fibonacci
678 Solvers
More from this Author61
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.)