Mixing
Is every ec prime with k congruent to 7 mod 10 of the form 900s+163?
up vote
0
down vote
favorite
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}$.
In this question ec numbers are introduced. Ec(7) for example is $12763$ obtained by the concatenation of two consecutive Mersenne numbers. My question is:
is every ec prime with k congruent to 7 mod 10 of the form $900s+163$?
The examples known are for $k=7,67,360787$.
number-theory
asked 2 hours ago
paolo galli
113
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
0
down vote
favorite
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}$.
In this question ec numbers are introduced. Ec(7) for example is $12763$ obtained by the concatenation of two consecutive Mersenne numbers. My question is:
is every ec prime with k congruent to 7 mod 10 of the form $900s+163$?
The examples known are for $k=7,67,360787$.
number-theory
asked 2 hours ago
paolo galli
113
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
0
down vote
favorite
up vote
0
down vote
favorite
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}$.
In this question ec numbers are introduced. Ec(7) for example is $12763$ obtained by the concatenation of two consecutive Mersenne numbers. My question is:
is every ec prime with k congruent to 7 mod 10 of the form $900s+163$?
The examples known are for $k=7,67,360787$.
number-theory
asked 2 hours ago
paolo galli
113
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.
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}$.
In this question ec numbers are introduced. Ec(7) for example is $12763$ obtained by the concatenation of two consecutive Mersenne numbers. My question is:
is every ec prime with k congruent to 7 mod 10 of the form $900s+163$?
The examples known are for $k=7,67,360787$.
number-theory
number-theory
asked 2 hours ago
paolo galli
113
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 hours ago
paolo galli
113
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 hours ago
paolo galli
113
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 hours ago
paolo galli
113
asked 2 hours ago
paolo galli
113
113
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.
add a comment |
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%2f3004671%2fis-every-ec-prime-with-k-congruent-to-7-mod-10-of-the-form-900s163%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
