APM  Vol.8 No.7 , July 2018
There Are Infinitely Many Mersnne Composite Numbers with Prime Exponents
Author(s) Fengsui Liu
ABSTRACT
By extending both arithmetical operations into finite sets of natural numbers, from the entire set of natural numbers successively deleting some residue classes modulo a prime, we invented a recursive sieve method or algorithm on natural numbers and their sets. The algorithm mechanically yields a sequence of sets, which converges to the set of all primes p such that 2p + 1 divides the Mersenne number Mp. The cardinal sequence corresponding to the sequence of sets is strictly increasing. So that we have captured enough usable structures, without any estimation, the existing theories of those structures allow us to prove an exact result: there are infinitely many Mersenne composite numbers with prime exponents Mp.

1. Introduction

A Mersenne number M x is a number of the form

M x = 2 x 1.

They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17th century.

If the exponent x is a composite number, obviously M x is a composite number. One only discusses the primality of a Mersenne number with a prime exponent.

On January 3, 2018, the Great Internet Mersenne Prime Search has discovered the largest known prime number, 277232917−1, having 23,249,425 digits. A computer volunteered by Jonathan Pace made the find on December 26, 2017 [1] .

One has a conjecture and an open problem about Mersenne numbers.

There are infinitely many Mersenne primes.

There are infinitely many Mersenne composite numbers.

In 1750 Euler stated and in 1775 Laglange proved the following theorem [2] .

Let p 3 mod 4 is prime. Then 2 p + 1 is also primeif and only if 2 p + 1 divides Mp.

When p and 2 p + 1 both are prime, the prime p is said to be a Sophie Germain prime.

If we prove that there are infinitely many Sophie Germain primes of the form 4 k + 3 , then we prove that there are infinitely many Mersenne composite numbers.

In normal sieve theory, like the twin prime conjecture, it is hopeless to prove the Sophie German prime conjecture.

Primes have some obvious structures. We don’t know if they also have some additional structures. Because ofthis, we have been unable to settle many questions about primes [3] .

In 2014, Simon Davis provided a probabilistic proof of infinite extent of the sequence of Mersenne composite numbers with prime exponents [4] .

In 2011, author used the recursive sieve method, which reveals some exotic structures for sets of primes, to prove the Sophie Germain prime conjecture: there are infinitely many primes p such that 2 p + 1 is also prime [5] .

In this paper we extend the above structural result to prove: there are infinitely many Sophie Germain primes of the form 4 k + 3 , then we solve the open problem about Mersenne composite numbers.

In order to be self-contained, we repeat some contents in the paper [5] .

2. A Formal System

For expressing a recursive sieve method by well formed formulas, we extend both arithmetical operations addition +, multiplication × on natural numbers into finite sets of natural numbers.

We use small letters a , x , t to denote natural numbers and capital letters A , X , T to denote sets of natural numbers.

For arbitrary both finite sets of natural numbers A , B we write

A = a 1 , a 2 , , a i , , a n , a 1 < a 2 < < a i < < a n ,

B = b 1 , b 2 , , b j , , b m , b 1 < b 2 < < b j < < b m .

We define

, (2.1)

A B = a 1 b 1 , a 2 b 1 , , a i b j , , a n 1 b m , a n b m .

Example:

1 , 5 + 0 , 6 , 12 , 18 , 24 = 1 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 25 , 29 ,

6 0 , 1 , 2 , 3 , 4 = 0 , 6 , 12 , 18 , 24 .

For the empty set ϕ we define ϕ + A = ϕ and ϕ A = ϕ .

We write A \ B for the set difference of A and B.

Let

be several residue classes modulo a.

We define the solution of the system of congruences

X A = a 1 , a 2 , , a i , , a n mod a ,

X B = b 1 , b 2 , , b j , , b m mod b

to be

X D = d 11 , d 21 , , d i j , , d n m mod a b (2.2)

where x = d i j mod a b is the solution of the system of congruences

x = a i mod a ,

x = b j mod b .

