mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2021-06-24, 23:40   #12
Yusuf
 
Jan 2020

23 Posts
Default

Quote:
Originally Posted by Kebbaj View Post
10 ^ 545 good!
Go to the maximum yusuf.
we compare our max after the solution. if you want?
Sure, I'll let you know what my largest solution is once the challenge ends
Yusuf is offline   Reply With Quote
Old 2021-06-25, 08:19   #13
Kebbaj
 
Kebbaj's Avatar
 
"Kebbaj Reda"
May 2018
Casablanca, Morocco

10111102 Posts
Default

Quote:
Originally Posted by Yusuf View Post
Sure, I'll let you know what my largest solution is once the challenge ends
Ok yusuf.
Thinks.
Kebbaj is offline   Reply With Quote
Old 2021-06-25, 14:16   #14
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

23·7·89 Posts
Default

Quote:
Originally Posted by Yusuf View Post
Solved it today, largest solution I found so far is greater than 10^545
This is inspiring! My original, stupidly written and embarrassingly slow script would still be running to try to reach that high. It did, however, quickly produce solutions > 10^100 which I submitted in early June.

I later had a simple idea that greatly improved my script. I only pushed to 10^400, though.

But when I saw 10^545, how could I resist pushing further? I can report that, if my improved script is writ right, there are two solutions between 10^545 and 10^600.
Dr Sardonicus is offline   Reply With Quote
Old 2021-06-25, 18:57   #15
uau
 
Jan 2017

23·3·5 Posts
Default

With Sage, generating all solutions up to 10^1000 was pretty fast (there are 25 including the example solutions). I tried generating one with more digits, and got a solution above 10^9000.
uau is offline   Reply With Quote
Old 2021-06-25, 20:54   #16
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

115708 Posts
Default

Quote:
Originally Posted by uau View Post
With Sage, generating all solutions up to 10^1000 was pretty fast (there are 25 including the example solutions). I tried generating one with more digits, and got a solution above 10^9000.
Thanks for giving me a way to check my script! It was easy to adjust it to check up to 10^1000. Lo and behold, 25 solutions!
Dr Sardonicus is offline   Reply With Quote
Old 2021-06-26, 04:41   #17
0scar
 
Jan 2020

3610 Posts
Default

Quote:
Originally Posted by uau View Post
With Sage, generating all solutions up to 10^1000 was pretty fast (there are 25 including the example solutions). I tried generating one with more digits, and got a solution above 10^9000.
Your findings below 10^1000 also match mine.
25 solutions up to 10^1000.
34 solutions up to 10^2000.
46 solutions up to 10^3000. Or less?
Last 12 candidates only passed a BPSW test, I stopped primality proving after 10^2000 because APR-CL was becoming too lengthy. Anyway, my aged YAFU implementation can only prove numbers up to 6021 digits, so your finding above 10^9000 is doubly remarkable to me.
I wonder how long did you take to prove it prime, and if you used some code specially written for Leyland numbers.

Last fiddled with by 0scar on 2021-06-26 at 04:43
0scar is offline   Reply With Quote
Old 2021-06-26, 06:45   #18
axn
 
axn's Avatar
 
Jun 2003

19×271 Posts
Default

Are people referring to http://www.primefan.ru/xyyxf/primes.html ?
axn is online now   Reply With Quote
Old 2021-06-26, 12:14   #19
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

23·7·89 Posts
Default

Quote:
Originally Posted by 0scar View Post
<snip>
I wonder how long did you take to prove it prime, and if you used some code specially written for Leyland numbers.
Heck, I just used BPSW [Pari-GP's ispseudoprime() function]. If any of the "small" Leyland numbers I was looking at had "passed" that test but were actually composite, I reckoned that would already be known. I did state in my submitted solution that the numbers had only "passed" a BPSW test.

I note that Pari-GP had no trouble finding representations of the solutions by the quadratic forms specified.
Dr Sardonicus is offline   Reply With Quote
Old 2021-06-26, 21:46   #20
uau
 
Jan 2017

23·3·5 Posts
Default

Quote:
Originally Posted by 0scar View Post
I wonder how long did you take to prove it prime, and if you used some code specially written for Leyland numbers.
I didn't "prove" it prime - in fact I explicitly turned proofs off in Sage to speed things up (I'm not sure why they're enabled by default, seems silly to me). The unrealistic chance that a probabilistic primality test could return a wrong result is a much less relevant worry than the script being buggy, other software error on the machine, or even a hardware failure.
uau is offline   Reply With Quote
Old 2021-06-27, 02:37   #21
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

24·13·47 Posts
Default

Quote:
Originally Posted by axn View Post
Are people referring to ?
Grrr... you kinda spoiled it
LaurV is offline   Reply With Quote
Old 2021-07-01, 03:25   #22
0scar
 
Jan 2020

2416 Posts
Default

Quote:
Originally Posted by LaurV View Post
Grrr... you kinda spoiled it
Actually, it seems that I spoiled it before. Within this thread, I was the first one to say "Leyland" (should I say "xilman"?)

Wikipedia page about Leyland numbers mentions the largest known Leyland proven primes and references XYYXF's search project.
This forum also has many threads about Leyland prp finding / primality proving.
0scar is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
June 2020 tgan Puzzles 16 2020-07-05 22:21
June 2019 Xyzzy Puzzles 5 2019-06-03 05:54
June 2017 R. Gerbicz Puzzles 14 2017-07-03 20:01
June 2016 Xyzzy Puzzles 16 2016-07-07 02:51
June 2015 Batalov Puzzles 10 2015-07-07 14:59

All times are UTC. The time now is 18:00.


Wed Oct 20 18:00:56 UTC 2021 up 89 days, 12:29, 0 users, load averages: 1.42, 1.15, 1.17

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.