If $n$ is an integer , find all the possible values for $(8n+6,6n+3)$











up vote
1
down vote

favorite
1












I have got 2 questions which I could not solve:



1) if $n$ is an integer , find all the possible values for $(8n+6,6n+3)$



2)if $n$ is an integer, find all possible values of $(2n^2+3n+5,n^2+n+1)$










share|cite|improve this question
























  • Any thoughts? An easy thing to do is to write out the values for the first few $n$, see if that generates any ideas.
    – lulu
    2 days ago










  • When I first read the question, I thought the parentheses were representing ordered pairs, but the answers are talking about gcd. Are the parentheses supposed to represent gcd? Ideal generated by these elements? I think the notation needs to be clearer.
    – Acccumulation
    2 days ago










  • @Acccumulation Haha yes I thiught the same thing "How epse can you possibly simplify this sequence in $R^2???$"
    – Ovi
    2 days ago

















up vote
1
down vote

favorite
1












I have got 2 questions which I could not solve:



1) if $n$ is an integer , find all the possible values for $(8n+6,6n+3)$



2)if $n$ is an integer, find all possible values of $(2n^2+3n+5,n^2+n+1)$










share|cite|improve this question
























  • Any thoughts? An easy thing to do is to write out the values for the first few $n$, see if that generates any ideas.
    – lulu
    2 days ago










  • When I first read the question, I thought the parentheses were representing ordered pairs, but the answers are talking about gcd. Are the parentheses supposed to represent gcd? Ideal generated by these elements? I think the notation needs to be clearer.
    – Acccumulation
    2 days ago










  • @Acccumulation Haha yes I thiught the same thing "How epse can you possibly simplify this sequence in $R^2???$"
    – Ovi
    2 days ago















up vote
1
down vote

favorite
1









up vote
1
down vote

favorite
1






1





I have got 2 questions which I could not solve:



1) if $n$ is an integer , find all the possible values for $(8n+6,6n+3)$



2)if $n$ is an integer, find all possible values of $(2n^2+3n+5,n^2+n+1)$










share|cite|improve this question















I have got 2 questions which I could not solve:



1) if $n$ is an integer , find all the possible values for $(8n+6,6n+3)$



2)if $n$ is an integer, find all possible values of $(2n^2+3n+5,n^2+n+1)$







abstract-algebra algebra-precalculus






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 2 days ago









greedoid

34.3k114488




34.3k114488










asked 2 days ago









ten1o

1335




1335












  • Any thoughts? An easy thing to do is to write out the values for the first few $n$, see if that generates any ideas.
    – lulu
    2 days ago










  • When I first read the question, I thought the parentheses were representing ordered pairs, but the answers are talking about gcd. Are the parentheses supposed to represent gcd? Ideal generated by these elements? I think the notation needs to be clearer.
    – Acccumulation
    2 days ago










  • @Acccumulation Haha yes I thiught the same thing "How epse can you possibly simplify this sequence in $R^2???$"
    – Ovi
    2 days ago




















  • Any thoughts? An easy thing to do is to write out the values for the first few $n$, see if that generates any ideas.
    – lulu
    2 days ago










  • When I first read the question, I thought the parentheses were representing ordered pairs, but the answers are talking about gcd. Are the parentheses supposed to represent gcd? Ideal generated by these elements? I think the notation needs to be clearer.
    – Acccumulation
    2 days ago










  • @Acccumulation Haha yes I thiught the same thing "How epse can you possibly simplify this sequence in $R^2???$"
    – Ovi
    2 days ago


















Any thoughts? An easy thing to do is to write out the values for the first few $n$, see if that generates any ideas.
– lulu
2 days ago




Any thoughts? An easy thing to do is to write out the values for the first few $n$, see if that generates any ideas.
– lulu
2 days ago












When I first read the question, I thought the parentheses were representing ordered pairs, but the answers are talking about gcd. Are the parentheses supposed to represent gcd? Ideal generated by these elements? I think the notation needs to be clearer.
– Acccumulation
2 days ago




When I first read the question, I thought the parentheses were representing ordered pairs, but the answers are talking about gcd. Are the parentheses supposed to represent gcd? Ideal generated by these elements? I think the notation needs to be clearer.
– Acccumulation
2 days ago












@Acccumulation Haha yes I thiught the same thing "How epse can you possibly simplify this sequence in $R^2???$"
– Ovi
2 days ago






@Acccumulation Haha yes I thiught the same thing "How epse can you possibly simplify this sequence in $R^2???$"
– Ovi
2 days ago












2 Answers
2






active

oldest

votes

















up vote
1
down vote













Let $d=gcd(8n+6,6n+3)$, then $$dmid 8n+6$$



$$dmid 6n+3$$



so $$dmid 6(8n+6)-8(6n+3)= 12$$



so $din {1,2,3,4,6,12}$ Since $6n+3$ is odd $d$ can not be $2,4,6$ or $12$ so $d=1$ or $d=3$ (which is realised at $n=3k$ for some integer $k$)





For second one:



Let $d=gcd(2n^2+3n+5,n^2 + n+1)$, then $$dmid 2n^2+3n+5$$



$$dmid n^2+n+1$$



so $$dmid 2n^2+3n+5-2(n^2 + n+1) =n+3$$



then $$dmid (n^2+n+1)-(n^2-9)-(n+3)=7$$



So $d=1$ which is ok or $d=7$ which is realised if $n=7k+4$.






share|cite|improve this answer



















  • 2




    Should be $8n+6$ and you can multiply by $3$ and $-4$ rather than $6$ and $-8$, but good method all the same
    – Mark Bennet
    2 days ago


















up vote
1
down vote













$(1)$ A euclidean sequence is $ overbrace{8n!+!6,,6n!+!3,,2n!+!3,,{-}color{#c00}6}^{Large a_{k-1} -, j a_k = a_{k+1}},$ so the gcd is



$$(2n!+!3,,color{#c00}{2cdot 3}) = (2n!+!3,color{#c00}2)(2n!+!3,color{#c00}3) = (3,2)(2n,3) = (n,3)qquadqquad $$



$(2)$ A euclidean sequence is $ 2n^2!+!3n!+!5,!!!!underbrace{n^2!+!n!+!1,, n!+!3,, color{#0a0}7}_{large f(n) equiv color{#0a0}{f(-3)},pmod{!n+3}}!!!!$ so the gcd $= (n!+!3,7)$






share|cite|improve this answer























    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',
    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%2f3005287%2fif-n-is-an-integer-find-all-the-possible-values-for-8n6-6n3%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    1
    down vote













    Let $d=gcd(8n+6,6n+3)$, then $$dmid 8n+6$$



    $$dmid 6n+3$$



    so $$dmid 6(8n+6)-8(6n+3)= 12$$



    so $din {1,2,3,4,6,12}$ Since $6n+3$ is odd $d$ can not be $2,4,6$ or $12$ so $d=1$ or $d=3$ (which is realised at $n=3k$ for some integer $k$)





    For second one:



    Let $d=gcd(2n^2+3n+5,n^2 + n+1)$, then $$dmid 2n^2+3n+5$$



    $$dmid n^2+n+1$$



    so $$dmid 2n^2+3n+5-2(n^2 + n+1) =n+3$$



    then $$dmid (n^2+n+1)-(n^2-9)-(n+3)=7$$



    So $d=1$ which is ok or $d=7$ which is realised if $n=7k+4$.






    share|cite|improve this answer



















    • 2




      Should be $8n+6$ and you can multiply by $3$ and $-4$ rather than $6$ and $-8$, but good method all the same
      – Mark Bennet
      2 days ago















    up vote
    1
    down vote













    Let $d=gcd(8n+6,6n+3)$, then $$dmid 8n+6$$



    $$dmid 6n+3$$



    so $$dmid 6(8n+6)-8(6n+3)= 12$$



    so $din {1,2,3,4,6,12}$ Since $6n+3$ is odd $d$ can not be $2,4,6$ or $12$ so $d=1$ or $d=3$ (which is realised at $n=3k$ for some integer $k$)





    For second one:



    Let $d=gcd(2n^2+3n+5,n^2 + n+1)$, then $$dmid 2n^2+3n+5$$



    $$dmid n^2+n+1$$



    so $$dmid 2n^2+3n+5-2(n^2 + n+1) =n+3$$



    then $$dmid (n^2+n+1)-(n^2-9)-(n+3)=7$$



    So $d=1$ which is ok or $d=7$ which is realised if $n=7k+4$.






    share|cite|improve this answer



















    • 2




      Should be $8n+6$ and you can multiply by $3$ and $-4$ rather than $6$ and $-8$, but good method all the same
      – Mark Bennet
      2 days ago













    up vote
    1
    down vote










    up vote
    1
    down vote









    Let $d=gcd(8n+6,6n+3)$, then $$dmid 8n+6$$



    $$dmid 6n+3$$



    so $$dmid 6(8n+6)-8(6n+3)= 12$$



    so $din {1,2,3,4,6,12}$ Since $6n+3$ is odd $d$ can not be $2,4,6$ or $12$ so $d=1$ or $d=3$ (which is realised at $n=3k$ for some integer $k$)





    For second one:



    Let $d=gcd(2n^2+3n+5,n^2 + n+1)$, then $$dmid 2n^2+3n+5$$



    $$dmid n^2+n+1$$



    so $$dmid 2n^2+3n+5-2(n^2 + n+1) =n+3$$



    then $$dmid (n^2+n+1)-(n^2-9)-(n+3)=7$$



    So $d=1$ which is ok or $d=7$ which is realised if $n=7k+4$.






    share|cite|improve this answer














    Let $d=gcd(8n+6,6n+3)$, then $$dmid 8n+6$$



    $$dmid 6n+3$$



    so $$dmid 6(8n+6)-8(6n+3)= 12$$



    so $din {1,2,3,4,6,12}$ Since $6n+3$ is odd $d$ can not be $2,4,6$ or $12$ so $d=1$ or $d=3$ (which is realised at $n=3k$ for some integer $k$)





    For second one:



    Let $d=gcd(2n^2+3n+5,n^2 + n+1)$, then $$dmid 2n^2+3n+5$$



    $$dmid n^2+n+1$$



    so $$dmid 2n^2+3n+5-2(n^2 + n+1) =n+3$$



    then $$dmid (n^2+n+1)-(n^2-9)-(n+3)=7$$



    So $d=1$ which is ok or $d=7$ which is realised if $n=7k+4$.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited 2 days ago

























    answered 2 days ago









    greedoid

    34.3k114488




    34.3k114488








    • 2




      Should be $8n+6$ and you can multiply by $3$ and $-4$ rather than $6$ and $-8$, but good method all the same
      – Mark Bennet
      2 days ago














    • 2




      Should be $8n+6$ and you can multiply by $3$ and $-4$ rather than $6$ and $-8$, but good method all the same
      – Mark Bennet
      2 days ago








    2




    2




    Should be $8n+6$ and you can multiply by $3$ and $-4$ rather than $6$ and $-8$, but good method all the same
    – Mark Bennet
    2 days ago




    Should be $8n+6$ and you can multiply by $3$ and $-4$ rather than $6$ and $-8$, but good method all the same
    – Mark Bennet
    2 days ago










    up vote
    1
    down vote













    $(1)$ A euclidean sequence is $ overbrace{8n!+!6,,6n!+!3,,2n!+!3,,{-}color{#c00}6}^{Large a_{k-1} -, j a_k = a_{k+1}},$ so the gcd is



    $$(2n!+!3,,color{#c00}{2cdot 3}) = (2n!+!3,color{#c00}2)(2n!+!3,color{#c00}3) = (3,2)(2n,3) = (n,3)qquadqquad $$



    $(2)$ A euclidean sequence is $ 2n^2!+!3n!+!5,!!!!underbrace{n^2!+!n!+!1,, n!+!3,, color{#0a0}7}_{large f(n) equiv color{#0a0}{f(-3)},pmod{!n+3}}!!!!$ so the gcd $= (n!+!3,7)$






    share|cite|improve this answer



























      up vote
      1
      down vote













      $(1)$ A euclidean sequence is $ overbrace{8n!+!6,,6n!+!3,,2n!+!3,,{-}color{#c00}6}^{Large a_{k-1} -, j a_k = a_{k+1}},$ so the gcd is



      $$(2n!+!3,,color{#c00}{2cdot 3}) = (2n!+!3,color{#c00}2)(2n!+!3,color{#c00}3) = (3,2)(2n,3) = (n,3)qquadqquad $$



      $(2)$ A euclidean sequence is $ 2n^2!+!3n!+!5,!!!!underbrace{n^2!+!n!+!1,, n!+!3,, color{#0a0}7}_{large f(n) equiv color{#0a0}{f(-3)},pmod{!n+3}}!!!!$ so the gcd $= (n!+!3,7)$






      share|cite|improve this answer

























        up vote
        1
        down vote










        up vote
        1
        down vote









        $(1)$ A euclidean sequence is $ overbrace{8n!+!6,,6n!+!3,,2n!+!3,,{-}color{#c00}6}^{Large a_{k-1} -, j a_k = a_{k+1}},$ so the gcd is



        $$(2n!+!3,,color{#c00}{2cdot 3}) = (2n!+!3,color{#c00}2)(2n!+!3,color{#c00}3) = (3,2)(2n,3) = (n,3)qquadqquad $$



        $(2)$ A euclidean sequence is $ 2n^2!+!3n!+!5,!!!!underbrace{n^2!+!n!+!1,, n!+!3,, color{#0a0}7}_{large f(n) equiv color{#0a0}{f(-3)},pmod{!n+3}}!!!!$ so the gcd $= (n!+!3,7)$






        share|cite|improve this answer














        $(1)$ A euclidean sequence is $ overbrace{8n!+!6,,6n!+!3,,2n!+!3,,{-}color{#c00}6}^{Large a_{k-1} -, j a_k = a_{k+1}},$ so the gcd is



        $$(2n!+!3,,color{#c00}{2cdot 3}) = (2n!+!3,color{#c00}2)(2n!+!3,color{#c00}3) = (3,2)(2n,3) = (n,3)qquadqquad $$



        $(2)$ A euclidean sequence is $ 2n^2!+!3n!+!5,!!!!underbrace{n^2!+!n!+!1,, n!+!3,, color{#0a0}7}_{large f(n) equiv color{#0a0}{f(-3)},pmod{!n+3}}!!!!$ so the gcd $= (n!+!3,7)$







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited 2 days ago

























        answered 2 days ago









        Bill Dubuque

        206k29189621




        206k29189621






























             

            draft saved


            draft discarded



















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3005287%2fif-n-is-an-integer-find-all-the-possible-values-for-8n6-6n3%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

            Tonle Sap (See)

            I get strange results when I access the Sqlitedatabase with Unity C# via XAMPP

            Guatemaltekische Davis-Cup-Mannschaft