If the greatest common divisor ( a , b ) equals 1, by the Chinese remainder theorem, every solution x = d i j mod a b exists with d i j < a b , every solution is computable and unique.

Except extending +, × into finite sets of natural numbers, we continue the traditional interpretation of the formal language 0, 1, +, ×, . The reader who is familiar with model theory may know, we have founded a new model or structure of second order arithmetic by a two-sorted logic

P ( N ) , N , 0 , 1 , + , × , , (2.3)

where N is the set of all natural numbers and P ( N ) is the power set of N.

We denote this model by P ( N ) .

Given a interpretation of the formal language 0, 1, +, ×, , the set of true sentences in P ( N ) , the theory of the model, is entirely determined. The entities in P ( N ) have intrinsic objective nature. Example the set of all primes p such that 2 p + 1 | M p have intrinsic objective nature, infinite or not.

Mathematicians assume that N , 0 , 1 , + , × is the standard model of Peano theory PA,

N P A (2.4)

Similarly, we assume that P ( N ) , N , 0 , 1 , + , × , is the standard model of a new arithmetical theory P A + Z F ,

P ( N ) P A + Z F . (2.5)

This is a joint theory of PA and ZF, in other words, P ( N ) is not only a model of Peano theory PA but also is a model of set theory ZF.

As a model of Peano theory PA the natural numbers in the model P ( N ) and the natural numbers in the model N are the same.

As a model of set theory ZF the natural numbers are atoms, urelements, or objects that have no element. We discuss sets of natural numbers and sets of sets of natural numbers.

The model P ( N ) and the theory P A + Z F construct a new formal system. In this formal system P ( N ) , we may formalize natural numbers and sets of natural numbers as individuals, terms, or points.

We do not know if the theory P A + Z F can solve the open problem, but we know that the new formal language 0, 1, +, ×, has more stronger expressive power. The new formal system P ( N ) has more richer mathematical structures.

In the formal system P ( N ) , we may introduce a recursive algorithm and produce some recursive sequences of sets. A new notation, the sequence of sets, reveals structures for some prime sets. Based on the theory P A + Z F and the existing theories of those structures, we can carefully construct a logical deduction, which is built into the structures of the natural numbers and their sets, to solve some old prime problems in pure mathematics.

“A well chosen notation can contribute to making mathematical reasoning itself easier, or even purely mechanical.” [6] .

We do not further discuss this formal system in view from logic and mathematical foundation

3. A Recursive Algorithm or Sieve Method

From the entire set of natural numbers successively deleting some residue classes modulo a prime, we invented a recursive sieve method or algorithm on natural numbers and their sets. Now we introduce the algorithm for Sophie Germain primes of the form 4 k + 3 .

Let p i be i-th prime, p 0 = 2 . For every prime p i > 2 , let

B i 0 , ( p i 1 ) / 2 mod p i (3.1)

be the solution of the congruence

Example:

B 1 0 , 1 mod 3 ,

B 2 0 , 2 mod 5 ,

B 3 0 , 3 mod 7 ,

B 4 0 , 5 mod 11 ,

Let

m i + 1 = 4 1 i p j . (3.2)

From the residue class x 3 mod 4 we successively delete the residue classes B 1 mod 3 , , B i mod p i leave the residue class T i + 1 mod m i + 1 . Then the left residue class is the set of all numbers x of the form 4 k + 3 such that x ( 2 x + 1 ) does not contain any prime p j < p i as a factor ( x ( 2 x + 1 ) , m i + 1 ) = 1 .

Let

X D i mod m i + 1 (3.3)

be the solution of the system of congruences

X T i mod m i

X B i mod p i

Let T i + 1 be the set of least nonnegative representatives of the left residue class T i + 1 mod m i + 1 .

In the formal system P ( N ) we obtain a recursive formula for the set T i + 1 , which describe the recursive algorithm or sieve method for Sophie Germain primes of the form 4 k + 3 .

T 1 = 3 ,

T i + 1 = ( T i + m i 0 , 1 , 2 , , p i 1 ) \ D i . (3.4)

