Number of natural numbers that have primitive roots

Click For Summary
SUMMARY

The discussion focuses on calculating the number of natural numbers between 2 and n that possess primitive roots. A primitive root modulo m exists if m is cyclic, specifically when m equals 1, 2, 4, or is of the form p^k or 2·p^k, where p is a prime. To determine the count of such numbers, one must calculate the number of primes between 2 and n^(1/k). The limit of interest is expressed as lim(n→∞)(a_n/n), where a_n represents the count of these numbers, and it can be approximated using the density of primes.

PREREQUISITES
  • Understanding of primitive roots and modular arithmetic
  • Familiarity with cyclic groups in number theory
  • Knowledge of prime number distribution and density
  • Basic calculus concepts for limits
NEXT STEPS
  • Study the properties of primitive roots in modular arithmetic
  • Learn about cyclic groups and their significance in number theory
  • Research the distribution of prime numbers and the Prime Number Theorem
  • Explore limit calculations in calculus, particularly with sequences
USEFUL FOR

Mathematicians, number theorists, and students interested in modular arithmetic and the properties of prime numbers.

mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :giggle:

How can we calculate the number of natural numbers between $2$ and $n$ that have primitive roots?

Let $m$ be a positive integer.
Then $g$ is a primitive root modulo $m$, with $(g,m)=1$, if the modulo of $g\in (Z/m)^{\star}$ is a generator of the group.

We have that $g$ is a primitive root modulo $m$ if it is a generator of a group, i.e. $m$ has a primitive root if $\mathbb{Z}_m$ is cyclic, right?

$\mathbb{Z}_m$ is cyclic if $m=1,2,4$ or $m=p^k$ or $m=2\cdot p^k$ for $p$ prime.

That means that the number of natural numbers that have a primitive root is $\#\{1,2,4,p^k, 2\cdot p^k\}$ for $p$ prime.

So we have to calculate the number of primes between $2$ and $n^{\frac{1}{k}}$ to calculate then the number of elements of the form $p^k$ and $2\cdot p^k$.

Have I understood that correctly? :unsure:
 
Mathematics news on Phys.org
Looks about right. :unsure:
 
Klaas van Aarsen said:
Looks about right. :unsure:

To calculate the number of these primes do we use the density of primes? :unsure:
 
mathmari said:
To calculate the number of these primes do we use the density of primes?
We can only approximate the density of primes.
So we cannot use it to find an actual number.
Assuming that we want a 'hard' number, I think we should express it in terms like 'the number of primes between $2$ and $n$'. :unsure:
 
Klaas van Aarsen said:
We can only approximate the density of primes.
So we cannot use it to find an actual number.
Assuming that we want a 'hard' number, I think we should express it in terms like 'the number of primes between $2$ and $n$'. :unsure:

Actually I want to calculate the limit $\displaystyle{\lim_{n\rightarrow \infty}\frac{a_n}{n}}$ where $a_n$ is the above number. So do we need the actual number to calculate this limit? :unsure:
 
mathmari said:
Actually I want to calculate the limit $\displaystyle{\lim_{n\rightarrow \infty}\frac{a_n}{n}}$ where $a_n$ is the above number. So do we need the actual number to calculate this limit?
No. I think we can use the density of primes to calculate that limit. :unsure:
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 3 ·
Replies
3
Views
865
Replies
3
Views
2K