20220323, 19:04  #23  
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
7^{2}·73 Posts 
Quote:
k*b^n+1 for b not power of 2 and b^n > k: Pocklington N1 primality test k*2^n+1 for k not power of 2 and 2^n > k: Proth primality test 2^n+1: Pรฉpin primality test for Fermat numbers k*b^n1 for b not power of 2 and b^n > k: Morrison N+1 primality test k*2^n1 for k not power of 2 and 2^n > k: LucasโLehmerโRiesel primality test 2^n1: LucasโLehmer primality test for Mersenne numbers Last fiddled with by sweety439 on 20220323 at 19:05 

20220507, 08:51  #24 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
7^{2}·73 Posts 
Predict the smallest integer n such that 67607*2^n+1 is prime
Sierpinski conjectured that 78557 is the smallest odd k such that k*2^n+1 is composite for all integer n (for k = 78557, k*2^n+1 must be divisible by at least one of {3, 5, 7, 13, 19, 37, 73}, thus cannot be prime), and so far, all but 5 smaller odd k have a known prime of the form k*2^n+1, these 5 odd k with no known prime of the form k*2^n+1 are {21181, 22699, 24737, 55459, 67607}, and for these 5 kvalues, 67607 has the lowest Nash weight, and thus I think that 67607 has the largest first prime of the form k*2^n+1 among these 5 kvalues (and hence also among all odd kvalues smaller than 78557), so, let's guess the range of the n for k = 67607
(currently, 67607*2^n+1 has been tested to 36M (> 2^25) without primes found, thus n < 2^25 is impossible) Last fiddled with by sweety439 on 20220507 at 08:58 
20220507, 10:06  #25 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
10011010110101_{2} Posts 
Predict based on what? Are you, perhaps, a blonde?
https://www.reddit.com/r/Jokes/comme...et_a_dinosaur/ 
20220511, 07:45  #26 
Romulan Interpreter
"name field"
Jun 2011
Thailand
2725_{16} Posts 

20220521, 08:14  #27 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
DF9_{16} Posts 
When will 8*13^32020+183 (the largest minimal prime in base 13, see https://github.com/curtisbright/mepn...minimal.13.txt and https://cs.uwaterloo.ca/~cbright/reports/mepn.pdf) be verified? Also see this article.
(if this number is verified, then we will complete the classification of the minimal elements of the primes in base 13, since all other minimal primes in base 13 are < 10^345, thus easily to be proven primes) Last fiddled with by sweety439 on 20220521 at 08:37 
20220521, 08:46  #28  
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
3577_{10} Posts 
Quote:
* (79*73^93391)/6 (R73) * (27*91^50481)/2 (R91) * (133*100^54961)/33 (R100) * (3*107^49001)/2 (R107) * (27*135^32501)/2 (R135) * (201*141^52791)/20 (R141) * (1*174^32511)/173 (R174) * (11*175^30481)/2 (R175) * (191*105^5045+1)/8 (S105) * (11*256^5702+1)/3 (S256) Except the first and the last of these, they are smaller than your 3543^3052+3052^3543 I think they are more interesting than Leyland numbers, since they are of the form (a*b^n+c)/gcd(a+c,b1) (with a>=1, b>=2, c != 0, gcd(a,c) = 1, gcd(b,c) = 1), this includes the classic sequences: * Mersenne numbers 2^n1 * 2^n+1 * k*2^n1 * k*2^n+1 * Generalized repunits in base b: (b^n1)/(b1) (see http://www.fermatquotient.com/PrimSerien/GenRepu.txt) * b^n+1 for even b (see http://jeppesn.dk/generalizedfermat.html) * (b^n+1)/2 for odd b (see http://www.fermatquotient.com/PrimSerien/GenFermOdd.txt) * k*b^n+1 (Sierpinski conjecture base b) * k*b^n1 (Riesel conjecture base b) etc. Last fiddled with by sweety439 on 20220521 at 08:51 

20220521, 10:20  #29  
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
11·1,039 Posts 
Quote:
I found it very easy to get ecppmpi running. It is now churning away on one of my systems which is testing 45986bit PRP. At 45618 bits the last of your list is smaller than the one I am running so it should not be too difficult for your resources. 

20220521, 12:23  #30  
Sep 2002
Database er0rr
4253_{10} Posts 
Quote:
Last fiddled with by paulunderwood on 20220521 at 12:43 

20220521, 13:03  #31  
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
11·1,039 Posts 
Quote:
As well as the WSL solution it is always possible to dualboot a system. 

20220521, 22:29  #32 
Mar 2019
100100111_{2} Posts 

20220521, 23:01  #33  
If I May
"Chris Halsall"
Sep 2002
Barbados
2·5,297 Posts 
Quote:
I recently fired a client because I was fed up with dealing with their WinCrows machines selfdestructing. I was very clear that I was more than happy to continue to support their Linuxbased backend systems, but I would no longer support their workstations. I gave them several suggestions for those who would be willing to support them; I never abandon a client. BTW... The client was my girlfriend... 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Off topic  kriesel  kriesel  6  20210116 16:31 
Off topic  board games on the web  robert44444uk  Lounge  3  20190305 08:51 
Side Topic: 'It's Not a Toomah'  R.D. Silverman  Math  68  20151115 04:21 
Topic of Peepholes Friendship :)  coffee1054  Lounge  7  20120217 03:38 
AMD vs. Intel topic  Pjetro  Hardware  11  20021104 21:00 