The number of elements of the set T i + 1 is

| T i + 1 | = 1 i ( P i 2 ) . (3.5)

We exhibit the first few terms of formula (3.4) and briefly prove that the algorithm is valid by mathematical induction.

The residue class T 1 = 3 mod 4 is the set of all numbers x of the form 4 k + 3 . Now the set X 3 mod 4 is equivalent to the set

X ( 3 + 4 0 , 1 , 2 ) mod 12 ,

from them we delete the solution of the system of congruences D 1 = 3 , 7 mod 12 , and leave

T 2 = ( 3 + 4 0 , 1 , 2 ) \ 3 , 7 = 11 .

The residue class T 2 = 11 mod 12 is the set of all numbers x of the form 4 k + 3 such that ( x ( 2 x + 1 ) , 12 ) = 1 . Now the set X 11 mod 12 is equivalent to the set

X ( 11 + 12 0 , 1 , 2 , 3 , 4 ) mod 60

from them we delete the solution of the system of congruences

D 2 = 35 , 47 mod 60 ,

and leave

T 3 = ( 11 + 12 0 , 1 , 2 , 3 , 4 ) \ 35 , 47 = 11 , 23 , 59 .

The residue class T 3 = 11 , 23 , 59 mod 60 is the set of all numbers x of the form 4 k + 3 such that ( x ( 2 x + 1 ) , 60 ) = 1 . And so on.

Suppose that the residue class T i mod m i is the set of all numbers x of the form 4 k + 3 such that ( x ( 2 x + 1 ) , m i ) = 1 . We delete the residue class B i mod p i from them. In other words, we delete the solution X D i mod m i + 1 of the system of congruences

X T i mod m i

X B i mod p i

Now the residue class T i mod m i is equivalent to the residue class

( T i + m i 0 , 1 , 2 , , p i 1 ) mod m i + 1

From them we delete the solution D i mod m i + 1 , which is the set of all numbers x of the form 4 k + 3 such that x ( 2 x + 1 ) 0 mod p i . It follows that the left residue class T i + 1 mod m i + 1 is the set of all numbers x of the form 4 k + 3 , and ( x ( 2 x + 1 ) , m i + 1 ) = 1 . Our algorithm is valid. It is easy to compute

| T i + 1 | = | T i | ( p i 2 )

by the above algorithm.

We may rigorously prove formulas (3.4) and (3.5) by mathematical induction, the proof is left to the reader.

In the next section we refine formula (3.4) and solve the open problem

4. A Main Theorem

We call a Sophie Germain primes of the form 4 k + 3 a S-prime.

Let T e be the set of all S-primes

T e = { x : x isaS-prime } . (4.1)

By the recursive sieve method we shall determine an additional exotic structure for the set T e based on the limit of a sequence of sets ( T i ),

lim T i = T e .

Next we prove that the cardinality of the set T e is infinite by existing theories of those structures,

| T e | = 0 .

Based on the recursive algorithm, formula (3.4), we successively delete all numbers x of the form 4 k + 3 such that x ( 2 x + 1 ) contains the least prime factor p i . We delete non S-primes or non S-primes together with a S-prime. The sifting condition or “sieve” is

x ( 2 x + 1 ) 0 mod p i . (4.2)

We modify the sifting condition to be

x ( 2 x + 1 ) 0 mod p i p i < x . (4.3)

According to this new sifting condition or “sieve”, we successively delete the set C i of all numbers x such that either x or 2 x + 1 is composite with the least prime factor p i > 2 ,

C i = { x : x X T i mod m i x ( 2 x + 1 ) 0 mod p i p i < x } . (4.4)

but remain the S-prime x if p i = x .

We delete all sets C j with 1 j < i from the set N 0 of all natural numbers x of the form 4 k + 3 , and leave the set

L i = N 0 \ 1 i 1 C j . (4.5)

The set of all S-primes is

T e = N 0 \ 1 C i . (4.6)

