20120924, 13:43  #23  
"Forget I exist"
Jul 2009
Dartmouth NS
2×3×23×61 Posts 
Quote:
I used pari from the residues mod 8 that can be prime I get (71)/2 = 3; (51)/2 = 2;(31)/2 = 1 and (11)/2 = 4 mod 8 1,2,3,4 mod 8 = kp; p=7 mod 8, so k = 4,5,6,7 mod 8 185 = 1 mod 8 so if my calcuations are correctly done k=185 is ruled out. Last fiddled with by science_man_88 on 20120924 at 13:44 

20120924, 13:55  #24 
Jun 2003
2·2,719 Posts 

20120924, 13:56  #25 
"Forget I exist"
Jul 2009
Dartmouth NS
2·3·23·61 Posts 
okay I see know it's 7 mod 8 just realized why doh.okay maybe not, I'm missing something clearly.
Last fiddled with by science_man_88 on 20120924 at 13:58 
20120925, 04:35  #26  
"Gary"
May 2007
Overland Park, KS
2^{2}·2,963 Posts 
Quote:
I personally did some trial factoring on all k<=50 and could find no factor < 10M for k=30. k=6 also has a smallest factor of 198623. Those are just two examples where k=2,3 (mod 4) but the smallest factor is not trivial. 

20120925, 05:11  #27 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3·7·479 Posts 
Factors of (any) Mp cannot be 3 or 5 (mod 8). The rest follows.

20120925, 06:00  #28  
Romulan Interpreter
"name field"
Jun 2011
Thailand
24051_{8} Posts 
Quote:
Therefore, factors of M(4z+3) are either 8kp+1 or 8kp+2p+1 (that is 2*(4x)*(4z+3)+1 or 2*(4x+1)*(4z+3)+1 with natural x). Ex: M11 has factors 23 and 89, with k=1=4*0+1, and k=4=4*1 (renaming the right k). M43 has factors 431, 9719 and 2099863, with correspondent k: 5=4*1+1, 113=4*28+1, 24417=4*6104+1. The k's for such numbers can only be 1,4,5,8,9,12,13, etc. Same, factors of M(4z+1) are either 8kp+1, or 8kp+6p+1 (that is 2*(4x)*(4z+1)+1 or 2*(4x+3)*(4z+1)+1 with natural x. Ex: M29 has factors 233, 1103 and 2089, with correspondent k's 4=4*1, 19=4*4+3, 36=4*9. M37 has factor 223 with k=3=4*0+3. Other combinations give composite numbers or primes which are 3 or 5 mod 8, as Batalov said. Those can't be "prime factors" of Mp with prime p. As Mp is always 3 mod 4, it follows that if Mp is prime, MMp may have only factors with k=1 or k=0 mod 4. Remark also that the "plus" factors (the one of the form 1 mod 8) can be in any number, including zero, but the "minus" factors (the one being "1" mod 8) must be in odd number, because Mp is 3 mod 4, and product of two numbers which are 3 (mod 4) is 1 (mod 4). So it can't be an "even" number of "minus" factors. This implies that if Mp is composite, then it has al least one proper factor of the "minus" type (whose k is either 1 or 3 mod 4, depending on p). To filter (I can't say sieve, but very elementary) possible factors for MMp you can try this small pari function to get a better insight. Code:
mmp47(k,startq,stopq)= { p=43112609; until(q>stopq, if(k%4,k+=3,k++); cnt=0; q=startq1; while(q<=stopq && 2*k*(Mod(2,q=nextprime(q++))^p1)+1, if(q>cnt,printf("... %d ...%c",q,13); cnt=cnt+10^6) ); print(k" : "q" "); ); return(q<=stopq); } @sm88: I got your PM, I hope the explanations above satisfy you too. Also, 1G4=1.4*10^9 (from electronics, resistors with 1.27 kiloohms are marked 1k27, to save space on small PCBs, components, etc, generally the notation is used in physics, 3M5 means 3.5 mega, or 3500000, etc, like rounding where the "small amounts" are not interesting). The k=185 is tested to much higher values, you can use the code above but is slow, some guys tested it to 1T or so (I won't bet my life on it, take it like rumors only). Last fiddled with by LaurV on 20120925 at 06:42 

20120925, 09:42  #29 
"Gary"
May 2007
Overland Park, KS
2^{2}×2,963 Posts 
Ah, I get it now. k==(0 or 1 mod 4) is a necessary requirement for a factor of MM43112609. It is not a necessary requirement for the form 2*k*M43112609+1 to be prime.
Based on this, can anyone find a factor of 2*30*M43112609+1 ? I trial factored it to f=~10M. This was the only k<50 that I could not find a factor for of this form. There's no particular reason that it is needed...I'm just curious. 
20120926, 07:28  #30 
Romulan Interpreter
"name field"
Jun 2011
Thailand
3·23·149 Posts 
The k=30 has no factors to 20G8 (that is 2.08*10^10) (I let my little script running overnight in half a core).
If we consider all k's, then "humps" we get at k=54, 83, and another few, below 185. All tested and having no factors below about 3G (a bit more). Did not test them higher then k=185. Proving their primality would be impossible anyhow. For k being 0 or 1 (mod 4) type (the "can be a factor of MMp" type), we have k=185, 201 (both tested to 10G) and 233 (2G55), 273 (2G),384 (2G55), and 513, 521, 560, 593, 656 (all tested to 1G) and few more which I don't remember right now. All k under 1000, for this k type, were tested to 1G. From the "hard" category, there is only one harder then k=5, and that is k=216 who dies at 747M (2*216*Mp+1 is divisible by 747303643). Last fiddled with by LaurV on 20120926 at 08:19 
20120926, 07:37  #31 
Jun 2003
2×2,719 Posts 
On the contrary. It is pretty straightforward to apply a "N1" test to these candidates. (Doing a PRP test is easier still  P95 can do it)
Last fiddled with by axn on 20120926 at 07:38 
20120926, 08:16  #32 
Romulan Interpreter
"name field"
Jun 2011
Thailand
3×23×149 Posts 
Sure, what I wanted to say was "testing them higher by this method of trial factoring will not prove their primality". After I read your post I see that it could be interpreted as "it is impossible to prove them prime by any method". Sorry for this, it was not intended. I always say that "nothing is impossible"

20120926, 08:41  #33 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
274B_{16} Posts 
Don't die laughing. Promise? Ok.
15*2^4311261159 completed P1, B1=150000, B2=3000000, We4: 5B5B93C9 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Is CEMPLLA 1.5 "the only software in the world capable of discovering" something? Not really.  CRGreathouse  Number Theory Discussion Group  51  20181216 21:55 
Official "World cup 2014/2018" teat  LaurV  Hobbies  74  20180711 19:33 
Problem E7 of Richard Guy's "Unsolved problems in number theory"  Batalov  Computer Science & Computational Number Theory  40  20130316 09:19 
Is the USA the "new" peacekeeper of the world??  outlnder  Soap Box  20  20050203 09:30 
Would Minimizing "iterations between results file" may reveal "is not prime" earlier?  nitai1999  Software  7  20040826 18:12 