20220819, 15:22  #67 
Romulan Interpreter
"name field"
Jun 2011
Thailand
10113_{10} Posts 
You just invented a very obfuscated way to compute Eulers's Totient (pari: eulerphi) function, or what?

20220819, 15:29  #68  
Jul 2022
2^{2}×13 Posts 
Quote:
If you are referring to post #66 To search for possible remainders q (modulo bW), proceed as described in post #54: Set bW=2*p*k then k=bW/2/p=PrimesBaseProd=2*p1*p2*...*pn if q is a possible factor q=1+2*p*k1=RW[i]+bW*j with 0<=i<nR possibile remainder RW[i] = q (modulo bW) then k1=(RW[i]1)/2/p+(bW/2/p)*j with (RW[i]1)/2/p = k1 (modulo bW/2/p) = k1 (mod k) so if k=0(mod 4) then bW=0(mod 8) to speed up the search it is possible to evaluate only p=1(mod 4) or p=3(mod 4) cases in fact if r is a remainders then it must be r=1(mod 8) or r=7(mod 8): for 0 <= a < k/4 r=1+8*p*a and r=1+2*p+8*p*a if p%4=3 or r=1+6*p+8*p*a if p%4=1 from these remainders you have to remove those that have factors in common with bW so since r=1(mod 2*p) if p1=2 remove those are divisible by p2,...,pn Note that as mentioned in a previous post the value of nR depends on n_PB: nR=2 if n_PB = 1, nR=4 if n_PB = 2, nR=16 if n_PB = 3, nR=96 if n_PB = 4 and nR=960 if n_PB = 5 and if you have no memory problems you can add prime numbers > 11 in PrimesBase and increase n_PB although I don't know if there are any advantages in terms of speed. Last fiddled with by User140242 on 20220819 at 15:34 

20220819, 17:31  #69 
Jul 2022
2^{2}×13 Posts 
In reference to your question in #67 the eulerphi function maybe allows you to calculate nR but I am interested in the possible remainders so you can use q = RW[i] + bW * j.
For example it is possible to calculate the vector v used in Trial factoring, part 2 of 3 simply by setting n_PB=2 and adding this piece of code Code:
std::vector<int64_t> v; v.push_back((RW[1]1)/2/P); for (int64_t i=2;i<nR;i++) v.push_back((RW[i]1)/2/P(RW[i1]1)/2/P); v.push_back(PrimesBaseProd(RW[nR1]1)/2/P); 
20220820, 05:26  #70 
"Καλός"
May 2018
3×11^{2} Posts 
Post #62 is concerned with arbitrary primes p, placing additional conditions on p gives further refinements indeed.

20220821, 12:56  #71  
Feb 2017
Nowhere
2^{5}·11·17 Posts 
Quote:
Quote:
Then, in this post you proclaimed "exhaustive computations indicate" something that is obvious from the first formulas for k given in the first post linked to above. So perhaps you can help me with a similar problem. I've run extensive computations, reducing battalions of supercomputers to molten slag, which indicate that no number greater than 5 which in decimal ends in 0, 2, 4, 5, 6, or 8, is prime. Of course, I have no idea why this could possibly be true. 

20220822, 12:03  #72  
"Καλός"
May 2018
3·11^{2} Posts 
Quote:
It can be argued from the standpoint of hardware and software testing that there is no such thing as unnecessary computations though. Running computation tests produces errors and soon or later one of the "battalions of supercomputers" would in error (for instance, see https://en.wikipedia.org/wiki/Integer_overflow) give a prime. 

20220823, 01:14  #73 
"Καλός"
May 2018
3·11^{2} Posts 
Examples of the first Mersenne numbers for which there are three consecutive factors for a given value of k_{3} with k_{3} = k_{2} + k_{1} are:
 M1527857 with factors {21389999, 12222857, 9167143}. Here 7 = 4 + 3.  M159541 with factors {3509903, 2552657, 957247}. Here 11 = 8 + 3. Last fiddled with by Dobri on 20220823 at 01:29 
20220823, 06:43  #74  
Romulan Interpreter
"name field"
Jun 2011
Thailand
3·3,371 Posts 
Quote:
The last paragraph is priceless.... 

20220823, 06:55  #75  
Romulan Interpreter
"name field"
Jun 2011
Thailand
2781_{16} Posts 
Quote:
I still have this "feeling" that mersenne factors and fermat factors have more chances to be also aliquot factors, compared with the other primes. If you think about, THERE IS a connection, because all those "drivers" are related to perfect numbers, which in turn are strong related to mersenne primes. If the drivers are persistent, guides are persistent (guide is a driver from which some factors were removed, so it is just a "partial" driver), then why the factors alone couldn't be persistent too? So, when I look to factorDB aliquot sequences and see the small primes that factor each terms, I have the tendency to only see 3, 5, 7, 17, 23, 47, 89, 223, 233, etc, and I have this "feeling" that there are more such primes than "the others" of comparable size, and they are also "persistent" (their chances to appear again and again from a term to the next seems higher) than the other primes that come and go. So, maybe you can try to "intensively test" all the aliquot factors in factorDB and see if they are indeed factors of some mersenne numbers in our range of interest? (i.e. under 1G exponents, or under 32 bits exponents more generally). That way, at least, you would use your energy in a more useful way, and maybe you get lucky and really find some huge factors there Last fiddled with by LaurV on 20220823 at 06:58 

20220823, 12:34  #76 
Feb 2017
Nowhere
2^{5}·11·17 Posts 
One would expect q1 = 6*p + 1, q2 = 8*p + 1, and q3 = 14*p + 1 all to be prime for infinitely many p == 1 (mod 4). One would also expect 2 to be a 6th power residue (mod q1), 8th power residue (mod q2), and 14thpower residue (mod q3) for a positive proportion of such (q1, q2, q3). (My best guess at the "positive proportion" is 1/84.)
I checked for such p, q1, q2, q3 up to the limit p < 1.1 x 10^{8}. Up to that limit, there are 2383 p == 1 (mod 4) for which q1, q2, and q3 are all prime. Of these, there are 23 for which q1, q2, and q3 all divide 2^p  1. Thus, among p < 1.1 x 10^{8} the proportion of prime triples (q1, q2, q3) all dividing 2^p  1 is a bit lower than 1/84. The values p q1 q2 q3 with p < 10^{7} are 1527857 9167143 12222857 21389999 1684937 10109623 13479497 23589119 3524537 21147223 28196297 49343519 6317357 37904143 50538857 88442999 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Repeating residues in LL tests of composite Mersenne numbers  Viliam Furik  Number Theory Discussion Group  22  20201208 14:45 
Mersenne number with exponent 333333367 is composite  TheGuardian  GPU Computing  25  20190509 21:53 
Factoring composite Mersenne numbers using Pollard Rho  jshort  Factoring  9  20190409 16:34 
2 holes in bizarre theorem about composite Mersenne Numbers  wildrabbitt  Math  120  20160929 21:52 
Factoring highly composite Mersenne numbers  philmoore  Factoring  21  20041118 20:00 