Question about number of perfect squares between two perfect cubes












-2












$begingroup$


Prove that for a natural number $k≥2$ , there are a minimum of two perfect squares in the interval $(k^3,(k+1)^3)$



I tried induction , supposing that there are $m^2<n^2$ in the interval , and to prove that there exists two perfect squares $q^2<r^2$ in $((k+1)^3,(k+2)^3))$.






number-theory







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Welcome to stackexchange. If you edit the question to show us what you tried and where you are stuck we may be able to help.
    $endgroup$
    – Ethan Bolker
    Dec 14 '18 at 18:53










  • $begingroup$
    As a hint to get started: can you prove that there is at least one perfect square in the interval?
    $endgroup$
    – lulu
    Dec 14 '18 at 18:59










  • $begingroup$
    Yes , I think it's $([sqrt{k^3}]^2)$
    $endgroup$
    – reducere cs
    Dec 14 '18 at 19:08












  • $begingroup$
    Hint: for $kge 2$, $(k+1)^{3/2}-k^{3/2}=frac{3}{2}sqrt{k}>2$.
    $endgroup$
    – J.G.
    Dec 14 '18 at 19:10










  • $begingroup$
    So there are at least two integers between $(k+1)^frac{3}{2} - k^frac{3}{2}$ or
    $endgroup$
    – reducere cs
    Dec 14 '18 at 19:15


















-2












$begingroup$


Prove that for a natural number $k≥2$ , there are a minimum of two perfect squares in the interval $(k^3,(k+1)^3)$



I tried induction , supposing that there are $m^2<n^2$ in the interval , and to prove that there exists two perfect squares $q^2<r^2$ in $((k+1)^3,(k+2)^3))$.






number-theory







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Welcome to stackexchange. If you edit the question to show us what you tried and where you are stuck we may be able to help.
    $endgroup$
    – Ethan Bolker
    Dec 14 '18 at 18:53










  • $begingroup$
    As a hint to get started: can you prove that there is at least one perfect square in the interval?
    $endgroup$
    – lulu
    Dec 14 '18 at 18:59










  • $begingroup$
    Yes , I think it's $([sqrt{k^3}]^2)$
    $endgroup$
    – reducere cs
    Dec 14 '18 at 19:08












  • $begingroup$
    Hint: for $kge 2$, $(k+1)^{3/2}-k^{3/2}=frac{3}{2}sqrt{k}>2$.
    $endgroup$
    – J.G.
    Dec 14 '18 at 19:10










  • $begingroup$
    So there are at least two integers between $(k+1)^frac{3}{2} - k^frac{3}{2}$ or
    $endgroup$
    – reducere cs
    Dec 14 '18 at 19:15
















-2












-2








-2





$begingroup$


Prove that for a natural number $k≥2$ , there are a minimum of two perfect squares in the interval $(k^3,(k+1)^3)$



I tried induction , supposing that there are $m^2<n^2$ in the interval , and to prove that there exists two perfect squares $q^2<r^2$ in $((k+1)^3,(k+2)^3))$.






number-theory







share|cite|improve this question











$endgroup$




Prove that for a natural number $k≥2$ , there are a minimum of two perfect squares in the interval $(k^3,(k+1)^3)$



I tried induction , supposing that there are $m^2<n^2$ in the interval , and to prove that there exists two perfect squares $q^2<r^2$ in $((k+1)^3,(k+2)^3))$.






number-theory




number-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 14 '18 at 18:56







reducere cs

















asked Dec 14 '18 at 18:52









reducere csreducere cs

112




112








  • 1




    $begingroup$
    Welcome to stackexchange. If you edit the question to show us what you tried and where you are stuck we may be able to help.
    $endgroup$
    – Ethan Bolker
    Dec 14 '18 at 18:53










  • $begingroup$
    As a hint to get started: can you prove that there is at least one perfect square in the interval?
    $endgroup$
    – lulu
    Dec 14 '18 at 18:59










  • $begingroup$
    Yes , I think it's $([sqrt{k^3}]^2)$
    $endgroup$
    – reducere cs
    Dec 14 '18 at 19:08












  • $begingroup$
    Hint: for $kge 2$, $(k+1)^{3/2}-k^{3/2}=frac{3}{2}sqrt{k}>2$.
    $endgroup$
    – J.G.
    Dec 14 '18 at 19:10










  • $begingroup$
    So there are at least two integers between $(k+1)^frac{3}{2} - k^frac{3}{2}$ or
    $endgroup$
    – reducere cs
    Dec 14 '18 at 19:15
















  • 1




    $begingroup$
    Welcome to stackexchange. If you edit the question to show us what you tried and where you are stuck we may be able to help.
    $endgroup$
    – Ethan Bolker
    Dec 14 '18 at 18:53










  • $begingroup$
    As a hint to get started: can you prove that there is at least one perfect square in the interval?
    $endgroup$
    – lulu
    Dec 14 '18 at 18:59










  • $begingroup$
    Yes , I think it's $([sqrt{k^3}]^2)$
    $endgroup$
    – reducere cs
    Dec 14 '18 at 19:08












  • $begingroup$
    Hint: for $kge 2$, $(k+1)^{3/2}-k^{3/2}=frac{3}{2}sqrt{k}>2$.
    $endgroup$
    – J.G.
    Dec 14 '18 at 19:10










  • $begingroup$
    So there are at least two integers between $(k+1)^frac{3}{2} - k^frac{3}{2}$ or
    $endgroup$
    – reducere cs
    Dec 14 '18 at 19:15










