mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > enzocreti

Closed Thread
 
Thread Tools
Old 2020-08-31, 11:27   #1
enzocreti
 
Mar 2018

10000011112 Posts
Default probable dud

((2^1875230-1)*10^564501+2^1875229-1) has small factors?


I don't know...
enzocreti is offline  
Old 2020-08-31, 13:47   #2
mathwiz
 
Mar 2019

127 Posts
Default

Well, have you PRP tested this with PFGW? Or are you asking us to do it for you?

Last fiddled with by enzocreti on 2020-08-31 at 13:51
mathwiz is offline  
Old 2020-08-31, 13:50   #3
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

5×11×107 Posts
Default

Quote:
Originally Posted by mathwiz View Post
Or are you asking us to do it for you?
It wouldn't be much different from Google demanding everyone do their job for them with the captcha images.
retina is offline  
Old 2020-08-31, 13:52   #4
enzocreti
 
Mar 2018

17·31 Posts
Default

Quote:
Originally Posted by mathwiz View Post
Well, have you PRP tested this with PFGW? Or are you asking us to do it for you?


Unfortunally my computer is broken!
enzocreti is offline  
Old 2020-08-31, 15:08   #5
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

5,939 Posts
Default

So what makes you think it is a probable prime?
CRGreathouse is offline  
Old 2020-08-31, 15:34   #6
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009
U.S.A.

2·7·112 Posts
Default

Quote:
Originally Posted by enzocreti View Post
((2^1875230-1)*10^564501+2^1875229-1) has small factors?
This appears to be a request for somebody with a lot of cores to run it. I am not sure PFGW could handle it in this form. Then again, maybe it could. Any person trying may need several generations of descendants to see it done. It might have to look something like this though:

Quote:
(((2^1875230-1)*10^564501+2)^1875229-1)
I am not sure how PFGW handles parenthetical's or if it will accept them at all.
storm5510 is offline  
Old 2020-08-31, 15:43   #7
enzocreti
 
Mar 2018

52710 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
So what makes you think it is a probable prime?
Pg(69660) is prime


69660 is multiple of 215 and congruent to 215 mod 323...it is also 6 mod 13... using wolphram numbers of this form are 69660+xn where x i don't remember what it is.

69660 is the least number N such that N is 215 mod 323, N is 0 mod 215 and N is 6 mod 13...
then you have other values using Chinese remainder theorem
enzocreti is offline  
Old 2020-08-31, 15:43   #8
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

23·1,117 Posts
Default


Uncwilly is online now  
Old 2020-08-31, 15:52   #9
mathwiz
 
Mar 2019

127 Posts
Default

Quote:
Originally Posted by enzocreti View Post
Unfortunally my computer is broken!
so how/where did you somehow come up with this number?
mathwiz is offline  
Old 2020-08-31, 17:36   #10
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

134638 Posts
Default

Quote:
Originally Posted by enzocreti View Post
Pg(69660) is prime


69660 is multiple of 215 and congruent to 215 mod 323...it is also 6 mod 13... using wolphram numbers of this form are 69660+xn where x i don't remember what it is.

69660 is the least number N such that N is 215 mod 323, N is 0 mod 215 and N is 6 mod 13...
then you have other values using Chinese remainder theorem
I agree that 69660 == chinese([Mod(215,323), Mod(0,215), Mod(6,13)]), and I'm prepared to assume that Pg(69660) is prime. But why should that make us think that

((2^1875230-1)*10^564501+2^1875229-1)

is likely to be prime?
CRGreathouse is offline  
Old 2020-08-31, 17:59   #11
mathwiz
 
Mar 2019

7F16 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
So what makes you think it is a probable prime?
Putting this to rest:

Code:
$ ./pfgw64 -i -V -N -T8 -q"((2^1875230-1)*10^564501+2^1875229-1)"
PFGW Version 4.0.0.64BIT.20190528.x86_Dev [GWNUM 29.8]

Generic modular reduction using generic reduction AVX-512 FFT length 384K, Pass1=1K, Pass2=384, clm=1, 8 threads on A 3750464-bit number                                    
Resuming at bit 1480000                                    
((2^1875230-1)*1....501+2^1875229-1) is composite: RES64: [52E573162A497910] (5201.6106s+0.0149s)
As to whether the factors are small, I have neither the time nor interest to care.
mathwiz is offline  
Closed Thread

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Probability to find a probable prime enzocreti enzocreti 2 2019-09-23 06:13
Is 2^10283794-1||2^10283793-1 probable prime? enzocreti enzocreti 9 2019-09-16 07:04
The probable primes philmoore Five or Bust - The Dual Sierpinski Problem 388 2019-03-01 04:30
Probable prime with more than 400k digits enzocreti enzocreti 2 2019-02-10 16:17
probable largest prime. sudaprime Miscellaneous Math 11 2018-02-05 08:10

All times are UTC. The time now is 01:50.

Thu Dec 3 01:50:12 UTC 2020 up 83 days, 23:01, 1 user, load averages: 3.15, 2.41, 2.08

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.