Are Mersenne numbers with Mersenne prime exponent always prime?












0












$begingroup$


A Mersenne number is a number on the form $2^n-1$. For it to be prime, the number $n$ must be prime. My question is that if $n$ is another Mersenne prime, will $2^n-1$ be always prime?



It seems so, to me anyway.






prime-numbers mersenne-numbers







share|cite|improve this question











$endgroup$












  • $begingroup$
    If this were true, this would generate info itelyinfjnitely many mersenne primes! We currently know of only 48.
    $endgroup$
    – JavaMan
    Oct 15 '18 at 10:50


















0












$begingroup$


A Mersenne number is a number on the form $2^n-1$. For it to be prime, the number $n$ must be prime. My question is that if $n$ is another Mersenne prime, will $2^n-1$ be always prime?



It seems so, to me anyway.






prime-numbers mersenne-numbers







share|cite|improve this question











$endgroup$












  • $begingroup$
    If this were true, this would generate info itelyinfjnitely many mersenne primes! We currently know of only 48.
    $endgroup$
    – JavaMan
    Oct 15 '18 at 10:50
















0












0








0





$begingroup$


A Mersenne number is a number on the form $2^n-1$. For it to be prime, the number $n$ must be prime. My question is that if $n$ is another Mersenne prime, will $2^n-1$ be always prime?



It seems so, to me anyway.






prime-numbers mersenne-numbers







share|cite|improve this question











$endgroup$




A Mersenne number is a number on the form $2^n-1$. For it to be prime, the number $n$ must be prime. My question is that if $n$ is another Mersenne prime, will $2^n-1$ be always prime?



It seems so, to me anyway.






prime-numbers mersenne-numbers




prime-numbers mersenne-numbers






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 11 '18 at 14:29









Klangen

1,72811334




1,72811334










asked Oct 15 '18 at 10:46









Harshith VasireddyHarshith Vasireddy

12




12












  • $begingroup$
    If this were true, this would generate info itelyinfjnitely many mersenne primes! We currently know of only 48.
    $endgroup$
    – JavaMan
    Oct 15 '18 at 10:50




















  • $begingroup$
    If this were true, this would generate info itelyinfjnitely many mersenne primes! We currently know of only 48.
    $endgroup$
    – JavaMan
    Oct 15 '18 at 10:50


















$begingroup$
If this were true, this would generate info itelyinfjnitely many mersenne primes! We currently know of only 48.
$endgroup$
– JavaMan
Oct 15 '18 at 10:50






$begingroup$
If this were true, this would generate info itelyinfjnitely many mersenne primes! We currently know of only 48.
$endgroup$
– JavaMan
Oct 15 '18 at 10:50












2 Answers
2






active

oldest

votes


















1












$begingroup$

https://oeis.org/A000043



We only know about finitely many Mersenne primes. If your conjecture was true, then we could generate infinitely many Mersenne primes.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Yes. That would be true.
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:22



















1












$begingroup$

My own program found that $2^{2^{13} - 1} - 1$ is not a (probable) prime number, confirmed by Wolfram Alpha and https://oeis.org/A000043. Note that $M_{13} = 8191$ is prime and $M_{8191}$ is not.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Wolfram alpha says result unknown
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:21










  • $begingroup$
    For me is says it is not (after a few seconds), query was isprime 2^(2^13-1)-1. Anyway, $M_{8191}$ is not in the list of Mersenne primes.
    $endgroup$
    – gammatester
    Oct 15 '18 at 11:23












  • $begingroup$
    Thanks. Doubt clarified
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:29











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2956352%2fare-mersenne-numbers-with-mersenne-prime-exponent-always-prime%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes









1












$begingroup$

https://oeis.org/A000043



We only know about finitely many Mersenne primes. If your conjecture was true, then we could generate infinitely many Mersenne primes.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Yes. That would be true.
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:22
















1












$begingroup$

https://oeis.org/A000043



We only know about finitely many Mersenne primes. If your conjecture was true, then we could generate infinitely many Mersenne primes.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Yes. That would be true.
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:22














1












1








1





$begingroup$

https://oeis.org/A000043



We only know about finitely many Mersenne primes. If your conjecture was true, then we could generate infinitely many Mersenne primes.






share|cite|improve this answer









$endgroup$



https://oeis.org/A000043



We only know about finitely many Mersenne primes. If your conjecture was true, then we could generate infinitely many Mersenne primes.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Oct 15 '18 at 11:10









math783625math783625

31210




31210












  • $begingroup$
    Yes. That would be true.
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:22


















  • $begingroup$
    Yes. That would be true.
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:22
















$begingroup$
Yes. That would be true.
$endgroup$
– Harshith Vasireddy
Oct 15 '18 at 11:22




