mersenneforum.org Search Results
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 25 of 1000 Search took 0.24 seconds. Search: Posts Made By: sweety439
 Forum: sweety439 2020-09-29, 14:36 Replies: 1,009 Views: 32,453 Posted By sweety439 The CK for R420 is known to be 6548233 I have... The CK for R420 is known to be 6548233 I have checked it. Note: For the conjecture of R420, these k-values proven composite by partial algebra factors: * k = m^2 with m = = 29 or 392 mod 421...
 Forum: sweety439 2020-09-29, 14:32 Replies: 1,009 Views: 32,453 Posted By sweety439 Changed the CK for S728 from 4606127 to 953974, I... Changed the CK for S728 from 4606127 to 953974, I didn't found this CK since it has a large prime (105997) in the covering set
 Forum: sweety439 2020-09-29, 14:28 Replies: 1,009 Views: 32,453 Posted By sweety439 All Sierpinski/Riesel bases listed "NA" have CK >... All Sierpinski/Riesel bases listed "NA" have CK > 5M (i.e. 5M is the lower bound for these Sierpinski/Riesel bases) upper bounds for these Sierpinski/Riesel bases <= 1024: S66: 21314443 (if not...
 Forum: sweety439 2020-09-29, 13:58 Replies: 1,009 Views: 32,453 Posted By sweety439 The CK for R180 is known to be 7674582 The CK... The CK for R180 is known to be 7674582 The CK for S462 is known to be 6880642 I have checked them. Note: For the conjecture of R180, these k-values proven composite by partial algebra factors: ...
 Forum: sweety439 2020-09-29, 04:38 Replies: 1,009 Views: 32,453 Posted By sweety439 All n must be >= 1. k-values that make a... All n must be >= 1. k-values that make a full covering set with all or partial algebraic factors are excluded from the conjectures. k-values that are a multiple of base (b) and where...
 Forum: sweety439 2020-09-29, 04:24 Replies: 1,009 Views: 32,453 Posted By sweety439 The CK for R66 is 63717671 covering set: {7,... The CK for R66 is 63717671 covering set: {7, 67, 613, 4423}, period=6
 Forum: sweety439 2020-09-28, 14:45 Replies: 1,009 Views: 32,453 Posted By sweety439 Also, there are many reservations for bases > 128... Also, there are many reservations for bases > 128 (except 256, 512, 1024) or k's > CK: S2 primes 78557
 Forum: sweety439 2020-09-28, 14:27 Replies: 1,009 Views: 32,453 Posted By sweety439 Reservations for the Sierpinski/Riesel problems: ... Reservations for the Sierpinski/Riesel problems: S2, all k except 65536: PrimeGrid's Seventeen or Bust (http://www.primegrid.com/forum_thread.php?id=1647) (status...
 Forum: sweety439 2020-09-28, 14:07 Replies: 1,009 Views: 32,453 Posted By sweety439 The CK for S66 is known to be 21314443 (I have... The CK for S66 is known to be 21314443 (I have checked it, no k<21314443 have covering set) The CK for S120, R66, R120 are still running ....
 Forum: sweety439 2020-09-28, 02:40 Replies: 1,009 Views: 32,453 Posted By sweety439 For k = 4, 64, 324, 1024, 2500, 5184, 9604,... For k = 4, 64, 324, 1024, 2500, 5184, 9604, 16384, 26244, 40000, 58564, 82944, 114244, 153664, 202500, 262144, ... (i.e. k is of the form 4*m^4): * All n for all 4th-power bases have algebra...
 Forum: sweety439 2020-09-28, 02:16 Replies: 1,009 Views: 32,453 Posted By sweety439 Update newest file for Sierpinski problems... Update newest file for Sierpinski problems (https://docs.google.com/document/d/e/2PACX-1vQVukcERAlTzkaLL-22PTrOWY0PHGu6EH0KApDxL4gi-8CWia-e2Wa3MKHrpj3dDCkUCYQivzG5VkVm/pub) to include the newest test...
 Forum: sweety439 2020-09-28, 01:55 Replies: 1,009 Views: 32,453 Posted By sweety439 The test limit of GFN's and half GFN's: base... The test limit of GFN's and half GFN's: base 2: According to http://www.prothsearch.com/fermat.html, the first numbers n>=5 such that 2^(2^n)+1 might be primes are 33, 34, 35, 40, 41, 44, 45,...
 Forum: sweety439 2020-09-25, 10:27 Replies: 1,009 Views: 32,453 Posted By sweety439 Status for 2<=b<=128 and 1<=k<=128: ... Status for 2<=b<=128 and 1<=k<=128: Sierpinski (https://en.wikipedia.org/w/index.php?title=Wikipedia:Sandbox&oldid=980224043) Riesel...
 Forum: sweety439 2020-09-24, 07:23 Replies: 1,009 Views: 32,453 Posted By sweety439 Sierpinski conjectures and proofs... Sierpinski conjectures and proofs (https://docs.google.com/document/d/e/2PACX-1vQPjYgjFaa0W5koDtgCNeP6y9GerLvxD1L79zfDv4U1-ah4eLG9KWg5yR5nPa3MK3F4yfMpCV9458Wi/pub) Riesel conjectures and proofs...
 Forum: sweety439 2020-09-24, 01:02 Replies: 1,009 Views: 32,453 Posted By sweety439 Conjectured smallest Sierpinski k for bases... Conjectured smallest Sierpinski k for bases 2<=b<=2500: (NA if >5000000) b,CK 2,78557 3,11047 4,419 5,7 6,174308 7,209
 Forum: sweety439 2020-09-24, 01:01 Replies: 1,009 Views: 32,453 Posted By sweety439 Conjectured smallest Riesel k for bases... Conjectured smallest Riesel k for bases 2<=b<=2500: (NA if >5000000) b,CK 2,509203 3,12119 4,361 5,13 6,84687 7,457
 Forum: sweety439 2020-09-24, 00:32 Replies: 1,009 Views: 32,453 Posted By sweety439 Sierpinski k=8: b = 128 has no possible prime Sierpinski k=8: b = 128 has no possible prime
 Forum: sweety439 2020-09-24, 00:32 Replies: 1,009 Views: 32,453 Posted By sweety439 proven to be composite for all n by partial... proven to be composite for all n by partial algebraic factors: Riesel k=1: (none) Riesel k=2: (none) Riesel k=3: (none) Riesel k=4: b == 4 mod 5 Riesel k=5: (none) Riesel k=6: b = 6*m^2 with...
 Forum: sweety439 2020-09-24, 00:27 Replies: 1,009 Views: 32,453 Posted By sweety439 proven to be composite for all n (or only be... proven to be composite for all n (or only be prime for very small n) by all algebraic factors: Riesel k=1: b = m^r with r>1 Riesel k=2: (none) Riesel k=3: (none) Riesel k=4: b = m^2 Riesel...
 Forum: sweety439 2020-09-23, 23:38 Replies: 1,009 Views: 32,453 Posted By sweety439 proven to be composite by covering set: ... proven to be composite by covering set: Riesel k=1: (none) Riesel k=2: (none) Riesel k=3: (none) Riesel k=4: b == 14 mod 15 Riesel k=5: b == 11 mod 12 Riesel k=6: b == 34 mod 35 Riesel k=7:...
 Forum: sweety439 2020-09-23, 23:13 Replies: 1,009 Views: 32,453 Posted By sweety439 Riesel k=9: {107, 207, 237, 325, 347, 378, 438,... Riesel k=9: {107, 207, 237, 325, 347, 378, 438, 483, 536, 566, 570, 592, 636, 688, 705, 711, 718, 823, 830, 835, 852, 893, 907, 926, 927, 995, 1010} (totally 27 bases) Riesel k=10: {80, 233, 262,...
 Forum: sweety439 2020-09-23, 21:16 Replies: 1,009 Views: 32,453 Posted By sweety439 Riesel k=5: {31, 117, 181, 338, 411, 429, 489,... Riesel k=5: {31, 117, 181, 338, 411, 429, 489, 499, 535, 581, 583, 631, 717, 757, 998} (totally 15 bases) Riesel k=6: {234, 412, 549, 553, 573, 619, 750, 878, 894, 954, 986} (totally 11 bases)...
 Forum: sweety439 2020-09-23, 20:02 Replies: 1,009 Views: 32,453 Posted By sweety439 See... See https://github.com/xayahrainie4793/Sierpinski-Riesel-for-fixed-k-and-variable-base for the status of 1<=k<=12 and 2<=b<=1024, all searched to n>=6000 (n>=100000 for gcd(k+-1,b-1) (+ for...
 Forum: sweety439 2020-09-23, 01:42 Replies: 11 Views: 1,607 Posted By sweety439 Problem: For given integer triple (k,b,c), k>=1,... Problem: For given integer triple (k,b,c), k>=1, b>=2, c != 0, gcd(k,c)=1, gcd(b,c)=1, find the smallest possible value for bigomega((k*b^n+c)/gcd(k+c,b-1)), where n is integer >=1
 Forum: sweety439 2020-09-22, 22:56 Replies: 1,009 Views: 32,453 Posted By sweety439 Conjecture: For integer triple (k,b,c), k>=1,... Conjecture: For integer triple (k,b,c), k>=1, b>=2, c != 0, gcd(k,c)=1, gcd(b,c)=1, there is a prime of the form (k*b^n+c)/gcd(k+c,b-1) with integer n>=1 if and only if (k*b^n+c)/gcd(k+c,b-1) has no...
 Showing results 1 to 25 of 1000

All times are UTC. The time now is 23:56.

Tue Sep 29 23:56:07 UTC 2020 up 19 days, 21:07, 0 users, load averages: 1.57, 1.64, 1.55

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.