See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/348730147

The Largest Prime Number in the world

Preprint · January 2021

DOI: 10.13140/RG.2.2.34005.65760

CITATIONS READS

0 1,624

2 authors, including:

Pedro Hugo García Peláez

Universidad Internacional de La Rioja
29 PUBLICATIONS   0 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Connecting Researchers on the Globe View project

Talents of researchers ✍ View project

All content following this page was uploaded by Pedro Hugo García Peláez on 24 January 2021.

The user has requested enhancement of the downloaded file.

 The Largest Prime Number in the world

24th January 2021

Pedro Hugo García Peláez

© Pedro Hugo García Peláez, 2021

The function we are going to use to find big prime numbers is:

x^2-3x+1 and it´s roots are

And

But we are going to make a little modification in our function. We are going to use
rational exponents of the form:

x^(4/n)-3x^(2/n)+1

(n) is any natural number and it´s two roots returns:

Lucas number (n) +(1/(Lucas number(n))

and
1/Lucas number(n)

of the form of a combination of Lucas(n) and Fibonacci(n)

For example with (n) = 7

= 0.03448275862068965517241379 = 1/29 = 1/ Lucas(7)

and the other root is:

= 29.03444185374863302665= Lucas(7)+(1/Lucas(7))

Only for this, this function deserves a recognition.

Now we are going to change the exponents of position to start to search big prime
numbers

Now the function is:

x^(2/p)-3x^(4/p)+1

Where p is a prime number.

Not all prime numbers returns a prime number with this function, but the primes that
returns a prime number, follow a pattern very similar to the Mersenne method to find
primes, but with a big difference. If we use a prime number of the same range of a
Mersenne prime, this function returns a prime number bigger that if we use the
method of Mersenne.

In the estructure of the root we get the number in the numerator of the first term.

For example for p=31

x^(2/31)-3x^(4/31)+1=0
We obtain 169746333457 that in this case is a prime number.

The number in the numerator of the first part of the root is:
169746333457 (12 digits)

Prime number 31associated with Mersenne is

2147483647 (10 digits)

The ratio between these two number is

169746333457/2147483647=79.044

79 times bigger with my method. Using two primes that in this case are the same.

With he next prime (61) the ratio is

12512647122591823210849/2305843009213693951=5426.4957

The prime numbers that return other prime number that I found are:

Prime index Hugo Prime Mersenne Prime

1 3 2
2 5 3
3 7 5
4 13 7
5 19 13
6 31 17
7 43 19
8 61 31
9 67 61
10 107 89
11 127 107
12 521 127
13 631 521
 14 1307 607
15 1619 1279

I hope find more Hugo prime numbers.

The largest prime number that I found wth my method is the associated with the
prime number (1619)

30576148829740138953999438154435898092818919944533907506328558978559
13332412049981985851006116054448542303830926522564126271192218171084
94192279453017178874090451084011983370942232873647978224195562328959
05120129780873950688569433634916048421351767823038918734482252396717
44475100345444106156446652325936439051401738693460056926563481953420
08646541706624005607757596172561482353096058837146405602287899584858
09590774593681062035669045090437411568745546591963643442240406835241
22208155841306331812326002642008922732713375604090539849044035216060
5856566874897425839282123404657432219978117

With 587 decimal digits

And Mersenne prime asociated with 1279 has 386 decimal digits.

-Conclusions-

We can find bigger prime numbers with this method instead of using Mersenne
method when we test similar prime numbers associated.

View publication stats