mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > XYYXF Project

Reply
 
Thread Tools
Old 2016-03-14, 22:51   #122
NorbSchneider
 
NorbSchneider's Avatar
 
"Norbert"
Jul 2014
Budapest

11011012 Posts
Default

I found 2 new PRPs:
7406^12879+12879^7406, 49837 digits,
8335^12882+12882^8335, 50510 digits.

Andrey, the file factortable_xy-yx_1_100.txt in https://groups.yahoo.com/
neo/groups/ggnfs/files group contains all factorization for x < 101 as
in your results.txt. For 100 < x < 151 as in your results2.txt have I
nothing found to the y^x-x^y numbers.

To the y^x-x^y PRPs have I nothing new found in the above group,
you know y^x-x^y PRPs, thats are not on my webpage?
NorbSchneider is offline   Reply With Quote
Old 2016-03-18, 03:00   #123
pxp
 
pxp's Avatar
 
Sep 2010
Weston, Ontario

23×52 Posts
Default

New PRP: L(15215,4762). I'm still working on eight gaps but that's down from as many as eighteen, having diverted processes to another project: smallest prime containing a given number of zeros. So I don't see myself doing y^x-x^y, Norbert. If anything, after I've had my fill of this diversion, I'll get back to advancing my indexing full on.
pxp is offline   Reply With Quote
Old 2016-03-19, 20:34   #124
NorbSchneider
 
NorbSchneider's Avatar
 
"Norbert"
Jul 2014
Budapest

1558 Posts
Default

I reached x=12,900 and found 1 new PRP:
12356^12885+12885^12356, 52724 digits.
NorbSchneider is offline   Reply With Quote
Old 2016-03-23, 19:51   #125
pxp
 
pxp's Avatar
 
Sep 2010
Weston, Ontario

23×52 Posts
Default

L(13875,3712)
pxp is offline   Reply With Quote
Old 2016-03-26, 09:25   #126
NorbSchneider
 
NorbSchneider's Avatar
 
"Norbert"
Jul 2014
Budapest

6D16 Posts
Default

Quote:
Originally Posted by rogue View Post
I started sieving for x=11301 to x=12400. Unfortunately I only have one computer
Thank you Mark, the range is reserved for you. I also use only one computer to the
search.
NorbSchneider is offline   Reply With Quote
Old 2016-03-26, 12:30   #127
pxp
 
pxp's Avatar
 
Sep 2010
Weston, Ontario

23·52 Posts
Default

L(15631,3816)
pxp is offline   Reply With Quote
Old 2016-03-28, 19:37   #128
pxp
 
pxp's Avatar
 
Sep 2010
Weston, Ontario

23×52 Posts
Default

L(16375,2626)
pxp is offline   Reply With Quote
Old 2016-04-01, 22:38   #129
pxp
 
pxp's Avatar
 
Sep 2010
Weston, Ontario

23·52 Posts
Default

L(13211,7468)
pxp is offline   Reply With Quote
Old 2016-04-03, 01:49   #130
XYYXF
 
XYYXF's Avatar
 
Jan 2005
Minsk, Belarus

24×52 Posts
Default

Please check the updated page: http://www.primefan.ru/xyyxf/primes.html#0
XYYXF is offline   Reply With Quote
Old 2016-04-03, 13:00   #131
pxp
 
pxp's Avatar
 
Sep 2010
Weston, Ontario

23·52 Posts
Default

L(13736,11949). My indexing was recently upped to #1031 L(18661,390) but it will be a little while before I progress further: I haven't even started the next three gaps.
pxp is offline   Reply With Quote
Old 2016-04-03, 20:55   #132
XYYXF
 
XYYXF's Avatar
 
Jan 2005
Minsk, Belarus

24×52 Posts
Default

There are small gaps up to (20956,283). That milestone seems to be reachable :-)

Last fiddled with by XYYXF on 2016-04-03 at 21:48
XYYXF is offline   Reply With Quote
Reply

Thread Tools


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

All times are UTC. The time now is 04:05.


Sat Jul 17 04:05:26 UTC 2021 up 50 days, 1:52, 1 user, load averages: 2.53, 2.23, 1.96

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.