Question about the k-tuples conjecture












2












$begingroup$


On the "Prime Arithmetic Progression" page on Wolfram MathWorld, it states that a special case of the k-tuples conjecture is that there are infinitely long prime arithmetic sequences (arithmetic sequences for which all terms are prime)



But why doesn't this proof disprove that?



Let $a+dn$ be the $n$th term of any arithmetic progression. When $a=n$, the equation becomes $a(1+n)$, which obviously can't be prime because it is the product of two integers. Therefore, all infinite arithmetic progressions have at least one composite number.






proof-verification prime-numbers







share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    Of course, no arithmetic progression can produce only primes. This is even true for polynomials with integer coefficients. The meaning of the statement is : For every arbitary large $k$, there is an arithmetic progression of length $k$ producing only primes (I think this has been proven, but it is not known whether the statement remains true if the primes have to be consecutive)
    $endgroup$
    – Peter
    Mar 18 '17 at 23:05








  • 1




    $begingroup$
    In the Wolfram article on PAP, if you follow the link in the second paragraph (mathworld.wolfram.com/k-TupleConjecture.html), that article, near the bottom, describes the special case, "prime patterns conjecture", mentioned in the PAP article. It goes on to say that there are arbitrarily long APs of primes. Note arbitrarily long is not the same as infinite. IMO the PAP article, is at best confusing, in talking about the "prime patterns conjecture".
    $endgroup$
    – Χpẘ
    Mar 18 '17 at 23:42






  • 3




    $begingroup$
    Indeed, the Wolfram article uses the exact phrase "infinitely long prime arithmetic progressions", which is not accurate: "arbitrarily long prime arithmetic progressions" is what is meant. So the OP's objection is quite valid!
    $endgroup$
    – Greg Martin
    Mar 18 '17 at 23:43






  • 1




    $begingroup$
    Minor correction: $a(1+n)$ should be $a(1+d)$.
    $endgroup$
    – hardmath
    Mar 19 '17 at 0:14
















2












$begingroup$


On the "Prime Arithmetic Progression" page on Wolfram MathWorld, it states that a special case of the k-tuples conjecture is that there are infinitely long prime arithmetic sequences (arithmetic sequences for which all terms are prime)



But why doesn't this proof disprove that?



Let $a+dn$ be the $n$th term of any arithmetic progression. When $a=n$, the equation becomes $a(1+n)$, which obviously can't be prime because it is the product of two integers. Therefore, all infinite arithmetic progressions have at least one composite number.






proof-verification prime-numbers







share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    Of course, no arithmetic progression can produce only primes. This is even true for polynomials with integer coefficients. The meaning of the statement is : For every arbitary large $k$, there is an arithmetic progression of length $k$ producing only primes (I think this has been proven, but it is not known whether the statement remains true if the primes have to be consecutive)
    $endgroup$
    – Peter
    Mar 18 '17 at 23:05








  • 1




    $begingroup$
    In the Wolfram article on PAP, if you follow the link in the second paragraph (mathworld.wolfram.com/k-TupleConjecture.html), that article, near the bottom, describes the special case, "prime patterns conjecture", mentioned in the PAP article. It goes on to say that there are arbitrarily long APs of primes. Note arbitrarily long is not the same as infinite. IMO the PAP article, is at best confusing, in talking about the "prime patterns conjecture".
    $endgroup$
    – Χpẘ
    Mar 18 '17 at 23:42






  • 3




    $begingroup$
    Indeed, the Wolfram article uses the exact phrase "infinitely long prime arithmetic progressions", which is not accurate: "arbitrarily long prime arithmetic progressions" is what is meant. So the OP's objection is quite valid!
    $endgroup$
    – Greg Martin
    Mar 18 '17 at 23:43






  • 1




    $begingroup$
    Minor correction: $a(1+n)$ should be $a(1+d)$.
    $endgroup$
    – hardmath
    Mar 19 '17 at 0:14














2












2








2





$begingroup$


