mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > enzocreti

Reply
 
Thread Tools
Old 2020-02-17, 22:01   #1
enzocreti
 
Mar 2018

2×5×53 Posts
Default Primes of the form 555... 915824341

555915824341 is prime


No other prime found of the form 555...5915824341.

Curiously the Wieferich prime 1093 divides

55555555555555555555555555555555915824341
enzocreti is offline   Reply With Quote
Old 2020-02-17, 22:17   #2
NHoodMath
 
Jan 2017

3×11 Posts
Default

Certainly a low-weight sequence, but 5*(10^156-1)/9+360268786 is prime.
NHoodMath is offline   Reply With Quote
Old 2020-02-17, 22:23   #3
enzocreti
 
Mar 2018

10228 Posts
Default ...

Finitely many?

555915824341 is a quadratic residue mod 1093

Last fiddled with by enzocreti on 2020-02-17 at 23:04
enzocreti is offline   Reply With Quote
Old 2020-02-18, 00:21   #4
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

110438 Posts
Default

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
I note that if there are

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.
Dr Sardonicus is offline   Reply With Quote
Old 2020-02-18, 10:28   #5
enzocreti
 
Mar 2018

2·5·53 Posts
Default ...

yes I noted that too
I think that there is an explanation for that
enzocreti is offline   Reply With Quote
Old 2020-02-18, 11:30   #6
enzocreti
 
Mar 2018

2·5·53 Posts
Default Proof

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
enzocreti is offline   Reply With Quote
Old 2020-02-18, 12:15   #7
enzocreti
 
Mar 2018

2·5·53 Posts
Default primes of the form 8n+5

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
enzocreti is offline   Reply With Quote
Old 2020-02-18, 19:34   #8
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

4,643 Posts
Default

Quote:
Originally Posted by enzocreti View Post
can be given a proof that when the number is divisible by 557, then it is also divisible by 19 and by 13?
Counterexample: 5*(10^337-1)/9+360268786
Quote:
and a proof that when the number is divisible by 1093 is divisible also by 19 and by 13?
Counterexample: 5*(10^314-1)/9+360268786

Dr Sardonicus is offline   Reply With Quote
Reply



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

All times are UTC. The time now is 04:52.


Sat Jul 17 04:52:42 UTC 2021 up 50 days, 2:39, 1 user, load averages: 1.85, 1.93, 2.04

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.