Question pertaining to perfect powers in sums of consecutive integers












1












$begingroup$


I came across this question in the book Challenge and Thrill of Pre-college mathematics:




Prove that there are infinitely many sets of five consecutive integers $a,b,c,d,e$ such that $a+b+c+d+e$ is a perfect cube, and $b+c+d$ is a perfect square.




I took the numbers to be $(n-2),(n-1),n,(n+1),(n+2)$, and then it was not very difficult to find that what was required to prove was the existence of infinite numbers $n$ such that $5n$ and $3n$ are perfect cubes and squares respectively.



After playing around with prime factorizations for a while, I discovered that $675$ was such a number, followed by $3^9cdot5^2$. Clearly this has something to do with the prime factorization of these integers.



Futhermore, I think it is correct to assume that that multiplying $675$ with any number $p^k$ where $p$ is a prime and where $kmid3$ and $kmid2$, such as multiplying by $2^{6}$, which gives us $43200$, which is indeed such a number.



My problem is that I have no idea how I am supposed to write such a proof formally, or even if this is a proof. While I do believe that I have generated an infinite number of positive integers which obey the question, how do I explain it? What am I missing?






elementary-number-theory proof-writing







share|cite|improve this question









$endgroup$








  • 2




    $begingroup$
    My below answer is a different way to show that infinite many solutions exist, but your argument is perfectly right. You have found one solution and showed that we can multiply it how often we want with $64$ to get another solution. This clearly shows that infinite many solutions must exist.
    $endgroup$
    – Peter
    Jan 19 at 15:09












  • $begingroup$
    Do you think you can extend this result to more primes?
    $endgroup$
    – астон вілла олоф мэллбэрг
    Jan 19 at 15:17






  • 1




    $begingroup$
    Extend the $p^k$ result or to some integer $n$ where $pn$ and $qn$ are powers for prime $p$ and $q$?
    $endgroup$
    – Naman Kumar
    Jan 19 at 15:19
















1












$begingroup$


I came across this question in the book Challenge and Thrill of Pre-college mathematics:




Prove that there are infinitely many sets of five consecutive integers $a,b,c,d,e$ such that $a+b+c+d+e$ is a perfect cube, and $b+c+d$ is a perfect square.




I took the numbers to be $(n-2),(n-1),n,(n+1),(n+2)$, and then it was not very difficult to find that what was required to prove was the existence of infinite numbers $n$ such that $5n$ and $3n$ are perfect cubes and squares respectively.



After playing around with prime factorizations for a while, I discovered that $675$ was such a number, followed by $3^9cdot5^2$. Clearly this has something to do with the prime factorization of these integers.



Futhermore, I think it is correct to assume that that multiplying $675$ with any number $p^k$ where $p$ is a prime and where $kmid3$ and $kmid2$, such as multiplying by $2^{6}$, which gives us $43200$, which is indeed such a number.



My problem is that I have no idea how I am supposed to write such a proof formally, or even if this is a proof. While I do believe that I have generated an infinite number of positive integers which obey the question, how do I explain it? What am I missing?






elementary-number-theory proof-writing







share|cite|improve this question









$endgroup$








  • 2




    $begingroup$
    My below answer is a different way to show that infinite many solutions exist, but your argument is perfectly right. You have found one solution and showed that we can multiply it how often we want with $64$ to get another solution. This clearly shows that infinite many solutions must exist.
    $endgroup$
    – Peter
    Jan 19 at 15:09












  • $begingroup$
    Do you think you can extend this result to more primes?
    $endgroup$
    – астон вілла олоф мэллбэрг
    Jan 19 at 15:17






  • 1




    $begingroup$
    Extend the $p^k$ result or to some integer $n$ where $pn$ and $qn$ are powers for prime $p$ and $q$?
    $endgroup$
    – Naman Kumar
    Jan 19 at 15:19














1












1








1





$begingroup$


I came across this question in the book Challenge and Thrill of Pre-college mathematics:




Prove that there are infinitely many sets of five consecutive integers $a,b,c,d,e$ such that $a+b+c+d+e$ is a perfect cube, and $b+c+d$ is a perfect square.




