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
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
52481 Solvers
-
743 Solvers
-
ベクトル [1 2 3 4 5 6 7 8 9 10] の作成
588 Solvers
-
338 Solvers
-
Determine if input is divisible by three.
239 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!