mersenneforum.org  

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

Closed Thread
 
Thread Tools
Old 2020-08-31, 18:03   #12
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2·4,591 Posts
Default

... ... Easily sniped.
Batalov is offline  
Old 2020-08-31, 18:14   #13
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

22·32·53 Posts
Default

Quote:
Originally Posted by mathwiz View Post
Putting this to rest:

[CODE]$ ./pfgw64 -i -V -N -T8 -q"((2^1875230-1)*10^564501+2^1875229-1)"
The problem with doing this is that it achieves the opposite of your hope- rather than show the OP that his ideas are bunk and shouldn't be written out in public, it teaches him that if he asks a dumb enough question, someone will do the calculation work for him to show it's dumb. What he wants is someone to do the computing, and you did his bidding.

We prefer you didn't.

It's cool to post the command you would use (as you also did), so that OP could do it himself if he wasn't so lazy.
VBCurtis is online now  
Old 2020-08-31, 18:15   #14
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2·4,591 Posts
Exclamation

MOD NOTE: next cry of "Fire!" in a cinema theater will be punished by a detention.

People do come to this forum to find news of a, say, next Mersenne prime (which are now pre-screened as PRPs), so the next person who will call their thread "Probable prime" and when asked for reasons why that did such a thing would show a patty cake made out of #2, will get that cake on their face and a two week banishment as well. Call it something else, like "I made up a number", or "asking for an advice" or "I don't know how to check this", or whatever.
Batalov is offline  
Old 2020-09-01, 07:21   #15
enzocreti
 
Mar 2018

17·31 Posts
Default ...but this is almost surely PRP!

(2^3680800-1)*10^1108031+2^3680799-1
enzocreti is offline  
Old 2020-09-01, 07:32   #16
enzocreti
 
Mar 2018

17×31 Posts
Default ...not that's not prp

how about this:


(2^1430136-1)*10^430514+2^1430135-1???


I made a stupid mistacke


the candidates have the form


pg(69660+1360476n)




because 69660 is the least N congruent to 215 mod 323 and 0 mod 324 and 6 mod 13
enzocreti is offline  
Old 2020-09-01, 07:48   #17
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2·4,591 Posts
Default

Quote:
Originally Posted by enzocreti View Post
...but this is almost surely PRP!
(2^3680800-1)*10^1108031+2^3680799-1
Divisible by 71.

Quote:
Originally Posted by enzocreti View Post
how about this:
(2^1430136-1)*10^430514+2^1430135-1
Divisible by 14437.

Quote:
Originally Posted by enzocreti View Post
how about this:
I made a stupid mistacke
Correct.

How about a 2 weeks ban?
Batalov is offline  
Old 2020-09-01, 07:51   #18
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

5×701 Posts
Default

Quote:
Originally Posted by Batalov View Post
Divisible by 71.


Divisible by 14437.


Correct.

How about a 2 weeks ban?
You beat me to it!
paulunderwood is offline  
Old 2020-09-01, 07:53   #19
enzocreti
 
Mar 2018

20F16 Posts
Default ...i did not...

i did not take into account that N must be 10^m mod 41




let's guess congruent to 1 mod 41




so the candidates must have the form


pg(69660+11992595940n)


impossible to test!

Last fiddled with by enzocreti on 2020-09-01 at 08:01
enzocreti is offline  
Old 2020-09-01, 08:02   #20
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2·4,591 Posts
Default

Quote:
Originally Posted by enzocreti View Post
i did not take into account that N must be 10^m mod 41

let's guess congruent to 1 mod 41
Do. Not. Guess.
There are no guesses in math.
log102 is irrational and just happens to be locally close to 0.3 and that is the only reason that there is some local periodicity of modulos w.r.t. n.
This periodicity doesn't hold for larger values of n, so simply stop posting guesses pulled out of your ear (or, as some less polite folks would say, rear).
Batalov is offline  
Old 2020-09-01, 16:55   #21
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009
U.S.A.

2×7×112 Posts
Default

Quote:
Originally Posted by mathwiz View Post
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.
I have very little interest. These appear to be something simply pulled out of the air. I tried several formats with PFGW. None worked. I did not try the one above. I do not see the point of doing so. End of line...
storm5510 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:29.

Thu Dec 3 01:29:39 UTC 2020 up 83 days, 22:40, 1 user, load averages: 0.81, 1.32, 1.64

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.