This is a continuation of problem 59212, find the number of primitive roots modulo (m) and output the minimum and maximum of those roots if any (or otherwise nan).
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers1
Suggested Problems
-
3490 Solvers
-
924 Solvers
-
91 Solvers
-
117 Solvers
-
Divisible by n, prime divisors - 11, 13, 17, & 19
74 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!