I took the numbers to be $(n-2),(n-1),n,(n+1),(n+2)$, and then it was not very difficult to find that what was required to prove was the existence of infinite numbers $n$ such that $5n$ and $3n$ are perfect cubes and squares respectively.



After playing around with prime factorizations for a while, I discovered that $675$ was such a number, followed by $3^9cdot5^2$. Clearly this has something to do with the prime factorization of these integers.



Futhermore, I think it is correct to assume that that multiplying $675$ with any number $p^k$ where $p$ is a prime and where $kmid3$ and $kmid2$, such as multiplying by $2^{6}$, which gives us $43200$, which is indeed such a number.



My problem is that I have no idea how I am supposed to write such a proof formally, or even if this is a proof. While I do believe that I have generated an infinite number of positive integers which obey the question, how do I explain it? What am I missing?






elementary-number-theory proof-writing







share|cite|improve this question









$endgroup$




I came across this question in the book Challenge and Thrill of Pre-college mathematics:




Prove that there are infinitely many sets of five consecutive integers $a,b,c,d,e$ such that $a+b+c+d+e$ is a perfect cube, and $b+c+d$ is a perfect square.




I took the numbers to be $(n-2),(n-1),n,(n+1),(n+2)$, and then it was not very difficult to find that what was required to prove was the existence of infinite numbers $n$ such that $5n$ and $3n$ are perfect cubes and squares respectively.



After playing around with prime factorizations for a while, I discovered that $675$ was such a number, followed by $3^9cdot5^2$. Clearly this has something to do with the prime factorization of these integers.



Futhermore, I think it is correct to assume that that multiplying $675$ with any number $p^k$ where $p$ is a prime and where $kmid3$ and $kmid2$, such as multiplying by $2^{6}$, which gives us $43200$, which is indeed such a number.



My problem is that I have no idea how I am supposed to write such a proof formally, or even if this is a proof. While I do believe that I have generated an infinite number of positive integers which obey the question, how do I explain it? What am I missing?






elementary-number-theory proof-writing




elementary-number-theory proof-writing






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 19 at 14:55









Naman KumarNaman Kumar

23813




23813








  • 2




    $begingroup$
    My below answer is a different way to show that infinite many solutions exist, but your argument is perfectly right. You have found one solution and showed that we can multiply it how often we want with $64$ to get another solution. This clearly shows that infinite many solutions must exist.
    $endgroup$
    – Peter
    Jan 19 at 15:09












  • $begingroup$
    Do you think you can extend this result to more primes?
    $endgroup$
    – астон вілла олоф мэллбэрг
    Jan 19 at 15:17






  • 1




    $begingroup$
    Extend the $p^k$ result or to some integer $n$ where $pn$ and $qn$ are powers for prime $p$ and $q$?
    $endgroup$
    – Naman Kumar
    Jan 19 at 15:19














  • 2




    $begingroup$
    My below answer is a different way to show that infinite many solutions exist, but your argument is perfectly right. You have found one solution and showed that we can multiply it how often we want with $64$ to get another solution. This clearly shows that infinite many solutions must exist.
    $endgroup$
    – Peter
    Jan 19 at 15:09












  • $begingroup$
    Do you think you can extend this result to more primes?
    $endgroup$
    – астон вілла олоф мэллбэрг
    Jan 19 at 15:17






  • 1




    $begingroup$
    Extend the $p^k$ result or to some integer $n$ where $pn$ and $qn$ are powers for prime $p$ and $q$?
    $endgroup$
    – Naman Kumar
    Jan 19 at 15:19








2




2




$begingroup$
My below answer is a different way to show that infinite many solutions exist, but your argument is perfectly right. You have found one solution and showed that we can multiply it how often we want with $64$ to get another solution. This clearly shows that infinite many solutions must exist.
$endgroup$
– Peter
Jan 19 at 15:09