$begingroup$
Yes. That would be true.
$endgroup$
– Harshith Vasireddy
Oct 15 '18 at 11:22











1












$begingroup$

My own program found that $2^{2^{13} - 1} - 1$ is not a (probable) prime number, confirmed by Wolfram Alpha and https://oeis.org/A000043. Note that $M_{13} = 8191$ is prime and $M_{8191}$ is not.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Wolfram alpha says result unknown
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:21










  • $begingroup$
    For me is says it is not (after a few seconds), query was isprime 2^(2^13-1)-1. Anyway, $M_{8191}$ is not in the list of Mersenne primes.
    $endgroup$
    – gammatester
    Oct 15 '18 at 11:23












  • $begingroup$
    Thanks. Doubt clarified
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:29
















1












$begingroup$

My own program found that $2^{2^{13} - 1} - 1$ is not a (probable) prime number, confirmed by Wolfram Alpha and https://oeis.org/A000043. Note that $M_{13} = 8191$ is prime and $M_{8191}$ is not.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Wolfram alpha says result unknown
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:21










  • $begingroup$
    For me is says it is not (after a few seconds), query was isprime 2^(2^13-1)-1. Anyway, $M_{8191}$ is not in the list of Mersenne primes.
    $endgroup$
    – gammatester
    Oct 15 '18 at 11:23












  • $begingroup$
    Thanks. Doubt clarified
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:29














1












1








1





$begingroup$

My own program found that $2^{2^{13} - 1} - 1$ is not a (probable) prime number, confirmed by Wolfram Alpha and https://oeis.org/A000043. Note that $M_{13} = 8191$ is prime and $M_{8191}$ is not.






share|cite|improve this answer











$endgroup$



My own program found that $2^{2^{13} - 1} - 1$ is not a (probable) prime number, confirmed by Wolfram Alpha and https://oeis.org/A000043. Note that $M_{13} = 8191$ is prime and $M_{8191}$ is not.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Oct 15 '18 at 11:15

























answered Oct 15 '18 at 11:08









gammatestergammatester

16.7k21633




16.7k21633












  • $begingroup$
    Wolfram alpha says result unknown
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:21










  • $begingroup$
    For me is says it is not (after a few seconds), query was isprime 2^(2^13-1)-1. Anyway, $M_{8191}$ is not in the list of Mersenne primes.
    $endgroup$
    – gammatester
    Oct 15 '18 at 11:23












  • $begingroup$
    Thanks. Doubt clarified
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:29


















  • $begingroup$
    Wolfram alpha says result unknown
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:21










  • $begingroup$
    For me is says it is not (after a few seconds), query was isprime 2^(2^13-1)-1. Anyway, $M_{8191}$ is not in the list of Mersenne primes.
    $endgroup$
    – gammatester
    Oct 15 '18 at 11:23












  • $begingroup$
    Thanks. Doubt clarified
    $endgroup$
    – Harshith Vasireddy
    Oct 15 '18 at 11:29
















$begingroup$
Wolfram alpha says result unknown
$endgroup$
– Harshith Vasireddy
Oct 15 '18 at 11:21




$begingroup$
Wolfram alpha says result unknown
$endgroup$
– Harshith Vasireddy
Oct 15 '18 at 11:21












$begingroup$
For me is says it is not (after a few seconds), query was isprime 2^(2^13-1)-1. Anyway, $M_{8191}$ is not in the list of Mersenne primes.
$endgroup$
– gammatester
Oct 15 '18 at 11:23






$begingroup$
For me is says it is not (after a few seconds), query was isprime 2^(2^13-1)-1. Anyway, $M_{8191}$ is not in the list of Mersenne primes.
$endgroup$
– gammatester
Oct 15 '18 at 11:23














$begingroup$
Thanks. Doubt clarified
$endgroup$
– Harshith Vasireddy
Oct 15 '18 at 11:29




$begingroup$
Thanks. Doubt clarified
$endgroup$
– Harshith Vasireddy
Oct 15 '18 at 11:29


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2956352%2fare-mersenne-numbers-with-mersenne-prime-exponent-always-prime%23new-answer', 'question_page');
}
);

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







-

Popular posts from this blog

Quarter-circle Tiles

Image
up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2
Read more

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Image
0 I think it's similiar to NFAs. I replace the finite states of the given automaton for start-states for my new automaton. I do it with $epsilon$ -transition from the start state to the actual finite states of the given automaton. The start state of the given automaton will be my accepting(finite) state of my new one. All transitions will be reversed of course to recognize the reversed word. But how do I have to change the stack of the pushdown automaton? That's tricky. formal-languages automata context-free-grammar share | cite | improve this question edited Nov 29 '18 at 14:20 joee
Read more

Mont Emei

Image
Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog
Read more