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
-
3801 Solvers
-
Number of 1s in the Binary Representation of a Number
442 Solvers
-
Convert Roman to Arabic Numerals
101 Solvers
-
Create logical matrix with a specific row and column sums
300 Solvers
-
Circular Primes (based on Project Euler, problem 35)
479 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!