mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Closed Thread
 
Thread Tools
Old 2021-01-24, 11:47   #1
Hugo1177
 
Aug 2020

24 Posts
Minus The "Hugo"-est Prime Number in the world

The Largest Prime Number in the world
We can find bigger prime numbers with this method instead of using Mersenne method.
https://www.researchgate.net/publica...r_in_the_world
Hugo1177 is offline  
Old 2021-01-24, 13:05   #2
axn
 
axn's Avatar
 
Jun 2003

2·3·827 Posts
Thumbs down

You say that 2/(29+13*sqrt(5)) = 1/29. Basically an irrational number = a rational number. That is nonsense.

You haven't mentioned how you obtain your "Hugo" number for a given prime index. For example, how did you get Hugo(31) = 169746333457? Please explain the algorithm.

You haven't mentioned how you test/prove a "Hugo" number prime. Please explain the algorithm and its runtime complexity.

Finally, you're comparing the n'th "Hugo" prime to n'th Mersenne prime. That is meaningless. In fact, it merely shows that "Hugo" primes are rarer than Mersenne primes. That's actually a bad thing.

A class of numbers is suitable for prime finding if there is a fast algorithm for proving them and they have higher than average probability (compared to normal numbers of same size) of being prime. You have not discussed either of these aspects.

Last fiddled with by axn on 2021-01-24 at 13:05
axn is offline  
Old 2021-01-24, 13:11   #3
Viliam Furik
 
"Viliam Furík"
Jul 2018
Martin, Slovakia

45610 Posts
Default

Quote:
Originally Posted by Hugo1177 View Post
The Largest Prime Number in the world
We can find bigger prime numbers with this method instead of using Mersenne method.
https://www.researchgate.net/publica...r_in_the_world
Alright, say you get a number (potential prime, according to your method) with a million digits. How quickly can you prove it's prime? Unless you can do it in under 10 minutes, nobody here will be interested.
Viliam Furik is offline  
Old 2021-02-06, 23:15   #4
Hugo1177
 
Aug 2020

24 Posts
Minus Generating Large Prime Numbers

Generating Large Prime Numbers
We can find bigger prime numbers with this method.
https://www.researchgate.net/publica..._Prime_Numbers
Hugo1177 is offline  
Old 2021-02-07, 00:28   #5
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

22·5·307 Posts
Default

Please go ahead and find a "bigger prime number" than M82589933.

We'll wait.
retina is offline  
Old 2021-02-07, 06:21   #6
Kebbaj
 
Kebbaj's Avatar
 
"Kebbaj Reda"
May 2018
Casablanca, Morocco

10101102 Posts
Default

Quote:
Originally Posted by retina View Post
Please go ahead and find a "bigger prime number" than M82589933.

We'll wait.
On risque d'attendre longtemps, je propose:
M82589934!:

Last fiddled with by Kebbaj on 2021-02-07 at 06:31
Kebbaj is offline  
Old 2021-02-07, 08:04   #7
Kebbaj
 
Kebbaj's Avatar
 
"Kebbaj Reda"
May 2018
Casablanca, Morocco

2·43 Posts
Default

Quote:
Originally Posted by Hugo1177 View Post
The Largest Prime Number in the world
We can find bigger prime numbers with this method instead of using Mersenne method.
https://www.researchgate.net/publica...r_in_the_world
not bad,
but we can better calculate 2 ^p-1 and test it?
Attached Thumbnails
Click image for larger version

Name:	hugo.PNG
Views:	41
Size:	46.8 KB
ID:	24276  

Last fiddled with by Kebbaj on 2021-02-07 at 08:08
Kebbaj is offline  
Old 2021-02-07, 11:01   #8
Kebbaj
 
Kebbaj's Avatar
 
"Kebbaj Reda"
May 2018
Casablanca, Morocco

2·43 Posts
Exclamation

Quote:
Originally Posted by Hugo1177 View Post
Generating Large Prime Numbers
We can find bigger prime numbers with this method.
https://www.researchgate.net/publica..._Prime_Numbers

2161 is the next term of your interesting sequance:
{2, 3, 5, 7, 13, 19, 31, 43, 61, 67, 107, 127, 521, 631, 1307, 1619, 2161}

The problem is the proof! /