1




1




$begingroup$
Welcome to stackexchange. If you edit the question to show us what you tried and where you are stuck we may be able to help.
$endgroup$
– Ethan Bolker
Dec 14 '18 at 18:53




$begingroup$
Welcome to stackexchange. If you edit the question to show us what you tried and where you are stuck we may be able to help.
$endgroup$
– Ethan Bolker
Dec 14 '18 at 18:53












$begingroup$
As a hint to get started: can you prove that there is at least one perfect square in the interval?
$endgroup$
– lulu
Dec 14 '18 at 18:59




$begingroup$
As a hint to get started: can you prove that there is at least one perfect square in the interval?
$endgroup$
– lulu
Dec 14 '18 at 18:59












$begingroup$
Yes , I think it's $([sqrt{k^3}]^2)$
$endgroup$
– reducere cs
Dec 14 '18 at 19:08






$begingroup$
Yes , I think it's $([sqrt{k^3}]^2)$
$endgroup$
– reducere cs
Dec 14 '18 at 19:08














$begingroup$
Hint: for $kge 2$, $(k+1)^{3/2}-k^{3/2}=frac{3}{2}sqrt{k}>2$.
$endgroup$
– J.G.
Dec 14 '18 at 19:10




$begingroup$
Hint: for $kge 2$, $(k+1)^{3/2}-k^{3/2}=frac{3}{2}sqrt{k}>2$.
$endgroup$
– J.G.
Dec 14 '18 at 19:10












$begingroup$
So there are at least two integers between $(k+1)^frac{3}{2} - k^frac{3}{2}$ or
$endgroup$
– reducere cs
Dec 14 '18 at 19:15






$begingroup$
So there are at least two integers between $(k+1)^frac{3}{2} - k^frac{3}{2}$ or
$endgroup$
– reducere cs
Dec 14 '18 at 19:15












1 Answer
1






active

oldest

votes


















0












$begingroup$

Let $m$ be the largest integer such that $m^2le k^3$



$mle k^{frac 32}$



if $k>1$



$4m le 4k^{frac 32} < 3k^2$ and $4<3k+1$



$k^3<(m+1)^2<(m+2)^2 = m^2 + 4m + 4 < k^3 + 3k^2 + 3k + 1 = (k+1)^3$






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%2f3039773%2fquestion-about-number-of-perfect-squares-between-two-perfect-cubes%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$

    Let $m$ be the largest integer such that $m^2le k^3$



    $mle k^{frac 32}$



    if $k>1$



    $4m le 4k^{frac 32} < 3k^2$ and $4<3k+1$



    $k^3<(m+1)^2<(m+2)^2 = m^2 + 4m + 4 < k^3 + 3k^2 + 3k + 1 = (k+1)^3$






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      Let $m$ be the largest integer such that $m^2le k^3$



      $mle k^{frac 32}$



      if $k>1$



      $4m le 4k^{frac 32} < 3k^2$ and $4<3k+1$



      $k^3<(m+1)^2<(m+2)^2 = m^2 + 4m + 4 < k^3 + 3k^2 + 3k + 1 = (k+1)^3$






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        Let $m$ be the largest integer such that $m^2le k^3$



        $mle k^{frac 32}$



        if $k>1$



        $4m le 4k^{frac 32} < 3k^2$ and $4<3k+1$



        $k^3<(m+1)^2<(m+2)^2 = m^2 + 4m + 4 < k^3 + 3k^2 + 3k + 1 = (k+1)^3$






        share|cite|improve this answer









        $endgroup$



        Let $m$ be the largest integer such that $m^2le k^3$



        $mle k^{frac 32}$



        if $k>1$



        $4m le 4k^{frac 32} < 3k^2$ and $4<3k+1$



        $k^3<(m+1)^2<(m+2)^2 = m^2 + 4m + 4 < k^3 + 3k^2 + 3k + 1 = (k+1)^3$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 14 '18 at 19:22









        Doug MDoug M

        44.9k31854




        44.9k31854






























            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%2f3039773%2fquestion-about-number-of-perfect-squares-between-two-perfect-cubes%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