The recursive sieve (4.3) is a perfect tool, with this tool we delete all non S-primes and leave all S-primes. So that we only need to determine the number of all S-primes | T e | . If we do so successfully, then the parity obstruction, a ghost in house of primes, has been automatically evaporated.

With the recursive sieve (4.3), each non S-prime is deleted exactly once, there is need neither the inclusion-exclusion principle nor the estimation of error terms, which cause all the difficulty in normal sieve theory.

Let A i be the set of all S-primes x less than p i

A i = { x : x < p i x isaS-prime } . (4.7)

From the recursive formula (3.4), we deduce that the left set L i is the union of the set A i of S-primes and the residue class T i mod m i .

L i = A i T i mod m i (4.8)

Now we intercept the initial segment from the left set L i , which is the union of the set A i of S-primes and the set T i of least nonnegative representatives. Then we obtain a new recursive formula

T i = A i T i . (4.9)

Except remaining all S-primes x less than p i in the initial segment T i , both sets T i and T i are the same.

For example

T 4 = 3 11 , 23 , 71 , , 263 , 299 , 323 , 359 , 383 , 419 = 3 , 11 , 23 , 71 , , 263 , 299 , 323 , 359 , 383 , 419

Note: the M 3 = 2 × 3 + 1 = 7 is a prime. For all S-prime p > 3 , 2 p + 1 | M p , the M p is a Mersenne composite number. Example: M 11 , M 23 , M 83 , .

Formula (4.9) expresses the recursively sifting process according to the sifting condition (4.3), and provides a recursive definition of the initial segment T i . The initial segment is a well chosen notation. We shall consider some properties of the initial segment, and reveal some structures of the sequence of the initial segments to determine the set of all S-primes and its cardinality.

Let | A i | be the number of S-primes less than p i . Then the number of elements of the initial segment T i is

| T i | = | A i | + | T i | . (4.10)

From formula (3.5) we deduce that the cardinal sequence | T i | is strictly increasing

| T i | < | T i + 1 | . (4.11)

Based on order topology obviously we have

lim | T i | = 0 . (4.12)

Intuitively we see that the initial segment T i approaches the set of all S-primes T e , and the corresponding cardinality | T i | approaches infinity as i . Thus the set of all S-primes is limit computable and is an infinite set.

Next we give a formal proof based on set theory and order topology

4.1. A Formal Proof

Let A i be the subset of all S-primes in the initial segment T i

A i = { x T i : x isS-prime } . (4.13)

We consider the structures of both sequences of sets ( T i ) and ( A i ) to solve the open problem.

Lemma 4.1:

The sequence of the initial segments ( T i ) and the sequence of its subsets ( A i ) of S-primes both converge to the set of all S-primes T e .

First from set theory, next from order topology we prove this Lemma.

Proof:

For the convenience of the reader, we quote a definition of the set theoretic limit of a sequence of sets [7] .

Let F n be a sequence of sets, we define lim sup n F n and lim inf n F n as follows

lim sup n F n = 0 0 F n . (4.14)

lim inf n F n = 0 0 F n . (4.15)

It is easy to check that lim sup n F n is the set of those elements x, which belongs to F n for infinitely many n. Analogously, x belongs to lim inf n F n if and only if it belongs to F n for almost all n, that is it belongs to all but a finite number of the F n .

If

lim sup n F n = lim inf n F n .

we say that the sequence of sets F n converges to the limit

lim F n = lim sup n F n = lim inf n F n . (4.16)

We know that the sequence of left sets L i is descending

L 1 L 2 L i (4.17)

According to the definition of the set theoretic limit of a sequence of sets, we obtain that the sequence of left sets ( L i ) converges to the set T e

lim L i = L i = T e . (4.18)

The sequence of subsets ( A i . ) of S-primes is ascending

A 1 A 2 A i (4.19)

We obtain that the sequence of subsets ( A i . ) converges to the set T e ,

lim A i = A i = T e . (4.20)

The initial segment T i is located between two sets A i . and L i

A i T i L i . (4.21)

