Primitive Root Modulo n - MATLAB Cody - MATLAB Central

Problem 59212. Primitive Root Modulo n

Difficulty:
(1297)
Rate
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]
Solve

Solution Stats

77.78% Correct | 22.22% Incorrect
Last Solution submitted on Feb 05, 2024

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers5

Suggested Problems

More from this Author45

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Go to top of page