Prove that there exists a prime with at least ## n ## of its digits.

  • Thread starter Math100
  • Start date
  • Tags
    Prime
In summary, Dirichlet's theorem proves that there exist infinitely many primes of the form ## a+nd ## for some ## n\in\mathbb{N} ##.
  • #1
Math100
797
221
Homework Statement
For any ## n\geq 1 ##, prove that there exists a prime with at least ## n ## of its digits equal to ## 0 ##.
[Hint: Consider the arithmetic progression ## 10^{n+1}k+1 ## for ## k=1, 2, ##....]
Relevant Equations
None.
Proof:

By Dirichlet's theorem, we have that if ## a ## and ## d ## are two positive coprime numbers,
then there are infinitely many primes of the form ## a+nd ## for some ## n\in\mathbb{N} ##.
Let ## n\geq 1 ## be a natural number.
Now we consider the arithmetic progression ## 10^{n+1}k+1 ## for some ## k\in\mathbb{N} ##.
Then ## a=10^{n+1} ## and ## d=1 ##.
This means ## gcd(a, d)=1 ## where ## a ## and ## d ## are coprime numbers.
Thus, ## 10^{n+1}k+1 ## has at least ## n ## consecutive zeros for every ## k ##.
Therefore, there exists a prime with at least ## n ## of its digits equal to ## 0 ## for any ## n\geq 1 ##.
 
  • Like
Likes Delta2
Physics news on Phys.org
  • #2
Math100 said:
Homework Statement:: For any ## n\geq 1 ##, prove that there exists a prime with at least ## n ## of its digits equal to ## 0 ##.
[Hint: Consider the arithmetic progression ## 10^{n+1}k+1 ## for ## k=1, 2, ##...]
Relevant Equations:: None.

Proof:

By Dirichlet's theorem, we have that if ## a ## and ## d ## are two positive coprime numbers,
then there are infinitely many primes of the form ## a+nd ## for some ## n\in\mathbb{N} ##.
Close. There are infinitely many primes in the set ##\{a+nd\, : \,n\in \mathbb{N}\}.## It is not for some ##n\in \mathbb{N}##. ##n## is actually a counter: ##a+1\cdot d\, , \,a+2\cdot d\, , \,a+3\cdot d\, , \,\ldots##
Math100 said:
Let ## n\geq 1 ## be a natural number.
Now we consider the arithmetic progression ## 10^{n+1}k+1 ## for some ## k\in\mathbb{N} ##.
Then ## a=10^{n+1} ## and ## d=1 ##.
Better: Set ## d:=10^{n+1} ## and ## a:=1 ##. You need it the other way around. This uses ##n## as a fixed natural number, so we need another letter for the counter in the arithmetic progression. I will take ##k## below.
Math100 said:
This means ## gcd(a, d)=1 ## where ## a ## and ## d ## are coprime numbers.
Thus, ## 10^{n+1}k+1 ## has at least ## n ## consecutive zeros for every ## k ##.
Therefore, there exists a prime with at least ## n ## of its digits equal to ## 0 ## for any ## n\geq 1 ##.
See? Here you use that ##\{a+nd\, : \,n\in \mathbb{N}\}=\{1+k\cdot 10^{n+1}\, : \,k\in \mathbb{N}\}## has infinitely many primes. O.k., we need only one prime in there.
 
  • Like
Likes Delta2 and Math100

FAQ: Prove that there exists a prime with at least ## n ## of its digits.

How do you prove that there exists a prime with at least n digits?

To prove that there exists a prime with at least n digits, we can use the theorem known as the Prime Number Theorem. This theorem states that for any given positive integer n, there exists at least one prime number between n and 2n. Therefore, we can conclude that there exists a prime with at least n digits.

Can you provide an example of a prime with at least n digits?

Yes, for example, if n = 5, then the prime number 11 has at least 5 digits (11 is a two-digit number, but it has 5 digits when written in base 2).

Is there a specific method or formula for finding a prime with at least n digits?

There is no known formula for finding a prime with at least n digits. However, there are various algorithms and techniques, such as the Sieve of Eratosthenes, that can be used to efficiently find prime numbers of any size.

Does the size of n affect the existence of a prime with at least n digits?

No, the existence of a prime with at least n digits is independent of the value of n. As mentioned before, the Prime Number Theorem guarantees that there exists a prime between n and 2n, regardless of the value of n.

Why is it important to prove the existence of a prime with at least n digits?

Proving the existence of a prime with at least n digits is important because it helps us understand the distribution and properties of prime numbers. It also has practical applications in cryptography and computer science, where large prime numbers are used for secure encryption and other purposes.

Back
Top