Thus the sequence of the initial segments ( T i . ) converges to the set T e

lim T i = T e . (4.22)

According to set theory, we have proved that both sequences of sets ( T i . ) and ( A i . ) converge to the set of all S-primes T e .

lim A i = lim T i = T e . (4.23)

Next we prove that according to order topology both sequences of sets ( T i . ) and ( A i . ) converge to the set of all S-primes T e .

We quote a definition of the order topology [8] .

Let X be a set with a linear order relation; assume X has more one element. Let B be the collection of all sets of the following types:

1) All open intervals ( a , b ) in X.

2) All intervals of the form [ a 0 , b ) , where a 0 is the smallest element (if any) in X.

3) All intervals of the form ( a , b 0 ] , where b 0 is the largest element (if any) in X.

The collection B is a bases of a topology on X, which is called the order topology.

According to the definition there is no order topology on the empty set or sets with a single element.

The recursively sifting process, formula (4.9), produces both sequences of sets together with the set theoretic limit point T e .

X 1 : T 1 , T 2 , , T i , , T e .

X 2 : A 1 , A 2 , , A i , , T e . (4.24)

We further consider the structures of sets X 1 and X 2 using the recursively sifting process (4.9) as an order relation

i < j , T i < T j ; i ( T i < T e ) .

i < j , A i < A j ; i ( A i < T e ) . (4.25)

The set X 1 has no repeated term. It is a well ordered set with the order type ω + 1 using the recursively sifting process (4.9) as an order relation. Thus the set X 1 may be endowed an order topology.

The set X 2 may have some repeated terms. We have computed out the first few S-primes x. The set X 2 contains more than one element, may be endowed an order topology using the recursively sifting process (4.9) as an order relation.

Obviously, for every neighborhood ( c , T e ] of T e there is a natural number i 0 , for all i > i 0 , we have T i ( c , T e ] and A i ( c , T e ] , thus both sequences of sets ( T i . ) and ( A i . ) converge to the set of all S-primes T e .

lim T i = T e , (4.26)

lim A i = T e . (4.27)

According to the order topology, we have again proved that both sequences of sets ( T i . ) and ( A i . ) converge to the set of all S-primes T e . We also have

lim T i = lim A i . (4.28)

The formula T i is a recursive asymptotic formula for the set of all S-primes T e .

end proof.

In general, if T e = ϕ , the set X 2 = { ϕ } only has a single element, which has no order topology. In this case formula (4.28) is not valid and our method of proof may be useless [5] .

Lemma 4.1 reveals an order topological structure and a set theoretic structure for the set of all S-primes on the recursive sequences of sets. Based on the existing theories of those structures, we easily prove that the cardinality of the set of all S-primes is infinite.

Theorem 4.2:

The set of all S-primes is an infinite set.

We give two proofs.

Proof A:

We consider the cardinalities | T i | and | A i | of sets on two sides of the equality (4.28), and the order topological limits of cardinal sequences ( | T i | ) and ( | A i | ) , as the sets T i and A i both tend to T e .

From general topology we know, if the limits of both cardinal sequences ( | T i | ) and ( | A i | ) on two sides of the equality (4.28) exist, then both limits are equal; if lim | A i | does not exist, then the condition for the existence of the limit lim | T i | is not sufficient [8] .

For S-primes, the set T e is nonempty, the formula (4.28) is valid, obviously the order topological limits lim | A i | and lim | T i | on two sides of the equality (4.28) exist, thus both limits are equal

lim | A i | = lim | T i | . (4.29)

From formula (4.12) lim | T i | = 0 we have

lim | A i | = 0 . (4.30)

Usually let π 2 ( n ) be the counting function, the number of S-primes less than or equal to n. Normal sieve theory is unable to provide non-trivial lower bounds of π 2 ( n ) because the parity obstruction. Let n be a natural number. Then the number sequence ( m i ) is a subsequence of the number sequence (n), we have

lim π 2 ( n ) = lim π 2 ( m i ) . (4.31)

