Primes of the form $((2^k-1)10^m+2^{(k-1)}+10)/42$, where m is the number of decimal digits of $2^{k-1}-1$
up vote
1
down vote
favorite
Primes of the form $dfrac{(2^k-1)*10^m+2^{(k-1)}+10}{42}$, where $m$ is the number of decimal digits of $2^{k-1}-1$.
With Pari I found that primes occur for $k=3,, 6, 12, 36, 105, 156,336, 2286, 4272,$ $4427, 11979, 20076, 29343, 29988, 30405$. $:$
The first thing I would ask is this: why there is only one $k=4427$ which is not a multiple of 3, whereas all the other $k$'s $(3, 6, 12, 36, 105, 156, 336, 2286, 4272, 11979, 20076, 29343, 29988, 30405)$ are congruent to $0mod3$.$:$ Is there any mathematical reason?$:$
The second question is: could be $k$ be of the form $3s+1$, i mean is there a $k$ of the form $3s+1$ such that $dfrac{(2^k-1)*10^m+2^{(k-1)}+10}{42}$ is prime?
The question is related to this other question:
A conjecture about numbers of the form $10^{m}(2^{k}−1)+2^{k-1}−1$, where $m$ is the number of decimal digits of $ 2^{k-1}$.
number-theory
asked 2 days ago
paolo galli
63
New contributor
paolo galli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
up vote
1
down vote
favorite
Primes of the form $dfrac{(2^k-1)*10^m+2^{(k-1)}+10}{42}$, where $m$ is the number of decimal digits of $2^{k-1}-1$.
With Pari I found that primes occur for $k=3,, 6, 12, 36, 105, 156,336, 2286, 4272,$ $4427, 11979, 20076, 29343, 29988, 30405$. $:$
The first thing I would ask is this: why there is only one $k=4427$ which is not a multiple of 3, whereas all the other $k$'s $(3, 6, 12, 36, 105, 156, 336, 2286, 4272, 11979, 20076, 29343, 29988, 30405)$ are congruent to $0mod3$.$:$ Is there any mathematical reason?$:$
The second question is: could be $k$ be of the form $3s+1$, i mean is there a $k$ of the form $3s+1$ such that $dfrac{(2^k-1)*10^m+2^{(k-1)}+10}{42}$ is prime?
The question is related to this other question:
A conjecture about numbers of the form $10^{m}(2^{k}−1)+2^{k-1}−1$, where $m$ is the number of decimal digits of $ 2^{k-1}$.
number-theory
asked 2 days ago
paolo galli
63
New contributor
paolo galli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
@Taneli Huuskonen@lulu is there some mathematical reason for that?
– paolo galli
2 days ago
(PARI) ec(n)= fromdigits(concat(digits(2^n-1), digits(2^(n-1)-1))) for(j=2, 10^4, s=ec(j); if(Mod(s+11, 42)==0, if(ispseudoprime((s+11)/42)==1, print1(j, ", "))))
– paolo galli
2 days ago
@Especially Lime is there any particular mathematical reason why primes of this type occur more often when k is a multiple of 3?
– paolo galli
2 days ago
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Primes of the form $dfrac{(2^k-1)*10^m+2^{(k-1)}+10}{42}$, where $m$ is the number of decimal digits of $2^{k-1}-1$.
With Pari I found that primes occur for $k=3,, 6, 12, 36, 105, 156,336, 2286, 4272,$ $4427, 11979, 20076, 29343, 29988, 30405$. $:$
The first thing I would ask is this: why there is only one $k=4427$ which is not a multiple of 3, whereas all the other $k$'s $(3, 6, 12, 36, 105, 156, 336, 2286, 4272, 11979, 20076, 29343, 29988, 30405)$ are congruent to $0mod3$.$:$ Is there any mathematical reason?$:$
The second question is: could be $k$ be of the form $3s+1$, i mean is there a $k$ of the form $3s+1$ such that $dfrac{(2^k-1)*10^m+2^{(k-1)}+10}{42}$ is prime?
The question is related to this other question:
A conjecture about numbers of the form $10^{m}(2^{k}−1)+2^{k-1}−1$, where $m$ is the number of decimal digits of $ 2^{k-1}$.
number-theory
asked 2 days ago
paolo galli
63
New contributor
paolo galli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Primes of the form $dfrac{(2^k-1)*10^m+2^{(k-1)}+10}{42}$, where $m$ is the number of decimal digits of $2^{k-1}-1$.
With Pari I found that primes occur for $k=3,, 6, 12, 36, 105, 156,336, 2286, 4272,$ $4427, 11979, 20076, 29343, 29988, 30405$. $:$
The first thing I would ask is this: why there is only one $k=4427$ which is not a multiple of 3, whereas all the other $k$'s $(3, 6, 12, 36, 105, 156, 336, 2286, 4272, 11979, 20076, 29343, 29988, 30405)$ are congruent to $0mod3$.$:$ Is there any mathematical reason?$:$
The second question is: could be $k$ be of the form $3s+1$, i mean is there a $k$ of the form $3s+1$ such that $dfrac{(2^k-1)*10^m+2^{(k-1)}+10}{42}$ is prime?
The question is related to this other question:
A conjecture about numbers of the form $10^{m}(2^{k}−1)+2^{k-1}−1$, where $m$ is the number of decimal digits of $ 2^{k-1}$.
number-theory
number-theory
asked 2 days ago
paolo galli
63
New contributor
paolo galli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 2 days ago
paolo galli
63
New contributor
paolo galli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited yesterday
asked 2 days ago
paolo galli
63
New contributor
paolo galli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 2 days ago
paolo galli
63
asked 2 days ago
paolo galli
63
63
New contributor
paolo galli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
paolo galli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
paolo galli is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
@Taneli Huuskonen@lulu is there some mathematical reason for that?
– paolo galli
2 days ago
(PARI) ec(n)= fromdigits(concat(digits(2^n-1), digits(2^(n-1)-1))) for(j=2, 10^4, s=ec(j); if(Mod(s+11, 42)==0, if(ispseudoprime((s+11)/42)==1, print1(j, ", "))))
– paolo galli
2 days ago
@Especially Lime is there any particular mathematical reason why primes of this type occur more often when k is a multiple of 3?
– paolo galli
2 days ago
add a comment |
@Taneli Huuskonen@lulu is there some mathematical reason for that?
– paolo galli
2 days ago
(PARI) ec(n)= fromdigits(concat(digits(2^n-1), digits(2^(n-1)-1))) for(j=2, 10^4, s=ec(j); if(Mod(s+11, 42)==0, if(ispseudoprime((s+11)/42)==1, print1(j, ", "))))
– paolo galli
2 days ago
@Especially Lime is there any particular mathematical reason why primes of this type occur more often when k is a multiple of 3?
– paolo galli
2 days ago
@Taneli Huuskonen@lulu is there some mathematical reason for that?
– paolo galli
2 days ago
@Taneli Huuskonen@lulu is there some mathematical reason for that?
– paolo galli
2 days ago
(PARI) ec(n)= fromdigits(concat(digits(2^n-1), digits(2^(n-1)-1))) for(j=2, 10^4, s=ec(j); if(Mod(s+11, 42)==0, if(ispseudoprime((s+11)/42)==1, print1(j, ", "))))
– paolo galli
2 days ago
(PARI) ec(n)= fromdigits(concat(digits(2^n-1), digits(2^(n-1)-1))) for(j=2, 10^4, s=ec(j); if(Mod(s+11, 42)==0, if(ispseudoprime((s+11)/42)==1, print1(j, ", "))))
– paolo galli
2 days ago
@Especially Lime is there any particular mathematical reason why primes of this type occur more often when k is a multiple of 3?
– paolo galli
2 days ago
@Especially Lime is there any particular mathematical reason why primes of this type occur more often when k is a multiple of 3?
– paolo galli
2 days ago
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
paolo galli is a new contributor. Be nice, and check out our Code of Conduct.
paolo galli is a new contributor. Be nice, and check out our Code of Conduct.
paolo galli is a new contributor. Be nice, and check out our Code of Conduct.
paolo galli is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2999664%2fprimes-of-the-form-2k-110m2k-110-42-where-m-is-the-number-of-dec%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
@Taneli Huuskonen@lulu is there some mathematical reason for that?
– paolo galli
2 days ago
(PARI) ec(n)= fromdigits(concat(digits(2^n-1), digits(2^(n-1)-1))) for(j=2, 10^4, s=ec(j); if(Mod(s+11, 42)==0, if(ispseudoprime((s+11)/42)==1, print1(j, ", "))))
– paolo galli
2 days ago
@Especially Lime is there any particular mathematical reason why primes of this type occur more often when k is a multiple of 3?
– paolo galli
2 days ago