mersenneforum.org Carol / Kynea Primes
 Register FAQ Search Today's Posts Mark Forums Read

 2017-04-22, 18:44 #89 rogue     "Mark" Apr 2003 Between here and the 7·23·41 Posts sweety439, what range of n are you searching?
 2017-04-23, 14:04 #90 sweety439     "99(4^34019)99 palind" Nov 2016 (P^81993)SZ base 36 338910 Posts I tested to about n=2000 and found only these primes. At beginning, I decided to search to n=10K, but it will take too much time, so I released it.
2017-04-23, 15:47   #91
rogue

"Mark"
Apr 2003
Between here and the

7·23·41 Posts

Quote:
 Originally Posted by sweety439 I tested to about n=2000 and found only these primes. At beginning, I decided to search to n=10K, but it will take too much time, so I released it.
If you properly sieved, it should take less than a day to test n=10000.

 2017-04-24, 08:55 #92 kar_bon     Mar 2006 Germany 23·32·41 Posts Primes for CK Base 44, tested up to n=25K: (44^8210+1)^2-2 (44^12909-1)^2-2 (44^20502+1)^2-2
 2017-04-28, 08:31 #93 vasyannyasha     "Vasiliy" Apr 2017 Ukraine 32×7 Posts base 252 up to n=2000 (252^88-1)^2-2 (252^177+1)^2-2 (252^337-1)^2-2 (252^717-1)^2-2 is 3-PRP! (0.3107s+0.0002s) (252^1330-1)^2-2 is 3-PRP! (0.9531s+0.0002s) (252^1468+1)^2-2 is 3-PRP! (1.6530s+0.0002s) (252^1996-1)^2-2 is 3-PRP! (2.4196s+0.0003s) please explain if program write ''(252^1996-1)^2-2 is 3-PRP!'' it means that this number really prime or 50/50? Pre-thanks P.S first three really primes.
 2017-04-28, 09:02 #94 kar_bon     Mar 2006 Germany 1011100010002 Posts With pfgw use the "-tp" option to prove prime. So pfgw -q"(252^717-1)^2-2" will show (252^717-1)^2-2 is 3-PRP! but pfgw64 -tp -q"(252^717-1)^2-2" will show Primality testing (252^717-1)^2-2 [N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 17, base 1+sqrt(17) (252^717-1)^2-2 is prime! (0.6952s+0.0011s)
 2017-04-28, 14:26 #95 rogue     "Mark" Apr 2003 Between here and the 7×23×41 Posts FYI, you only need to report in increments of 10,000. It will save me time.
2017-04-29, 14:48   #96
vasyannyasha

"Vasiliy"
Apr 2017
Ukraine

32×7 Posts

Quote:
 Originally Posted by rogue FYI, you only need to report in increments of 10,000. It will save me time.
Ok.
Finally for base 252 from n=1 to n=10000 i find 9 primes(7 Carol primes and 2 Kynea primes).
(252^88-1)^2-2 is prime! (0.0380s+0.0005s)
(252^177+1)^2-2 is prime! (0.0915s+0.0009s)
(252^337-1)^2-2 is prime! (0.2384s+0.0009s)
(252^717-1)^2-2 is prime! (1.2084s+0.0009s)
(252^1330-1)^2-2 is prime! (8.1088s+0.0236s)
(252^1468+1)^2-2 is prime! (8.6567s+0.0053s)
(252^1996-1)^2-2 is prime! (16.5803s+0.0061s)
(252^3095-1)^2-2 is prime! (37.3119s+0.0015s)
(252^6548-1)^2-2 is prime! (159.6788s+0.0013s)

 2017-06-27, 16:04 #97 Dylan14     "Dylan" Mar 2017 24×37 Posts For base 50, 50001 <= n <= 100000, the following primes were found: Code:  (50^53351-1)^2-2 (50^69033-1)^2-2 (50^69157-1)^2-2
 2017-06-27, 16:24 #98 rogue     "Mark" Apr 2003 Between here and the 7·23·41 Posts Thanks. I've been neglecting to post an updated page. I'll try to remind myself to do that tonight.
 2017-06-27, 23:41 #99 rogue     "Mark" Apr 2003 Between here and the 19C916 Posts My Carol/Kynea webpage has been updated!

 Similar Threads Thread Thread Starter Forum Replies Last Post rogue And now for something completely different 334 2022-05-25 12:04 emily Math 34 2017-07-16 18:44 rogue And now for something completely different 37 2016-06-18 17:58 science_man_88 Lounge 10 2010-12-13 23:26 troels munkner Miscellaneous Math 4 2006-06-02 08:35

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

Wed May 25 23:00:48 UTC 2022 up 41 days, 21:02, 0 users, load averages: 0.99, 1.21, 1.30