All Prime Numbers Have Primitive Roots

05/24/2022
by   Ruben Gamboa, et al.
0

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power of g modulo p. Building on prior work in the ACL2 community, this paper describes a constructive proof that every prime number has a primitive root.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2022

Random primes in arithmetic progressions

We describe a straightforward method to generate a random prime q such t...
research
01/18/2022

A Computation Model with Automatic Functions and Relations as Primitive Operations

Prior work of Hartmanis and Simon (Hartmanis and Simon, 1974) and Floyd ...
research
11/24/2017

A Fowler-Nordheim Integrator can Track the Density of Prime Numbers

"Does there exist a naturally occurring counting device that might eluci...
research
01/03/2018

Gaps between prime numbers and tensor rank of multiplication in finite fields

We present effective upper bounds on the symmetric bilinear complexity o...
research
08/09/2018

Hardware realization of residue number system algorithms by Boolean functions minimization

Residue number systems (RNS) represent numbers by their remainders modul...
research
03/25/2018

Goldbach's Function Approximation Using Deep Learning

Goldbach conjecture is one of the most famous open mathematical problems...
research
05/20/2020

Primitive Sets of Words

Given a (finite or infinite) subset X of the free monoid A^* over a fini...

Please sign up or login with your details

Forgot password? Click here to reset