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 Solvers6
Suggested Problems
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1329 Solvers
-
Back to basics 6 - Column Vector
1114 Solvers
-
How long do each of the stages of the rocket take to burn?
560 Solvers
-
Create a matrix with difference of each row of input matrix
76 Solvers
-
232 Solvers
More from this Author65
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.)