On the "Prime Arithmetic Progression" page on Wolfram MathWorld, it states that a special case of the k-tuples conjecture is that there are infinitely long prime arithmetic sequences (arithmetic sequences for which all terms are prime)



But why doesn't this proof disprove that?



Let $a+dn$ be the $n$th term of any arithmetic progression. When $a=n$, the equation becomes $a(1+n)$, which obviously can't be prime because it is the product of two integers. Therefore, all infinite arithmetic progressions have at least one composite number.






proof-verification prime-numbers







share|cite|improve this question









$endgroup$




On the "Prime Arithmetic Progression" page on Wolfram MathWorld, it states that a special case of the k-tuples conjecture is that there are infinitely long prime arithmetic sequences (arithmetic sequences for which all terms are prime)



But why doesn't this proof disprove that?



Let $a+dn$ be the $n$th term of any arithmetic progression. When $a=n$, the equation becomes $a(1+n)$, which obviously can't be prime because it is the product of two integers. Therefore, all infinite arithmetic progressions have at least one composite number.






proof-verification prime-numbers




proof-verification prime-numbers






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Mar 18 '17 at 22:57









TreFoxTreFox

1,99911034




1,99911034








  • 1




    $begingroup$
    Of course, no arithmetic progression can produce only primes. This is even true for polynomials with integer coefficients. The meaning of the statement is : For every arbitary large $k$, there is an arithmetic progression of length $k$ producing only primes (I think this has been proven, but it is not known whether the statement remains true if the primes have to be consecutive)
    $endgroup$
    – Peter
    Mar 18 '17 at 23:05








  • 1




    $begingroup$
    In the Wolfram article on PAP, if you follow the link in the second paragraph (mathworld.wolfram.com/k-TupleConjecture.html), that article, near the bottom, describes the special case, "prime patterns conjecture", mentioned in the PAP article. It goes on to say that there are arbitrarily long APs of primes. Note arbitrarily long is not the same as infinite. IMO the PAP article, is at best confusing, in talking about the "prime patterns conjecture".
    $endgroup$
    – Χpẘ
    Mar 18 '17 at 23:42






  • 3




    $begingroup$
    Indeed, the Wolfram article uses the exact phrase "infinitely long prime arithmetic progressions", which is not accurate: "arbitrarily long prime arithmetic progressions" is what is meant. So the OP's objection is quite valid!
    $endgroup$
    – Greg Martin
    Mar 18 '17 at 23:43






  • 1




    $begingroup$
    Minor correction: $a(1+n)$ should be $a(1+d)$.
    $endgroup$
    – hardmath
    Mar 19 '17 at 0:14














  • 1




    $begingroup$
    Of course, no arithmetic progression can produce only primes. This is even true for polynomials with integer coefficients. The meaning of the statement is : For every arbitary large $k$, there is an arithmetic progression of length $k$ producing only primes (I think this has been proven, but it is not known whether the statement remains true if the primes have to be consecutive)
    $endgroup$
    – Peter
    Mar 18 '17 at 23:05








  • 1




    $begingroup$
    In the Wolfram article on PAP, if you follow the link in the second paragraph (mathworld.wolfram.com/k-TupleConjecture.html), that article, near the bottom, describes the special case, "prime patterns conjecture", mentioned in the PAP article. It goes on to say that there are arbitrarily long APs of primes. Note arbitrarily long is not the same as infinite. IMO the PAP article, is at best confusing, in talking about the "prime patterns conjecture".
    $endgroup$
    – Χpẘ
    Mar 18 '17 at 23:42






  • 3




    $begingroup$
    Indeed, the Wolfram article uses the exact phrase "infinitely long prime arithmetic progressions", which is not accurate: "arbitrarily long prime arithmetic progressions" is what is meant. So the OP's objection is quite valid!
    $endgroup$
    – Greg Martin
    Mar 18 '17 at 23:43






  • 1




    $begingroup$
    Minor correction: $a(1+n)$ should be $a(1+d)$.
    $endgroup$
    – hardmath
    Mar 19 '17 at 0:14