$begingroup$
My below answer is a different way to show that infinite many solutions exist, but your argument is perfectly right. You have found one solution and showed that we can multiply it how often we want with $64$ to get another solution. This clearly shows that infinite many solutions must exist.
$endgroup$
– Peter
Jan 19 at 15:09














$begingroup$
Do you think you can extend this result to more primes?
$endgroup$
– астон вілла олоф мэллбэрг
Jan 19 at 15:17




$begingroup$
Do you think you can extend this result to more primes?
$endgroup$
– астон вілла олоф мэллбэрг
Jan 19 at 15:17




1




1




$begingroup$
Extend the $p^k$ result or to some integer $n$ where $pn$ and $qn$ are powers for prime $p$ and $q$?
$endgroup$
– Naman Kumar
Jan 19 at 15:19




$begingroup$
Extend the $p^k$ result or to some integer $n$ where $pn$ and $qn$ are powers for prime $p$ and $q$?
$endgroup$
– Naman Kumar
Jan 19 at 15:19










3 Answers
3






active

oldest

votes


















1












$begingroup$

You have to find positive integers $nge 3$, such that $3n$ is a perfect square and $5n$ is a perfect cube.



Consider $$n=3^acdot 5^b$$ with positive integers $a$ and $b$. $3n$ is a perfect square, if $a$ is odd and $b$ is even. $5n$ is a perfect cube, if $a$ is divisible by $3$ and $b$ has the form $3k+2$. Hence, it is enough that $a$ is of the form $6s+3$ and $b$ of the form $6t+2$ , giving infinite many solutions.






share|cite|improve this answer









