How many primes of the form $2^p-p$ with $p$ prime?












5












$begingroup$


I know that if $p = 6k+1$ with $k$ integer, then $(2^p-p) mod 6 equiv 1$. I think that this means that $2^p-p$ could be prime. My question is: are there a finite or infinite number of primes which can be written like this?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Note: All primes after 3 can be written in the form of $6k+1$ and $6k-1$
    $endgroup$
    – user371530
    Oct 23 '16 at 1:27










  • $begingroup$
    Also worth noting that non-prime may work: $2^9-9=503$ is prime
    $endgroup$
    – Joffan
    Oct 23 '16 at 1:51






  • 2




    $begingroup$
    oeis.org/A048744 gives the first $23$ values of $n$ for which $2^n-n$ is prime, including the prime values $n=2,3,13,19$, and $481801$.
    $endgroup$
    – Barry Cipra
    Nov 22 '16 at 23:05
















5












$begingroup$


I know that if $p = 6k+1$ with $k$ integer, then $(2^p-p) mod 6 equiv 1$. I think that this means that $2^p-p$ could be prime. My question is: are there a finite or infinite number of primes which can be written like this?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Note: All primes after 3 can be written in the form of $6k+1$ and $6k-1$
    $endgroup$
    – user371530
    Oct 23 '16 at 1:27










  • $begingroup$
    Also worth noting that non-prime may work: $2^9-9=503$ is prime
    $endgroup$
    – Joffan
    Oct 23 '16 at 1:51






  • 2




    $begingroup$
    oeis.org/A048744 gives the first $23$ values of $n$ for which $2^n-n$ is prime, including the prime values $n=2,3,13,19$, and $481801$.
    $endgroup$
    – Barry Cipra
    Nov 22 '16 at 23:05














5












5








5


1



$begingroup$


I know that if $p = 6k+1$ with $k$ integer, then $(2^p-p) mod 6 equiv 1$. I think that this means that $2^p-p$ could be prime. My question is: are there a finite or infinite number of primes which can be written like this?










share|cite|improve this question











$endgroup$




I know that if $p = 6k+1$ with $k$ integer, then $(2^p-p) mod 6 equiv 1$. I think that this means that $2^p-p$ could be prime. My question is: are there a finite or infinite number of primes which can be written like this?







number-theory prime-numbers






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jun 18 '17 at 15:54









jvdhooft

5,57561641




5,57561641










asked Oct 23 '16 at 1:21









O. ArcilaO. Arcila

757




757












  • $begingroup$
    Note: All primes after 3 can be written in the form of $6k+1$ and $6k-1$
    $endgroup$
    – user371530
    Oct 23 '16 at 1:27










  • $begingroup$
    Also worth noting that non-prime may work: $2^9-9=503$ is prime
    $endgroup$
    – Joffan
    Oct 23 '16 at 1:51






  • 2




    $begingroup$
    oeis.org/A048744 gives the first $23$ values of $n$ for which $2^n-n$ is prime, including the prime values $n=2,3,13,19$, and $481801$.
    $endgroup$
    – Barry Cipra
    Nov 22 '16 at 23:05


















  • $begingroup$
    Note: All primes after 3 can be written in the form of $6k+1$ and $6k-1$
    $endgroup$
    – user371530
    Oct 23 '16 at 1:27










  • $begingroup$
    Also worth noting that non-prime may work: $2^9-9=503$ is prime
    $endgroup$
    – Joffan
    Oct 23 '16 at 1:51






  • 2




    $begingroup$
    oeis.org/A048744 gives the first $23$ values of $n$ for which $2^n-n$ is prime, including the prime values $n=2,3,13,19$, and $481801$.
    $endgroup$
    – Barry Cipra
    Nov 22 '16 at 23:05
















$begingroup$
Note: All primes after 3 can be written in the form of $6k+1$ and $6k-1$
$endgroup$
– user371530
Oct 23 '16 at 1:27




$begingroup$
Note: All primes after 3 can be written in the form of $6k+1$ and $6k-1$
$endgroup$
– user371530
Oct 23 '16 at 1:27












$begingroup$
Also worth noting that non-prime may work: $2^9-9=503$ is prime
$endgroup$
– Joffan
Oct 23 '16 at 1:51




$begingroup$
Also worth noting that non-prime may work: $2^9-9=503$ is prime
$endgroup$
– Joffan
Oct 23 '16 at 1:51




2




2




$begingroup$
oeis.org/A048744 gives the first $23$ values of $n$ for which $2^n-n$ is prime, including the prime values $n=2,3,13,19$, and $481801$.
$endgroup$
– Barry Cipra
Nov 22 '16 at 23:05




$begingroup$
oeis.org/A048744 gives the first $23$ values of $n$ for which $2^n-n$ is prime, including the prime values $n=2,3,13,19$, and $481801$.
$endgroup$
– Barry Cipra
Nov 22 '16 at 23:05










1 Answer
1






active

oldest

votes


















0












$begingroup$



At this moment I do not have complete explanation of your question but with the use of my own properties of primes which I discovered last year I made a conclusion i.e.:



If (2p - 5) and (2p + 5) are primes than (2p - a) and (2p + a) are also primes only and only if "a" is a multiple of 5(which is rare but can come) or "a" is a prime number maybe "p" also.



7 also show similar property in (2p - 7) and (2p + 7)






share|cite|improve this answer









$endgroup$













    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%2f1980731%2fhow-many-primes-of-the-form-2p-p-with-p-prime%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0












    $begingroup$



    At this moment I do not have complete explanation of your question but with the use of my own properties of primes which I discovered last year I made a conclusion i.e.:



    If (2p - 5) and (2p + 5) are primes than (2p - a) and (2p + a) are also primes only and only if "a" is a multiple of 5(which is rare but can come) or "a" is a prime number maybe "p" also.



    7 also show similar property in (2p - 7) and (2p + 7)






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$



      At this moment I do not have complete explanation of your question but with the use of my own properties of primes which I discovered last year I made a conclusion i.e.:



      If (2p - 5) and (2p + 5) are primes than (2p - a) and (2p + a) are also primes only and only if "a" is a multiple of 5(which is rare but can come) or "a" is a prime number maybe "p" also.



      7 also show similar property in (2p - 7) and (2p + 7)






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$



        At this moment I do not have complete explanation of your question but with the use of my own properties of primes which I discovered last year I made a conclusion i.e.:



        If (2p - 5) and (2p + 5) are primes than (2p - a) and (2p + a) are also primes only and only if "a" is a multiple of 5(which is rare but can come) or "a" is a prime number maybe "p" also.



        7 also show similar property in (2p - 7) and (2p + 7)






        share|cite|improve this answer









        $endgroup$





        At this moment I do not have complete explanation of your question but with the use of my own properties of primes which I discovered last year I made a conclusion i.e.:



        If (2p - 5) and (2p + 5) are primes than (2p - a) and (2p + a) are also primes only and only if "a" is a multiple of 5(which is rare but can come) or "a" is a prime number maybe "p" also.



        7 also show similar property in (2p - 7) and (2p + 7)







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 18 '18 at 21:03









        DynamoDynamo

        104517




        104517






























            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%2f1980731%2fhow-many-primes-of-the-form-2p-p-with-p-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

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

            Mont Emei