Problem 59212. Primitive Root Modulo n
Given a positive integer n > 2, return a vector, v, of positive integers smaller than n that are primitive roots modulo n. If no integers satisfy the requirements, return an empty variable.
Example:
n = 5;
v = [2, 3]
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers5
Suggested Problems
-
Least common multiple of many numbers
245 Solvers
-
Back to basics 6 - Column Vector
1084 Solvers
-
find the roots of a quadratic equation
234 Solvers
-
500 Solvers
-
construct matrix with identical rows
200 Solvers
More from this Author45
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!