Leyland Primes (x^y+y^x primes)

Batalov · 2014-05-12, 21:04

Placeholder for x^y+y^x prime search reservations.

Contact XYYXF to reserve a range. Multisieve is one of the sieve programs capable of sieving this form.

swellman · 2014-05-13, 13:09

Yafu can sieve this form too.

bsquared · 2014-05-13, 13:45

It can?

LaurV · 2014-05-13, 14:12

Sorry, I don't laugh at any of you. It is just about the situation, I expected all in the world but didn't expect Ben's reply to this, in this way! [edit: if some guest read this, maybe they don't know, Ben is yafu's author].

I can't stop laughing.

swellman · 2014-05-13, 14:17

Quote:

Originally Posted by bsquared

It can?

You mean it can't? I thought Yafu did everything.

I stand corrected - Yafu can factor this form via SNFS.

bsquared · 2014-05-13, 14:46

Quote:

Originally Posted by swellman

You mean it can't? I thought Yafu did everything.

I stand corrected - Yafu can factor this form via SNFS.

Err, well, yes, of course it can do everything, except for LaurV's loops and ifs

Yep, you were probably thinking of SNFS factorization.

Batalov · 2014-05-13, 17:54

Well, of course, sieving can be done with almost any program (including your own). But the question is how fast can it sieve. Multisieve is good.

A worked example:
1. Get Multisieve and PFGW
2. Start, select x^y+-y^x mode, select "+", set up some names for outputs, e.g. "xyyx200.out" and "xyyx200.log"; set up limits above previously searched: e.g. x from 200 to 200, y from 20001 to 30000
3. Sieve, after a while, stop (e.g. at 10-20s per candidate)
4. Run pfgw on the "xyyx200.out" file (with -f0 -l)
5. ...
6. PROFIT! e.g. 200^20373+20373^200 is a (new) PRP
7. Submit to PRP top

XYYXF · 2014-05-13, 19:01

Quote:

Originally Posted by Batalov

e.g. x from 200 to 200, y from 20001 to 30000

Conventionally x is always greater than y, and it's also recommended to test all y's for a given x :)

So it's better to take e.g. x from 12501 to 13000, y from 2001 to 12999 :-)

Batalov · 2014-05-13, 19:08

Multisieve reversed that order (because x^y > y^x, for 3<=x<y, and because it sieves for x^y +/- y^x, so it would be convenient to have a positive number). It was an example of setting up Multisieve. Multisieve will require x<y.

Let's start the fun?
I will run the [20001-40000, 11-200] range. Found six new PRPs so far, while warming up.

XYYXF · 2014-05-13, 19:19

OK, http://xyyxf.at.tut.by/primes.html#ranges is updated. But I still hope someone will decrease the number of steps y>10, y>200, y>1000, y>2000 :-)

E.g. it's possible to take [15001-20000, 1001-2000].

rogue · 2014-05-13, 22:28

I haven't touched MultiSieve in years. It's good to know that some people still have use for it. After looking at the code (talk about a blast from the past), I think it would be easy to convert this sieve to OpenCL since it doesn't use a discrete log. An OpenCL version might 100x faster.

2014-05-12, 21:04	#1
Batalov "Serge" Mar 2008 Phi(4,2^7658614+1)/2 3⁶×13 Posts	Leyland Primes (x^y+y^x primes) Placeholder for x^y+y^x prime search reservations. Contact XYYXF to reserve a range. Multisieve is one of the sieve programs capable of sieving this form. Last fiddled with by XYYXF on 2015-02-02 at 15:03

2014-05-13, 14:12	#4
LaurV Romulan Interpreter Jun 2011 Thailand 22613₈ Posts	Sorry, I don't laugh at any of you. It is just about the situation, I expected all in the world but didn't expect Ben's reply to this, in this way! [edit: if some guest read this, maybe they don't know, Ben is yafu's author]. I can't stop laughing. Last fiddled with by LaurV on 2014-05-13 at 14:14

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Leyland Primes: ECPP proofs	Batalov	XYYXF Project	17	2021-07-12 20:05
Mersenne Primes p which are in a set of twin primes is finite?	carpetpool	Miscellaneous Math	3	2017-08-10 13:47
Distribution of Mersenne primes before and after couples of primes found	emily	Math	34	2017-07-16 18:44
On Leyland Primes	davar55	Puzzles	9	2016-03-15 20:55
possible primes (real primes & poss.prime products)	troels munkner	Miscellaneous Math	4	2006-06-02 08:35

2014-05-13, 13:09	#2
swellman Jun 2012 2²·13·59 Posts	Yafu can sieve this form too.

2014-05-13, 13:45	#3
bsquared "Ben" Feb 2007 3·1,171 Posts	It can?

2014-05-13, 17:54	#7
Batalov "Serge" Mar 2008 Phi(4,2^7658614+1)/2 3⁶×13 Posts	Well, of course, sieving can be done with almost any program (including your own). But the question is how fast can it sieve. Multisieve is good. A worked example: 1. Get Multisieve and PFGW 2. Start, select x^y+-y^x mode, select "+", set up some names for outputs, e.g. "xyyx200.out" and "xyyx200.log"; set up limits above previously searched: e.g. x from 200 to 200, y from 20001 to 30000 3. Sieve, after a while, stop (e.g. at 10-20s per candidate) 4. Run pfgw on the "xyyx200.out" file (with -f0 -l) 5. ... 6. PROFIT! e.g. 200^20373+20373^200 is a (new) PRP 7. Submit to PRP top

2014-05-13, 19:08	#9
Batalov "Serge" Mar 2008 Phi(4,2^7658614+1)/2 3⁶×13 Posts	Multisieve reversed that order (because x^y > y^x, for 3<=x<y, and because it sieves for x^y +/- y^x, so it would be convenient to have a positive number). It was an example of setting up Multisieve. Multisieve will require x<y. Let's start the fun? I will run the [20001-40000, 11-200] range. Found six new PRPs so far, while warming up.

2014-05-13, 19:19	#10
XYYXF Jan 2005 Minsk, Belarus 2⁴·5² Posts	OK, http://xyyxf.at.tut.by/primes.html#ranges is updated. But I still hope someone will decrease the number of steps y>10, y>200, y>1000, y>2000 :-) E.g. it's possible to take [15001-20000, 1001-2000].

2014-05-13, 22:28	#11
rogue "Mark" Apr 2003 Between here and the 11×577 Posts	I haven't touched MultiSieve in years. It's good to know that some people still have use for it. After looking at the code (talk about a blast from the past), I think it would be easy to convert this sieve to OpenCL since it doesn't use a discrete log. An OpenCL version might 100x faster.