For exemple the term : 2161 which gives a prime number p = 669520952365187012801734773019730340904793566535457142176946739102321502083823099233857142333677031001451069065917971920110393630255782323617275383
212943748551754288384925199630904669367417248891744299566974703517081390275022885309341549249834446417882777235101767661916361693393317355973961109
361740840788086806308743519390960721768560920934486478379127638410123621994632671617516986749436025270882460170612028677207126354071432082804057852
021567294421457263622220997051953206302416515543266086449620395149849240412230511874765922927106048987389425173585248222630010387862113520387585603
833357934162639402504305302892121580407987900770723163143549061197642212314715010925653640972117561263171417335716694379646482116883767036278222571
382751325272483972072844735317113952796000534401

K.caldwel will not accept it, if you do not know how to factoring p-1 or p + 1 in the helper.

factoring p-1 is difficult for this small number:
2 * 7 * 3 * 1 * 5 * 2 * 7 * 1 * 11 * 1 * 13 * 1 * 17 * 1 * 19 * 1 * 31 * 1 * 61 * 1 * 163 * 1 * 181 * 1 * 433 * 1 * 2161 ** 8641 * 1 * 151201 * 84313972619 * 1163620706029 * ...

we do not talking if it is a large number.

Last fiddled with by Kebbaj on 2021-02-07 at 11:10
Kebbaj is offline  
Old 2021-02-07, 11:02   #9
Kebbaj
 
Kebbaj's Avatar
 
"Kebbaj Reda"
May 2018
Casablanca, Morocco

2×43 Posts
Exclamation

Quote:
Originally Posted by Hugo1177 View Post
Generating Large Prime Numbers
We can find bigger prime numbers with this method.
https://www.researchgate.net/publica..._Prime_Numbers
You can make this interesting sequance in OEIS https://oeis.org

If you want the mathematica code for publication :
d = {}; For[i = 1, i <= 326, i++, a = Prime[i];
sol = Solve[x^(2/a) - 3 x^(4/a) + 1 == 0, x];
p = ToExpression[
StringCases[ToString[Numerator[RootReduce[(x /. sol[[1]])^2]]],
WordCharacter ..][[1]]]; If[PrimeQ[p], AppendTo[d, a]]]; d
Attached Thumbnails
Click image for larger version

Name:	hugo PRG.PNG
Views:	24
Size:	15.6 KB
ID:	24277  

Last fiddled with by Kebbaj on 2021-02-07 at 11:26
Kebbaj is offline  
Old 2021-02-07, 11:45   #10
kriesel
 
kriesel's Avatar
 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

7×17×43 Posts
Default

Quote:
Originally Posted by Kebbaj View Post
On risque d'attendre longtemps, je propose:
M82589934!:
82 589934 = 2 × 3 × 7 × 1 966427
so M82589934 or M(82589934!) mod 3 = 0.
Not a long wait.

https://www.mersenneforum.org/showpo...13&postcount=4
kriesel is online now  
Old 2021-02-07, 14:36   #11
Kebbaj
 
Kebbaj's Avatar
 
"Kebbaj Reda"
May 2018
Casablanca, Morocco

2×43 Posts
Default

Quote:
Originally Posted by kriesel View Post
82 589934 = 2 × 3 × 7 × 1 966427
so M82589934 or M(82589934!) mod 3 = 0.
Not a long wait.

https://www.mersenneforum.org/showpo...13&postcount=4
M8258994, it was just for fun.
thank you!

On the other hand, could you tell if 25463 is the next one on Hugo's sequance?
2,3,5,7,13,19,31,43,61,67,107,127,521,631,1307,1619,2161,.....

Last fiddled with by Kebbaj on 2021-02-07 at 14:38
Kebbaj is offline  
Closed Thread

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
(M48) NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED! dabaichi News 571 2020-10-26 11:02
Sieving freakishly big MMs (was "World record" phone number?) davieddy Operazione Doppi Mersennes 282 2019-06-24 07:57
Number of distinct prime factors of a Double Mersenne number aketilander Operazione Doppi Mersennes 1 2012-11-09 21:16
Estimating the number of prime factors a number has henryzz Math 7 2012-05-23 01:13
World Record Factorial Prime Found rogue Lounge 8 2012-03-02 16:41

All times are UTC. The time now is 23:58.

Tue May 11 23:58:45 UTC 2021 up 33 days, 18:39, 0 users, load averages: 3.02, 3.40, 3.44

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.