![]() |
|
|
#1 |
|
Mar 2018
2·5·53 Posts |
555915824341 is prime
No other prime found of the form 555...5915824341. Curiously the Wieferich prime 1093 divides 55555555555555555555555555555555915824341 |
|
|
|
|
|
#2 |
|
Jan 2017
3·11 Posts |
Certainly a low-weight sequence, but 5*(10^156-1)/9+360268786 is prime.
|
|
|
|
|
|
#3 |
|
Mar 2018
2·5·53 Posts |
Finitely many?
555915824341 is a quadratic residue mod 1093 Last fiddled with by enzocreti on 2020-02-17 at 23:04 |
|
|
|
|
|
#4 |
|
Feb 2017
Nowhere
4,643 Posts |
I checked the number of leading 5's out to 2000. Four of them gave (pseudo)primes.
Code:
? k=915824341;for(i=1,2000,k*=10;k-=3242419069;if(ispseudoprime(k),print(i))) 3 147 179 1643 1, 4, 7, ... 3*k + 1 leading 5's the number is divisible by 3 2, 8, 14, ... 6*k + 2 leading 5's the number is divisible by 13 so half the numbers are divisible either by 3 or 13. |
|
|
|
|
|
#5 |
|
Mar 2018
2·5·53 Posts |
yes I noted that too
I think that there is an explanation for that |
|
|
|
|
|
#6 |
|
Mar 2018
2×5×53 Posts |
can be given a proof that when the number is divisible by 557, then it is also divisible by 19 and by 13?
5*(10^59-1)/9+360268786 for example is divisible by 557 and by 19 and 13 and a proof that when the number is divisible by 1093 is divisible also by 19 and by 13? Last fiddled with by enzocreti on 2020-02-18 at 11:35 |
|
|
|
|
|
#7 |
|
Mar 2018
2×5×53 Posts |
maybe when the numer has a small factor as 557 or 1093 (primes of the form 8n+5), then it is also divisible by 13 and 19?
so for example 5*(10^23-1)/9+360268786 is divisible by 13, 19 and 29 (prime of the form 8n+5) Last fiddled with by enzocreti on 2020-02-18 at 12:18 |
|
|
|
|
|
#8 | ||
|
Feb 2017
Nowhere
4,643 Posts |
Quote:
Quote:
|
||
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Primes of the form 56^n+1 | enzocreti | enzocreti | 5 | 2020-02-17 16:35 |
| primes of the form (123+4^(9*10^n))/163 | enzocreti | enzocreti | 0 | 2020-02-17 16:28 |
| Primes of the form 4*10^n+1 and primes of the form 16*100^n+1 | enzocreti | enzocreti | 7 | 2019-05-05 13:19 |
| Primes of the Form Mod(p,q) = Mod(x,q) | a1call | Miscellaneous Math | 6 | 2018-12-11 03:34 |
| Primes of the form n+-phi(n) | carpetpool | carpetpool | 3 | 2017-01-26 01:29 |