For $n in mathbb{Z}^+$, $x in mathbb{Z}$, $k in mathbb{Z}$, $F(n)=min(|n^2-17x|)$ must be $0$ or $2^k$












0












$begingroup$


I've difficult to understand the question that was given to me yesterday:




Prove that for $n in mathbb{Z}^+$, $x in mathbb{Z}$, $k in mathbb{Z}$,
$F(n)=min(|n^2-17x|)$ must be $0$ or $2^k$




I've divided into two cases: if $n = 2i+1$ (odd) and $n = 2i$ (even), but I'm stuck at this point.



Any hints? I do not understand the || in this context.



Thanks










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    The $||$ just means absolute value (the quantity inside is an integer).
    $endgroup$
    – platty
    Dec 5 '18 at 7:42
















0












$begingroup$


I've difficult to understand the question that was given to me yesterday:




Prove that for $n in mathbb{Z}^+$, $x in mathbb{Z}$, $k in mathbb{Z}$,
$F(n)=min(|n^2-17x|)$ must be $0$ or $2^k$




I've divided into two cases: if $n = 2i+1$ (odd) and $n = 2i$ (even), but I'm stuck at this point.



Any hints? I do not understand the || in this context.



Thanks










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    The $||$ just means absolute value (the quantity inside is an integer).
    $endgroup$
    – platty
    Dec 5 '18 at 7:42














0












0








0





$begingroup$


I've difficult to understand the question that was given to me yesterday:




Prove that for $n in mathbb{Z}^+$, $x in mathbb{Z}$, $k in mathbb{Z}$,
$F(n)=min(|n^2-17x|)$ must be $0$ or $2^k$




I've divided into two cases: if $n = 2i+1$ (odd) and $n = 2i$ (even), but I'm stuck at this point.



Any hints? I do not understand the || in this context.



Thanks










share|cite|improve this question









$endgroup$




I've difficult to understand the question that was given to me yesterday:




Prove that for $n in mathbb{Z}^+$, $x in mathbb{Z}$, $k in mathbb{Z}$,
$F(n)=min(|n^2-17x|)$ must be $0$ or $2^k$




I've divided into two cases: if $n = 2i+1$ (odd) and $n = 2i$ (even), but I'm stuck at this point.



Any hints? I do not understand the || in this context.



Thanks







elementary-number-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 5 '18 at 7:25









AlessarAlessar

20613




20613








  • 1




    $begingroup$
    The $||$ just means absolute value (the quantity inside is an integer).
    $endgroup$
    – platty
    Dec 5 '18 at 7:42














  • 1




    $begingroup$
    The $||$ just means absolute value (the quantity inside is an integer).
    $endgroup$
    – platty
    Dec 5 '18 at 7:42








1




1




$begingroup$
The $||$ just means absolute value (the quantity inside is an integer).
$endgroup$
– platty
Dec 5 '18 at 7:42




$begingroup$
The $||$ just means absolute value (the quantity inside is an integer).
$endgroup$
– platty
Dec 5 '18 at 7:42










1 Answer
1






active

oldest

votes


















3












$begingroup$

You should instead divide into $17$ cases. The quantity $F(n)$ is entirely determined by the remainder of $n$ when divided by $17$. To prove this, show that if $n$ and $m$ have the same remainder upon division by $17$, then so do $n^2$ and $m^2$, and realize that the remainders of $n^2$ and $m^2$ determine their distance to the nearest multiple of $17$.



So you only need look at $n=1,2,dots,17$, and note that for each, $F(n)=0,1,2,4$ or $8$.






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%2f3026764%2ffor-n-in-mathbbz-x-in-mathbbz-k-in-mathbbz-fn-minn%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









    3












    $begingroup$

    You should instead divide into $17$ cases. The quantity $F(n)$ is entirely determined by the remainder of $n$ when divided by $17$. To prove this, show that if $n$ and $m$ have the same remainder upon division by $17$, then so do $n^2$ and $m^2$, and realize that the remainders of $n^2$ and $m^2$ determine their distance to the nearest multiple of $17$.



    So you only need look at $n=1,2,dots,17$, and note that for each, $F(n)=0,1,2,4$ or $8$.






    share|cite|improve this answer









    $endgroup$


















      3












      $begingroup$

      You should instead divide into $17$ cases. The quantity $F(n)$ is entirely determined by the remainder of $n$ when divided by $17$. To prove this, show that if $n$ and $m$ have the same remainder upon division by $17$, then so do $n^2$ and $m^2$, and realize that the remainders of $n^2$ and $m^2$ determine their distance to the nearest multiple of $17$.



      So you only need look at $n=1,2,dots,17$, and note that for each, $F(n)=0,1,2,4$ or $8$.






      share|cite|improve this answer









      $endgroup$
















        3












        3








        3





        $begingroup$

        You should instead divide into $17$ cases. The quantity $F(n)$ is entirely determined by the remainder of $n$ when divided by $17$. To prove this, show that if $n$ and $m$ have the same remainder upon division by $17$, then so do $n^2$ and $m^2$, and realize that the remainders of $n^2$ and $m^2$ determine their distance to the nearest multiple of $17$.



        So you only need look at $n=1,2,dots,17$, and note that for each, $F(n)=0,1,2,4$ or $8$.






        share|cite|improve this answer









        $endgroup$



        You should instead divide into $17$ cases. The quantity $F(n)$ is entirely determined by the remainder of $n$ when divided by $17$. To prove this, show that if $n$ and $m$ have the same remainder upon division by $17$, then so do $n^2$ and $m^2$, and realize that the remainders of $n^2$ and $m^2$ determine their distance to the nearest multiple of $17$.



        So you only need look at $n=1,2,dots,17$, and note that for each, $F(n)=0,1,2,4$ or $8$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 5 '18 at 7:44









        Mike EarnestMike Earnest

        20.9k11951




        20.9k11951






























            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%2f3026764%2ffor-n-in-mathbbz-x-in-mathbbz-k-in-mathbbz-fn-minn%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

            To store a contact into the json file from server.js file using a class in NodeJS

            Redirect URL with Chrome Remote Debugging Android Devices

            Dieringhausen