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
-
Project Euler: Problem 1, Multiples of 3 and 5
3023 Solvers
-
331 Solvers
-
I've got the power! (Inspired by Project Euler problem 29)
115 Solvers
-
Output any real number that is neither positive nor negative
388 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
97 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!