1




1




$begingroup$
Of course, no arithmetic progression can produce only primes. This is even true for polynomials with integer coefficients. The meaning of the statement is : For every arbitary large $k$, there is an arithmetic progression of length $k$ producing only primes (I think this has been proven, but it is not known whether the statement remains true if the primes have to be consecutive)
$endgroup$
– Peter
Mar 18 '17 at 23:05






$begingroup$
Of course, no arithmetic progression can produce only primes. This is even true for polynomials with integer coefficients. The meaning of the statement is : For every arbitary large $k$, there is an arithmetic progression of length $k$ producing only primes (I think this has been proven, but it is not known whether the statement remains true if the primes have to be consecutive)
$endgroup$
– Peter
Mar 18 '17 at 23:05






1




1




$begingroup$
In the Wolfram article on PAP, if you follow the link in the second paragraph (mathworld.wolfram.com/k-TupleConjecture.html), that article, near the bottom, describes the special case, "prime patterns conjecture", mentioned in the PAP article. It goes on to say that there are arbitrarily long APs of primes. Note arbitrarily long is not the same as infinite. IMO the PAP article, is at best confusing, in talking about the "prime patterns conjecture".
$endgroup$
– Χpẘ
Mar 18 '17 at 23:42




$begingroup$
In the Wolfram article on PAP, if you follow the link in the second paragraph (mathworld.wolfram.com/k-TupleConjecture.html), that article, near the bottom, describes the special case, "prime patterns conjecture", mentioned in the PAP article. It goes on to say that there are arbitrarily long APs of primes. Note arbitrarily long is not the same as infinite. IMO the PAP article, is at best confusing, in talking about the "prime patterns conjecture".
$endgroup$
– Χpẘ
Mar 18 '17 at 23:42




3




3




$begingroup$
Indeed, the Wolfram article uses the exact phrase "infinitely long prime arithmetic progressions", which is not accurate: "arbitrarily long prime arithmetic progressions" is what is meant. So the OP's objection is quite valid!
$endgroup$
– Greg Martin
Mar 18 '17 at 23:43




$begingroup$
Indeed, the Wolfram article uses the exact phrase "infinitely long prime arithmetic progressions", which is not accurate: "arbitrarily long prime arithmetic progressions" is what is meant. So the OP's objection is quite valid!
$endgroup$
– Greg Martin
Mar 18 '17 at 23:43




1




1




$begingroup$
Minor correction: $a(1+n)$ should be $a(1+d)$.
$endgroup$
– hardmath
Mar 19 '17 at 0:14




$begingroup$
Minor correction: $a(1+n)$ should be $a(1+d)$.
$endgroup$
– hardmath
Mar 19 '17 at 0:14










1 Answer
1






active

oldest

votes


















0












$begingroup$

