Pair up ${1..2n}$ that the sums of each pair are different primes.












4












$begingroup$


Pair up ${1..2n}$ that the sums of each pair are different primes.
I found 9 examples:



${(1,2)},$



${(1,2),(3,4)},$



${(1,2),(3,4),(5,6)},$



${(1,4),(2,5),(3,8),(6,7)},{(2,3),(1,6),(4,7),(5,8)},$



${(1,4),(2,5),(3,8),(6,7),(9,10)},{(2,3),(1,6),(4,7),(5,8),(9,10)},$



${(1,4),(2,5),(3,8),(6,7),(9,10),(11,12)},{(2,3),(1,6),(4,7),(5,8),(9,10),(11,12)}.$



Is there another example like this?










share|cite|improve this question











$endgroup$

















    4












    $begingroup$


    Pair up ${1..2n}$ that the sums of each pair are different primes.
    I found 9 examples:



    ${(1,2)},$



    ${(1,2),(3,4)},$



    ${(1,2),(3,4),(5,6)},$



    ${(1,4),(2,5),(3,8),(6,7)},{(2,3),(1,6),(4,7),(5,8)},$



    ${(1,4),(2,5),(3,8),(6,7),(9,10)},{(2,3),(1,6),(4,7),(5,8),(9,10)},$



    ${(1,4),(2,5),(3,8),(6,7),(9,10),(11,12)},{(2,3),(1,6),(4,7),(5,8),(9,10),(11,12)}.$



    Is there another example like this?










    share|cite|improve this question











    $endgroup$















      4












      4








      4


      3



      $begingroup$


      Pair up ${1..2n}$ that the sums of each pair are different primes.
      I found 9 examples:



      ${(1,2)},$



      ${(1,2),(3,4)},$



      ${(1,2),(3,4),(5,6)},$



      ${(1,4),(2,5),(3,8),(6,7)},{(2,3),(1,6),(4,7),(5,8)},$



      ${(1,4),(2,5),(3,8),(6,7),(9,10)},{(2,3),(1,6),(4,7),(5,8),(9,10)},$



      ${(1,4),(2,5),(3,8),(6,7),(9,10),(11,12)},{(2,3),(1,6),(4,7),(5,8),(9,10),(11,12)}.$



      Is there another example like this?










      share|cite|improve this question











      $endgroup$




      Pair up ${1..2n}$ that the sums of each pair are different primes.
      I found 9 examples:



      ${(1,2)},$



      ${(1,2),(3,4)},$



      ${(1,2),(3,4),(5,6)},$



      ${(1,4),(2,5),(3,8),(6,7)},{(2,3),(1,6),(4,7),(5,8)},$



      ${(1,4),(2,5),(3,8),(6,7),(9,10)},{(2,3),(1,6),(4,7),(5,8),(9,10)},$



      ${(1,4),(2,5),(3,8),(6,7),(9,10),(11,12)},{(2,3),(1,6),(4,7),(5,8),(9,10),(11,12)}.$



      Is there another example like this?







      combinatorics prime-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:49







      Manyama

















      asked Dec 8 '18 at 14:16









      ManyamaManyama

      4971315




      4971315






















          1 Answer
          1






          active

          oldest

          votes


















          5












          $begingroup$

          There are no more. There are none for $n=7$. We would need the sums to be seven distinct odd primes below $27$. The most the sum of these sums can be is $5+7+11+13+17+19+23=95$ but the sum of all the numbers up to $14$ is $105$.



          For $n=8$ we would need the sum of eight primes below $31$ to be $120$. We can only do this with $3,5,11,13,17,19,23,29$. We need $1+2$ to get $3$ but cannot get $5$.



          For $n=9$ we need all the primes up to $31$ except $2,5$, but then $1+2=3,3+4=7,5+5=11$ and we are stuck for $13$.



          For $n=10$ we need all the primes up to $37$ except $2,5$ and the $n=9$ proof works.



          For $n=11$ we need all the primes up to $43$ except $2,7,11$ or $2,5,13$. We can do $21+22=43$ but cannot get $41$.



          For $n=12$ the sum of all the primes up to $43$ is $271$ while the sum of the numbers up to $24$ is $276$



          Now going from $n$ to $n+1$ the sum of the numbers increases by $4n+3$ while the sum of primes increases by $4n+1, 4n+3,$ or $8n+4$. As less than $frac {2cdot 3 cdot 5}{3 cdot 5 cdot 7} lt frac 12$ are primes, the sum of primes will never catch up. $n=13$ doesn't add any new primes because the odd numbers added are $49,51$ and again we miss at $n=19$. Each intervening $n$ has only added one prime.






          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%2f3031150%2fpair-up-1-2n-that-the-sums-of-each-pair-are-different-primes%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









            5












            $begingroup$

            There are no more. There are none for $n=7$. We would need the sums to be seven distinct odd primes below $27$. The most the sum of these sums can be is $5+7+11+13+17+19+23=95$ but the sum of all the numbers up to $14$ is $105$.



            For $n=8$ we would need the sum of eight primes below $31$ to be $120$. We can only do this with $3,5,11,13,17,19,23,29$. We need $1+2$ to get $3$ but cannot get $5$.



            For $n=9$ we need all the primes up to $31$ except $2,5$, but then $1+2=3,3+4=7,5+5=11$ and we are stuck for $13$.



            For $n=10$ we need all the primes up to $37$ except $2,5$ and the $n=9$ proof works.



            For $n=11$ we need all the primes up to $43$ except $2,7,11$ or $2,5,13$. We can do $21+22=43$ but cannot get $41$.



            For $n=12$ the sum of all the primes up to $43$ is $271$ while the sum of the numbers up to $24$ is $276$



            Now going from $n$ to $n+1$ the sum of the numbers increases by $4n+3$ while the sum of primes increases by $4n+1, 4n+3,$ or $8n+4$. As less than $frac {2cdot 3 cdot 5}{3 cdot 5 cdot 7} lt frac 12$ are primes, the sum of primes will never catch up. $n=13$ doesn't add any new primes because the odd numbers added are $49,51$ and again we miss at $n=19$. Each intervening $n$ has only added one prime.






            share|cite|improve this answer











            $endgroup$


















              5












              $begingroup$

              There are no more. There are none for $n=7$. We would need the sums to be seven distinct odd primes below $27$. The most the sum of these sums can be is $5+7+11+13+17+19+23=95$ but the sum of all the numbers up to $14$ is $105$.



              For $n=8$ we would need the sum of eight primes below $31$ to be $120$. We can only do this with $3,5,11,13,17,19,23,29$. We need $1+2$ to get $3$ but cannot get $5$.



              For $n=9$ we need all the primes up to $31$ except $2,5$, but then $1+2=3,3+4=7,5+5=11$ and we are stuck for $13$.



              For $n=10$ we need all the primes up to $37$ except $2,5$ and the $n=9$ proof works.



              For $n=11$ we need all the primes up to $43$ except $2,7,11$ or $2,5,13$. We can do $21+22=43$ but cannot get $41$.



              For $n=12$ the sum of all the primes up to $43$ is $271$ while the sum of the numbers up to $24$ is $276$



              Now going from $n$ to $n+1$ the sum of the numbers increases by $4n+3$ while the sum of primes increases by $4n+1, 4n+3,$ or $8n+4$. As less than $frac {2cdot 3 cdot 5}{3 cdot 5 cdot 7} lt frac 12$ are primes, the sum of primes will never catch up. $n=13$ doesn't add any new primes because the odd numbers added are $49,51$ and again we miss at $n=19$. Each intervening $n$ has only added one prime.






              share|cite|improve this answer











              $endgroup$
















                5












                5








                5





                $begingroup$

                There are no more. There are none for $n=7$. We would need the sums to be seven distinct odd primes below $27$. The most the sum of these sums can be is $5+7+11+13+17+19+23=95$ but the sum of all the numbers up to $14$ is $105$.



                For $n=8$ we would need the sum of eight primes below $31$ to be $120$. We can only do this with $3,5,11,13,17,19,23,29$. We need $1+2$ to get $3$ but cannot get $5$.



                For $n=9$ we need all the primes up to $31$ except $2,5$, but then $1+2=3,3+4=7,5+5=11$ and we are stuck for $13$.



                For $n=10$ we need all the primes up to $37$ except $2,5$ and the $n=9$ proof works.



                For $n=11$ we need all the primes up to $43$ except $2,7,11$ or $2,5,13$. We can do $21+22=43$ but cannot get $41$.



                For $n=12$ the sum of all the primes up to $43$ is $271$ while the sum of the numbers up to $24$ is $276$



                Now going from $n$ to $n+1$ the sum of the numbers increases by $4n+3$ while the sum of primes increases by $4n+1, 4n+3,$ or $8n+4$. As less than $frac {2cdot 3 cdot 5}{3 cdot 5 cdot 7} lt frac 12$ are primes, the sum of primes will never catch up. $n=13$ doesn't add any new primes because the odd numbers added are $49,51$ and again we miss at $n=19$. Each intervening $n$ has only added one prime.






                share|cite|improve this answer











                $endgroup$



                There are no more. There are none for $n=7$. We would need the sums to be seven distinct odd primes below $27$. The most the sum of these sums can be is $5+7+11+13+17+19+23=95$ but the sum of all the numbers up to $14$ is $105$.



                For $n=8$ we would need the sum of eight primes below $31$ to be $120$. We can only do this with $3,5,11,13,17,19,23,29$. We need $1+2$ to get $3$ but cannot get $5$.



                For $n=9$ we need all the primes up to $31$ except $2,5$, but then $1+2=3,3+4=7,5+5=11$ and we are stuck for $13$.



                For $n=10$ we need all the primes up to $37$ except $2,5$ and the $n=9$ proof works.



                For $n=11$ we need all the primes up to $43$ except $2,7,11$ or $2,5,13$. We can do $21+22=43$ but cannot get $41$.



                For $n=12$ the sum of all the primes up to $43$ is $271$ while the sum of the numbers up to $24$ is $276$



                Now going from $n$ to $n+1$ the sum of the numbers increases by $4n+3$ while the sum of primes increases by $4n+1, 4n+3,$ or $8n+4$. As less than $frac {2cdot 3 cdot 5}{3 cdot 5 cdot 7} lt frac 12$ are primes, the sum of primes will never catch up. $n=13$ doesn't add any new primes because the odd numbers added are $49,51$ and again we miss at $n=19$. Each intervening $n$ has only added one prime.







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Dec 9 '18 at 22:57

























                answered Dec 9 '18 at 19:40









                Ross MillikanRoss Millikan

                294k23198371




                294k23198371






























                    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%2f3031150%2fpair-up-1-2n-that-the-sums-of-each-pair-are-different-primes%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

                    Ellipse (mathématiques)

                    Quarter-circle Tiles

                    Mont Emei