By formula (4.13), the A i is the set of all S-primes less than m i , and the | A i | is the number of all S-primes less than m i , thus π 2 ( m i ) = | A i | . We have

lim π 2 ( m i ) = lim | A i | . (4.32)

From formula (4.30) we prove

lim π 2 ( n ) = 0 . (4.33)

We directly prove that the number of all S-primes is infinite with the counting function. Next we give another proof by the continuity of the cardinal function.

End proof.

Proof B:

Let f : X Y be the cardinal function f ( T ) = | T | . from the order topological space X to the order topological space Y

X : T 1 , T 2 , , T i , , T e ,

Y : | T 1 | , | T 2 | , , | T i | , , 0 . (4.34)

It is easy to check that for every open set [ | T 1 | , c ) , ( c , d ) , ( d , 0 ] in Y the pre-image [ T 1 , c ) , ( c , d ) , ( d , T e ] is also an open set in X. So that the cardinal function | T | is continuous at T e with respect to the above order topology.

Both order topological spaces are first countable, hence the cardinal function | T | is sequentially continuous. By a usual topological theorem [9] (Theorem 21.3, p130), the cardinal function | T | preserves limits

lim | T i | = | lim T i | . (4.35)

Order topological spaces are Hausdorff spaces. In Hausdorff spaces the limit

point of the sequence of sets ( T i . ) and the limit point of cardinal sequence

( | T i . | ) are unique.

We have proved Lemma 4.1, lim T i = T e , and formula (4.12), lim | T i | = 0 . Substitute, we obtain that the set of all S-primes is an infinite set,

| T e | = 0 . (4.36)

End proof.

By Euler-Lagrange theorem we have solved the open problem about Mersenne numbers.

Theorem 4.3:

There are infinitely many Mersenne composite numbers with prime exponents.

4.2. Conclusions

In pure mathematics, without any statistical data, without the Riemann hypothesis, by the recursive algorithm, we well understand the recursive structure, set theoretic structure and order topological structure for the set of all S-primes on sequences of sets. We choose a well notation, the sequences of set, which makes mathematical reasoning itself easier, or even purely mechanical. Then we obtain a formal proof of the open problem about Mersenne composites.

In general, we may discuss Shophe German primes of the form x , k x + c , then treat another prime problems, in this paper we do not discuss them.

Cite this paper
Liu, F. (2018) There Are Infinitely Many Mersnne Composite Numbers with Prime Exponents. Advances in Pure Mathematics, 8, 687-698. doi: 10.4236/apm.2018.87041.
References
[1]   GIMPS Project Discovers Largest Known Prime Number: . Mersenne Research, Inc.
https://www.mersenne.org/primes/press/M77232917.htm

[2]   Tao, T. (2007) Open Question: The Parity Problem in Sieve Theory.
http://terrytao.wordpress.com/2007/06/05/open-question-the-parity-problem-in-sieve-theory

[3]   Davis, S. (2014) Arithmetical Sequences for the Exponents of Composite Mersenne Numbers. Notes on Number Theory and Discrete Mathematics, 20, 19-26.

[4]   Caldwell, C.K. Proof of a Result of Euler and Lagrange on Mersenne Divisors.
http://primes.utm.edu/notes/proofs/MerDiv2.html

[5]   Liu, F.S. (2011) On the Sophie Germain Prime Conjecture. WSEAS Transactions on Mathematics, 10, 421-430.

[6]   Harrison, J. (2008) Formal Proof—Theory and Practice. Notices of AMS.
http://www.ams.org/notices/200811/tx081101395p.pdf

[7]   Kuratowsky, K. and Mostowsky, A. (1976) Set Theory, with an Introduction to Descriptive Set Theory. North-Holland Publishing, 118-120.

[8]   Hazewinkel, M. Encyclopaedia of Mathematics, Limit.
http://eom.springer.de/l/l058820.htm

[9]   Munkres, J.R. (2000) Topology. 2nd Edition, Prentice Hall, Upper Saddle River, 130.

 
 
Top