As others have pointed out in the comment section, there can be no arithmetic progression that produces only primes (see here for a quick explanation). So, as you rightly say, all infinite arithmetic progressions have at least one composite number.






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%2f2192873%2fquestion-about-the-k-tuples-conjecture%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$

    As others have pointed out in the comment section, there can be no arithmetic progression that produces only primes (see here for a quick explanation). So, as you rightly say, all infinite arithmetic progressions have at least one composite number.






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      As others have pointed out in the comment section, there can be no arithmetic progression that produces only primes (see here for a quick explanation). So, as you rightly say, all infinite arithmetic progressions have at least one composite number.






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        As others have pointed out in the comment section, there can be no arithmetic progression that produces only primes (see here for a quick explanation). So, as you rightly say, all infinite arithmetic progressions have at least one composite number.






        share|cite|improve this answer









        $endgroup$



        As others have pointed out in the comment section, there can be no arithmetic progression that produces only primes (see here for a quick explanation). So, as you rightly say, all infinite arithmetic progressions have at least one composite number.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 20 '18 at 11:30









        KlangenKlangen

        1,66811334




        1,66811334






























            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%2f2192873%2fquestion-about-the-k-tuples-conjecture%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

            Bundesstraße 106

            Image
            Dieser Artikel beschreibt die Bundesstraße 106 in Deutschland. Zur gleichnamigen Straße in Österreich siehe Mölltal Straße. Vorlage:Infobox hochrangige Straße/Wartung/DE-B Bundesstraße 106 in Deutschland Karte Basisdaten Betreiber: Deutschland  Bundesrepublik Deutschland Straßenbeginn: Wismar ( 53° 54′  N , 11° 24′  O 53.900536 11.396875 ) Straßenende: Schwerin ( 53° 36′  N , 11° 24′  O 53.592785 11.404892 ) Gesamtlänge: 40,7 km Bundesland: Mecklenburg-Vorpommern Ausbauzustand: zweistreifig [1] Bundesstraße 106 in Schwerin (Umgehungsstraße) Straßenverlauf Land Mecklenburg-Vorpommern Landkreis Nordwestmecklenburg Ortsumgehung Wismar Wallensteingraben über   Dorf Mecklenburg Wallensteingraben Groß Stieten Bad Kleinen OT Niendorf Bahnstrecke Lübeck–Bad Kleinen Zickhusen Lübstorf Klein Trebbow OT Kirch Stück ...
            Read more

            Verónica Boquete

            Image
            Verónica Boquete im Trikot der Nationalmannschaft (2013) Personalia Name Verónica Boquete Giadans Geburtstag 9. April 1987 Geburtsort Santiago de Compostela, Spanien Größe 159 cm Position Mittelfeld / Sturm Juniorinnen Jahre Station 2001–2005 Xuventú Aguiño Frauen Jahre Station Spiele (Tore) 1 2005–2008 Prainsa Zaragoza 83 (40) 2008–2010 Espanyol Barcelona 53 (30) 2010 Buffalo Flash 9 0 (9) 2010 Chicago Red Stars 3 0 (1) 2010–2011 Espanyol Barcelona 26 (41) 2011 Philadelphia Independence 13 0 (5) 2011 Energija Woronesch 5 0 (1) 2012–2014 Tyresö FF 39 (14) 2014 Portland Thorns FC 15 0 (4) 2014–2015 1. FFC Frankfurt 23 0 (7) 2015–2016 FC Bayern München 9 0 (0) 2016–2018 Paris Saint-Germain 31 0 (8) 2018 Peking BG Phoenix 2019– Utah Royals FC 0 0 (0) Nationalmannschaft Jahre Auswahl ...
            Read more

            Ida-Boy-Ed-Garten

            Image
            Die Lage des Ida-Boy-Ed-Gartens, rot markiert Der Ida-Boy-Ed-Garten Der Ida-Boy-Ed-Garten, Blick von der Wakenitzmauer durch das Tor in der Stadtmauer Der Ida-Boy-Ed-Garten ist eine Straße der Lübecker Altstadt. Inhaltsverzeichnis 1 Lage 2 Geschichte 3 Literatur 4 Weblinks Lage | Der etwa 90 Meter lange Ida-Boy-Ed-Garten befindet sich an der nördlichen Spitze der Altstadtinsel, vor dem Burgtor. Die in einem Bogen durch eine Grünanlage hangaufwärts führende Straße verbindet die Wakenitzmauer mit der Burgtorbrücke. Geschichte | Der heutige Ida-Boy-Ed-Garten wurde ursprünglich als Verlängerung der Wakenitzmauer angelegt. 1903 wurde in den erhaltenen Teil der mittelalterlichen Stadtmauer, an dem die Wakenitzmauer bei der Einmündung der Kaiserstraße begann, ein Tor mit einem großen Bogen für die Durchführung der Straße und zwei kleineren seitlichen Öffnungen für Fußgänger gebrochen, um für die neu errichteten Wohnhäuser in diesem Bereich ...
            Read more