$endgroup$





















    1












    $begingroup$

    You already have it all for demonstrating there are infinite such numbers.



    $$n=675cdot p^6$$
    for primes $p>5$ already gives you infinitely many solutions.






    share|cite|improve this answer









    $endgroup$





















      1












      $begingroup$

      You basically want infinitely many $n$ with $5n$ a perfect cube, and $3n$ a perfect square. Indeed, your last argument is enough to produce infinitely such $n$, since $n = 675p^{6l}$, for any prime(in fact any number) $p$ and any $l$ satisfies the given conditions. This is easy to see because :
      $$
      5n = 5 times 675 p^{6l} = 5^33^3p^{6l} = (15p^{2l})^3 quad ; quad 3n = 3 times 675 p^{6l} = 5^23^4p^{6l} = (45p^{3l})^2
      $$



      Since both $p$ and $l$ may infinitely vary, we see (from prime factorization) that we can produce infinitely many values of $n$, and hence infinitely many tuples $(a,b,c,d,e) = (n-2,n-1,n,n+1,n+2)$.






      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%2f3079431%2fquestion-pertaining-to-perfect-powers-in-sums-of-consecutive-integers%23new-answer', 'question_page');
        }
        );

        Post as a guest















        Required, but never shown

























        3 Answers
        3






        active

        oldest

        votes








        3 Answers
        3






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes









        1












        $begingroup$

        You have to find positive integers $nge 3$, such that $3n$ is a perfect square and $5n$ is a perfect cube.



        Consider $$n=3^acdot 5^b$$ with positive integers $a$ and $b$. $3n$ is a perfect square, if $a$ is odd and $b$ is even. $5n$ is a perfect cube, if $a$ is divisible by $3$ and $b$ has the form $3k+2$. Hence, it is enough that $a$ is of the form $6s+3$ and $b$ of the form $6t+2$ , giving infinite many solutions.






        share|cite|improve this answer









        $endgroup$


















          1












          $begingroup$

          You have to find positive integers $nge 3$, such that $3n$ is a perfect square and $5n$ is a perfect cube.



          Consider $$n=3^acdot 5^b$$ with positive integers $a$ and $b$. $3n$ is a perfect square, if $a$ is odd and $b$ is even. $5n$ is a perfect cube, if $a$ is divisible by $3$ and $b$ has the form $3k+2$. Hence, it is enough that $a$ is of the form $6s+3$ and $b$ of the form $6t+2$ , giving infinite many solutions.






          share|cite|improve this answer









          $endgroup$
















            1












            1








            1





            $begingroup$

            You have to find positive integers $nge 3$, such that $3n$ is a perfect square and $5n$ is a perfect cube.



            Consider $$n=3^acdot 5^b$$ with positive integers $a$ and $b$. $3n$ is a perfect square, if $a$ is odd and $b$ is even. $5n$ is a perfect cube, if $a$ is divisible by $3$ and $b$ has the form $3k+2$. Hence, it is enough that $a$ is of the form $6s+3$ and $b$ of the form $6t+2$ , giving infinite many solutions.






            share|cite|improve this answer









            $endgroup$



            You have to find positive integers $nge 3$, such that $3n$ is a perfect square and $5n$ is a perfect cube.



            Consider $$n=3^acdot 5^b$$ with positive integers $a$ and $b$. $3n$ is a perfect square, if $a$ is odd and $b$ is even. $5n$ is a perfect cube, if $a$ is divisible by $3$ and $b$ has the form $3k+2$. Hence, it is enough that $a$ is of the form $6s+3$ and $b$ of the form $6t+2$ , giving infinite many solutions.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Jan 19 at 15:03









            PeterPeter

            47.6k1039131




            47.6k1039131























                1












                $begingroup$

                You already have it all for demonstrating there are infinite such numbers.



                $$n=675cdot p^6$$
                for primes $p>5$ already gives you infinitely many solutions.






                share|cite|improve this answer









                $endgroup$


















                  1












                  $begingroup$

                  You already have it all for demonstrating there are infinite such numbers.



                  $$n=675cdot p^6$$
                  for primes $p>5$ already gives you infinitely many solutions.






                  share|cite|improve this answer









                  $endgroup$
















                    1












                    1








                    1





                    $begingroup$

                    You already have it all for demonstrating there are infinite such numbers.



                    $$n=675cdot p^6$$
                    for primes $p>5$ already gives you infinitely many solutions.






                    share|cite|improve this answer









                    $endgroup$



                    You already have it all for demonstrating there are infinite such numbers.



                    $$n=675cdot p^6$$
                    for primes $p>5$ already gives you infinitely many solutions.







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Jan 19 at 15:05









                    BerciBerci

                    60.9k23673




                    60.9k23673























                        1












                        $begingroup$

                        You basically want infinitely many $n$ with $5n$ a perfect cube, and $3n$ a perfect square. Indeed, your last argument is enough to produce infinitely such $n$, since $n = 675p^{6l}$, for any prime(in fact any number) $p$ and any $l$ satisfies the given conditions. This is easy to see because :
                        $$
                        5n = 5 times 675 p^{6l} = 5^33^3p^{6l} = (15p^{2l})^3 quad ; quad 3n = 3 times 675 p^{6l} = 5^23^4p^{6l} = (45p^{3l})^2
                        $$



                        Since both $p$ and $l$ may infinitely vary, we see (from prime factorization) that we can produce infinitely many values of $n$, and hence infinitely many tuples $(a,b,c,d,e) = (n-2,n-1,n,n+1,n+2)$.






                        share|cite|improve this answer









                        $endgroup$


















                          1












                          $begingroup$

                          You basically want infinitely many $n$ with $5n$ a perfect cube, and $3n$ a perfect square. Indeed, your last argument is enough to produce infinitely such $n$, since $n = 675p^{6l}$, for any prime(in fact any number) $p$ and any $l$ satisfies the given conditions. This is easy to see because :
                          $$
                          5n = 5 times 675 p^{6l} = 5^33^3p^{6l} = (15p^{2l})^3 quad ; quad 3n = 3 times 675 p^{6l} = 5^23^4p^{6l} = (45p^{3l})^2
                          $$



                          Since both $p$ and $l$ may infinitely vary, we see (from prime factorization) that we can produce infinitely many values of $n$, and hence infinitely many tuples $(a,b,c,d,e) = (n-2,n-1,n,n+1,n+2)$.






                          share|cite|improve this answer









                          $endgroup$
















                            1












                            1








                            1





                            $begingroup$

                            You basically want infinitely many $n$ with $5n$ a perfect cube, and $3n$ a perfect square. Indeed, your last argument is enough to produce infinitely such $n$, since $n = 675p^{6l}$, for any prime(in fact any number) $p$ and any $l$ satisfies the given conditions. This is easy to see because :
                            $$
                            5n = 5 times 675 p^{6l} = 5^33^3p^{6l} = (15p^{2l})^3 quad ; quad 3n = 3 times 675 p^{6l} = 5^23^4p^{6l} = (45p^{3l})^2
                            $$



                            Since both $p$ and $l$ may infinitely vary, we see (from prime factorization) that we can produce infinitely many values of $n$, and hence infinitely many tuples $(a,b,c,d,e) = (n-2,n-1,n,n+1,n+2)$.






                            share|cite|improve this answer









                            $endgroup$



                            You basically want infinitely many $n$ with $5n$ a perfect cube, and $3n$ a perfect square. Indeed, your last argument is enough to produce infinitely such $n$, since $n = 675p^{6l}$, for any prime(in fact any number) $p$ and any $l$ satisfies the given conditions. This is easy to see because :
                            $$
                            5n = 5 times 675 p^{6l} = 5^33^3p^{6l} = (15p^{2l})^3 quad ; quad 3n = 3 times 675 p^{6l} = 5^23^4p^{6l} = (45p^{3l})^2
                            $$



                            Since both $p$ and $l$ may infinitely vary, we see (from prime factorization) that we can produce infinitely many values of $n$, and hence infinitely many tuples $(a,b,c,d,e) = (n-2,n-1,n,n+1,n+2)$.







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered Jan 19 at 15:06









                            астон вілла олоф мэллбэргастон вілла олоф мэллбэрг

                            38.5k33376




                            38.5k33376






























                                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%2f3079431%2fquestion-pertaining-to-perfect-powers-in-sums-of-consecutive-integers%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

                                Mario Kart Wii

                                Image
                                Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! Mario Kart Wii From The Cutting Room Floor Jump to: navigation, search Mario Kart Wii Developer : Nintendo Publisher : Nintendo Platform : Wii Released in JP : April 10, 2008 Released in US : April 27, 2008 Released in EU : April 11, 2008 Released in AU : April 24, 2008 Released in KR : April 30, 2009 This game has unused animations. This game has unused areas. This game has unused code. This game has unused objects. This game has unused modes / minigames. This game has unused graphics. This game has unused models. This game has unused items. This game has unused music. This game has regional differences. This game has a notes page This game has a prerelease article Mario Kart Wii is the sixth game in the series (not counting Arcade editions), which intro
                                Read more

                                What does “Dominus providebit” mean?

                                Image
                                5 Does "Dominus providebit" mean "The Lord will provide" or "The Lord provides"? I once had a bit of an argument with a guy who studied Latin over that. It's an inscription that appears on the rim of some old Swiss coins that I have. meaning latin-to-english-translation grammar-identification share | improve this question edited Jan 18 at 15:27 V2Blast 105 4 asked Jan 17 at 22:49 Donald K. Donald K. 26 1
                                Read more

                                The Binding of Isaac: Rebirth/Afterbirth

                                Image
                                Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! The Binding of Isaac: Rebirth/Afterbirth From The Cutting Room Floor < The Binding of Isaac: Rebirth Jump to: navigation, search This is a sub-page of The Binding of Isaac: Rebirth . Afterbirth is the first expansion pack for Rebirth and features a variety of improvements. Contents 1 Unused Graphics 1.1 Old Man Keeper 1.2 Skinless Hush 1.3 Miscellaneous Unused Hush Sprites 1.4 Generosity achievement 1.5 Afterbirth+ Room Editor 1.6 Bearded Ultra Greed 1.7 Early Ultra Greed 1.8 Unused Brownie Expression 1.9 Frail's Spinning Head 1.10 Mom's Dead Hand Alt 2 Unused Audio 2.1 Unused Dead Womb Layer 2.2 Unused Hush Battle Outro 2.3 The Stain Grunt Unused Graphics Old Man Keeper Image file: gfxuimain me
                                Read more