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
-
4493 Solvers
-
Arrange vector in ascending order
809 Solvers
-
205 Solvers
-
Create an index-powered vector
912 Solvers
-
Check that number is whole number
5145 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!