Problem 46681. Determine the kth Primitive Root of Unity

Created by David Hill

Difficulty:Rate

Solve Later
Add To GroupÃ‚

Determine all prime numbers less than n (input) that have a kth (k<prime number) root of unity modulo (prime number) and determine the primitive kth root of unity for each of those prime numbers (modulo those prime numbers).

Solve

Solution Stats

4 Solutions
4 Solvers

Last Solution submitted on Jan 24, 2022

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

David Hill on 13 Oct 2020

See: https://en.wikipedia.org/wiki/Root_of_unity_modulo_n
kth root of unity modulo n (prime number), such that k

Rafael S.T. Vieira on 14 Oct 2020

Thanks, David. I will try once again. (I've deleted my previous comment since you changed the problem description and to not confuse people.)

Solution Comments

Show comments

ANNOUNCEMENT

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers4

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 46681. Determine the kth Primitive Root of Unity

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers4

Suggested Problems

More from this Author57

Problem Tags

Community Treasure Hunt

Problem 46681. Determine the kth Primitive Root of Unity

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers4

Suggested Problems

More from this Author57

Problem Tags

Community Treasure Hunt

Players