For all integers of n, $n$ is divisible by $2 iff n^4$ is divisible by $2$












-4












$begingroup$



Provide the proof: $forall n in mathbb{Z}$, $n$ is divisible by $2
> iff n^4$ is divisible by $2$.




Just curious on how the proof of this statement would look like.






proof-writing







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Welcome to math.SE!! Please use MathJax to render the math correctly. Also, could you tell us what have you tried please?
    $endgroup$
    – manooooh
    Dec 12 '18 at 6:09






  • 1




    $begingroup$
    The $Rightarrow$-side is quite easy to prove, since there are only two cases. So I would approach this by splitting the proof up to $Rightarrow$ and $Leftarrow$.
    $endgroup$
    – Matti P.
    Dec 12 '18 at 6:14










  • $begingroup$
    @manooooh As far as the proof goes, I only showed n being an even integer, while the second part, where n^4 is divisible by 2, I did not understand if the second part is acting like a condition for the first part of the statement. Just confused on the "if and only if" i guess.
    $endgroup$
    – Dike Doke
    Dec 12 '18 at 6:22
















-4












$begingroup$



Provide the proof: $forall n in mathbb{Z}$, $n$ is divisible by $2
> iff n^4$ is divisible by $2$.




Just curious on how the proof of this statement would look like.






proof-writing







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Welcome to math.SE!! Please use MathJax to render the math correctly. Also, could you tell us what have you tried please?
    $endgroup$
    – manooooh
    Dec 12 '18 at 6:09






  • 1




    $begingroup$
    The $Rightarrow$-side is quite easy to prove, since there are only two cases. So I would approach this by splitting the proof up to $Rightarrow$ and $Leftarrow$.
    $endgroup$
    – Matti P.
    Dec 12 '18 at 6:14










  • $begingroup$
    @manooooh As far as the proof goes, I only showed n being an even integer, while the second part, where n^4 is divisible by 2, I did not understand if the second part is acting like a condition for the first part of the statement. Just confused on the "if and only if" i guess.
    $endgroup$
    – Dike Doke
    Dec 12 '18 at 6:22














-4












-4








-4





$begingroup$



Provide the proof: $forall n in mathbb{Z}$, $n$ is divisible by $2
> iff n^4$ is divisible by $2$.




Just curious on how the proof of this statement would look like.






proof-writing







share|cite|improve this question











$endgroup$





Provide the proof: $forall n in mathbb{Z}$, $n$ is divisible by $2
> iff n^4$ is divisible by $2$.




Just curious on how the proof of this statement would look like.






proof-writing




proof-writing






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 25 '18 at 20:43









Bram28

63.2k44793




63.2k44793










asked Dec 12 '18 at 6:06









Dike DokeDike Doke

13




13








  • 1




    $begingroup$
    Welcome to math.SE!! Please use MathJax to render the math correctly. Also, could you tell us what have you tried please?
    $endgroup$
    – manooooh
    Dec 12 '18 at 6:09






  • 1




    $begingroup$
    The $Rightarrow$-side is quite easy to prove, since there are only two cases. So I would approach this by splitting the proof up to $Rightarrow$ and $Leftarrow$.
    $endgroup$
    – Matti P.
    Dec 12 '18 at 6:14










  • $begingroup$
    @manooooh As far as the proof goes, I only showed n being an even integer, while the second part, where n^4 is divisible by 2, I did not understand if the second part is acting like a condition for the first part of the statement. Just confused on the "if and only if" i guess.
    $endgroup$
    – Dike Doke
    Dec 12 '18 at 6:22














  • 1




    $begingroup$
    Welcome to math.SE!! Please use MathJax to render the math correctly. Also, could you tell us what have you tried please?
    $endgroup$
    – manooooh
    Dec 12 '18 at 6:09






  • 1




    $begingroup$
    The $Rightarrow$-side is quite easy to prove, since there are only two cases. So I would approach this by splitting the proof up to $Rightarrow$ and $Leftarrow$.
    $endgroup$
    – Matti P.
    Dec 12 '18 at 6:14










  • $begingroup$
    @manooooh As far as the proof goes, I only showed n being an even integer, while the second part, where n^4 is divisible by 2, I did not understand if the second part is acting like a condition for the first part of the statement. Just confused on the "if and only if" i guess.
    $endgroup$
    – Dike Doke
    Dec 12 '18 at 6:22








1




1




$begingroup$
Welcome to math.SE!! Please use MathJax to render the math correctly. Also, could you tell us what have you tried please?
$endgroup$
– manooooh
Dec 12 '18 at 6:09




$begingroup$
Welcome to math.SE!! Please use MathJax to render the math correctly. Also, could you tell us what have you tried please?
$endgroup$
– manooooh
Dec 12 '18 at 6:09




1




1




$begingroup$
The $Rightarrow$-side is quite easy to prove, since there are only two cases. So I would approach this by splitting the proof up to $Rightarrow$ and $Leftarrow$.
$endgroup$
– Matti P.
Dec 12 '18 at 6:14




$begingroup$
The $Rightarrow$-side is quite easy to prove, since there are only two cases. So I would approach this by splitting the proof up to $Rightarrow$ and $Leftarrow$.
$endgroup$
– Matti P.
Dec 12 '18 at 6:14












$begingroup$
@manooooh As far as the proof goes, I only showed n being an even integer, while the second part, where n^4 is divisible by 2, I did not understand if the second part is acting like a condition for the first part of the statement. Just confused on the "if and only if" i guess.
$endgroup$
– Dike Doke
Dec 12 '18 at 6:22




$begingroup$
@manooooh As far as the proof goes, I only showed n being an even integer, while the second part, where n^4 is divisible by 2, I did not understand if the second part is acting like a condition for the first part of the statement. Just confused on the "if and only if" i guess.
$endgroup$
– Dike Doke
Dec 12 '18 at 6:22










2 Answers
2






active

oldest

votes


















1












$begingroup$

A number $n$ is divisible by two if and only if $n$ is even $ldots$ equivalently, $n$ is even if and only if $n=2k$ for some $k$.



Now suppose that $n$ is even then $n=2k$ for some $k$ , so



$$n^4 = (2k)^4 = 2^4k^4 = 2cdot2^3cdot k^4 = 2cdot K$$



where $K=2^3cdot k^4$. Therefore, $n^4$ is even and hence divisible by two. Conversely, suppose $n^4$ is divisible by $2$ but that $n$ were odd. Then repeating the previous we get that $n=2k+1$ for some $k$ and hence that
$$n^4 = (2k+1)^4 =
16 k^4 + 32 k^3 + 24 k^2 + 8 k + 1 = 2K+1$$



where $K=8k^4 + 16k^3+24k^2+4k$, but then $n^4$ would be odd and hence not divisible by two (a contradiction).



Notice: This second half of the proof is essentially proof by contraposition but I sort of artificially made it a proof by contradiction (because usually people new to proofs find these easier to follow).






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Quick question: so the K for when n is odd will be (8k^3+16k^3+12k^2+4k) and to show 2K+1 for the second part of the proof?
    $endgroup$
    – Dike Doke
    Dec 12 '18 at 6:32












  • $begingroup$
    I've edited my answer to address this question.
    $endgroup$
    – Squirtle
    Dec 12 '18 at 17:54










  • $begingroup$
    Dike Doke.... also you should know that this question is not about "formal proofs" since it is not using formal logic. In the future, when you ask questions you ought to include your attempt at the problem.
    $endgroup$
    – Squirtle
    Dec 12 '18 at 17:55



















0












$begingroup$

One approach is to prove a more general result, of which your theorem is just a specific instance. That is, let's prove that in general:



$forall n in mathbb{Z}, forall p in mathbb{N}^+: n$ is divisible by $2
iff n^p$ is divisible by $2$



This we can prove by induction on $p$:



Base:



$p=1$.



We have to show that:



$$n text{ is divisible by } 2
iff n^1 text{ is divisible by }2$$



Well, that is trivially true, since $n^1=n$



Step:



Thye inductive hypothesis is that for some $k in mathbb{N}^+$, we have that:



$$n text{ is divisible by } 2
iff n^k text{ is divisible by }2$$



Now we need to show that:



$$n text{ is divisible by } 2
iff n^{k+1} text{ is divisible by }2$$



We would prove this if we can prove the following two things:



$$n text{ is divisible by } 2
Rightarrow n^{k+1} text{ is divisible by }2$$



and



$$n text{ is not divisible by } 2
Rightarrow n^{k+1} text{ is not divisible by }2$$



The first half: If $n$ is divisible by $2$, then by inductive hypothesis $n^k$ is divisible by $2$ as well, and hence $n$ and $n^k$ are both even. But the product of two even numbers is even, and hence $n^{k+1}=n cdot n^k$ is even as well



Second half: If $n$ is not divisible by $2$, then by inductive hypothesis $n^k$ is not divisible by $2$ either. Hence, they are both odd. But the product of two odd numbers is odd, and hence $n^{k+1}=n cdot n^k$ is odd as well, and thus not divisible by $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%2f3036299%2ffor-all-integers-of-n-n-is-divisible-by-2-iff-n4-is-divisible-by-2%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









    1












    $begingroup$

    A number $n$ is divisible by two if and only if $n$ is even $ldots$ equivalently, $n$ is even if and only if $n=2k$ for some $k$.



    Now suppose that $n$ is even then $n=2k$ for some $k$ , so



    $$n^4 = (2k)^4 = 2^4k^4 = 2cdot2^3cdot k^4 = 2cdot K$$



    where $K=2^3cdot k^4$. Therefore, $n^4$ is even and hence divisible by two. Conversely, suppose $n^4$ is divisible by $2$ but that $n$ were odd. Then repeating the previous we get that $n=2k+1$ for some $k$ and hence that
    $$n^4 = (2k+1)^4 =
    16 k^4 + 32 k^3 + 24 k^2 + 8 k + 1 = 2K+1$$



    where $K=8k^4 + 16k^3+24k^2+4k$, but then $n^4$ would be odd and hence not divisible by two (a contradiction).



    Notice: This second half of the proof is essentially proof by contraposition but I sort of artificially made it a proof by contradiction (because usually people new to proofs find these easier to follow).






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      Quick question: so the K for when n is odd will be (8k^3+16k^3+12k^2+4k) and to show 2K+1 for the second part of the proof?
      $endgroup$
      – Dike Doke
      Dec 12 '18 at 6:32












    • $begingroup$
      I've edited my answer to address this question.
      $endgroup$
      – Squirtle
      Dec 12 '18 at 17:54










    • $begingroup$
      Dike Doke.... also you should know that this question is not about "formal proofs" since it is not using formal logic. In the future, when you ask questions you ought to include your attempt at the problem.
      $endgroup$
      – Squirtle
      Dec 12 '18 at 17:55
















    1












    $begingroup$

    A number $n$ is divisible by two if and only if $n$ is even $ldots$ equivalently, $n$ is even if and only if $n=2k$ for some $k$.



    Now suppose that $n$ is even then $n=2k$ for some $k$ , so



    $$n^4 = (2k)^4 = 2^4k^4 = 2cdot2^3cdot k^4 = 2cdot K$$



    where $K=2^3cdot k^4$. Therefore, $n^4$ is even and hence divisible by two. Conversely, suppose $n^4$ is divisible by $2$ but that $n$ were odd. Then repeating the previous we get that $n=2k+1$ for some $k$ and hence that
    $$n^4 = (2k+1)^4 =
    16 k^4 + 32 k^3 + 24 k^2 + 8 k + 1 = 2K+1$$



    where $K=8k^4 + 16k^3+24k^2+4k$, but then $n^4$ would be odd and hence not divisible by two (a contradiction).



    Notice: This second half of the proof is essentially proof by contraposition but I sort of artificially made it a proof by contradiction (because usually people new to proofs find these easier to follow).






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      Quick question: so the K for when n is odd will be (8k^3+16k^3+12k^2+4k) and to show 2K+1 for the second part of the proof?
      $endgroup$
      – Dike Doke
      Dec 12 '18 at 6:32












    • $begingroup$
      I've edited my answer to address this question.
      $endgroup$
      – Squirtle
      Dec 12 '18 at 17:54










    • $begingroup$
      Dike Doke.... also you should know that this question is not about "formal proofs" since it is not using formal logic. In the future, when you ask questions you ought to include your attempt at the problem.
      $endgroup$
      – Squirtle
      Dec 12 '18 at 17:55














    1












    1








    1





    $begingroup$

    A number $n$ is divisible by two if and only if $n$ is even $ldots$ equivalently, $n$ is even if and only if $n=2k$ for some $k$.



    Now suppose that $n$ is even then $n=2k$ for some $k$ , so



    $$n^4 = (2k)^4 = 2^4k^4 = 2cdot2^3cdot k^4 = 2cdot K$$



    where $K=2^3cdot k^4$. Therefore, $n^4$ is even and hence divisible by two. Conversely, suppose $n^4$ is divisible by $2$ but that $n$ were odd. Then repeating the previous we get that $n=2k+1$ for some $k$ and hence that
    $$n^4 = (2k+1)^4 =
    16 k^4 + 32 k^3 + 24 k^2 + 8 k + 1 = 2K+1$$



    where $K=8k^4 + 16k^3+24k^2+4k$, but then $n^4$ would be odd and hence not divisible by two (a contradiction).



    Notice: This second half of the proof is essentially proof by contraposition but I sort of artificially made it a proof by contradiction (because usually people new to proofs find these easier to follow).






    share|cite|improve this answer











    $endgroup$



    A number $n$ is divisible by two if and only if $n$ is even $ldots$ equivalently, $n$ is even if and only if $n=2k$ for some $k$.



    Now suppose that $n$ is even then $n=2k$ for some $k$ , so



    $$n^4 = (2k)^4 = 2^4k^4 = 2cdot2^3cdot k^4 = 2cdot K$$



    where $K=2^3cdot k^4$. Therefore, $n^4$ is even and hence divisible by two. Conversely, suppose $n^4$ is divisible by $2$ but that $n$ were odd. Then repeating the previous we get that $n=2k+1$ for some $k$ and hence that
    $$n^4 = (2k+1)^4 =
    16 k^4 + 32 k^3 + 24 k^2 + 8 k + 1 = 2K+1$$



    where $K=8k^4 + 16k^3+24k^2+4k$, but then $n^4$ would be odd and hence not divisible by two (a contradiction).



    Notice: This second half of the proof is essentially proof by contraposition but I sort of artificially made it a proof by contradiction (because usually people new to proofs find these easier to follow).







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited Dec 12 '18 at 17:53

























    answered Dec 12 '18 at 6:14









    SquirtleSquirtle

    4,1941741




    4,1941741












    • $begingroup$
      Quick question: so the K for when n is odd will be (8k^3+16k^3+12k^2+4k) and to show 2K+1 for the second part of the proof?
      $endgroup$
      – Dike Doke
      Dec 12 '18 at 6:32












    • $begingroup$
      I've edited my answer to address this question.
      $endgroup$
      – Squirtle
      Dec 12 '18 at 17:54










    • $begingroup$
      Dike Doke.... also you should know that this question is not about "formal proofs" since it is not using formal logic. In the future, when you ask questions you ought to include your attempt at the problem.
      $endgroup$
      – Squirtle
      Dec 12 '18 at 17:55


















    • $begingroup$
      Quick question: so the K for when n is odd will be (8k^3+16k^3+12k^2+4k) and to show 2K+1 for the second part of the proof?
      $endgroup$
      – Dike Doke
      Dec 12 '18 at 6:32












    • $begingroup$
      I've edited my answer to address this question.
      $endgroup$
      – Squirtle
      Dec 12 '18 at 17:54










    • $begingroup$
      Dike Doke.... also you should know that this question is not about "formal proofs" since it is not using formal logic. In the future, when you ask questions you ought to include your attempt at the problem.
      $endgroup$
      – Squirtle
      Dec 12 '18 at 17:55
















    $begingroup$
    Quick question: so the K for when n is odd will be (8k^3+16k^3+12k^2+4k) and to show 2K+1 for the second part of the proof?
    $endgroup$
    – Dike Doke
    Dec 12 '18 at 6:32






    $begingroup$
    Quick question: so the K for when n is odd will be (8k^3+16k^3+12k^2+4k) and to show 2K+1 for the second part of the proof?
    $endgroup$
    – Dike Doke
    Dec 12 '18 at 6:32














    $begingroup$
    I've edited my answer to address this question.
    $endgroup$
    – Squirtle
    Dec 12 '18 at 17:54




    $begingroup$
    I've edited my answer to address this question.
    $endgroup$
    – Squirtle
    Dec 12 '18 at 17:54












    $begingroup$
    Dike Doke.... also you should know that this question is not about "formal proofs" since it is not using formal logic. In the future, when you ask questions you ought to include your attempt at the problem.
    $endgroup$
    – Squirtle
    Dec 12 '18 at 17:55




    $begingroup$
    Dike Doke.... also you should know that this question is not about "formal proofs" since it is not using formal logic. In the future, when you ask questions you ought to include your attempt at the problem.
    $endgroup$
    – Squirtle
    Dec 12 '18 at 17:55











    0












    $begingroup$

    One approach is to prove a more general result, of which your theorem is just a specific instance. That is, let's prove that in general:



    $forall n in mathbb{Z}, forall p in mathbb{N}^+: n$ is divisible by $2
    iff n^p$     is divisible by $2$



    This we can prove by induction on $p$:



    Base:



    $p=1$.



    We have to show that:



    $$n text{ is divisible by } 2
    iff n^1 text{ is divisible by }2$$



    Well, that is trivially true, since $n^1=n$



    Step:



    Thye inductive hypothesis is that for some $k in mathbb{N}^+$, we have that:



    $$n text{ is divisible by } 2
    iff n^k text{ is divisible by }2$$



    Now we need to show that:



    $$n text{ is divisible by } 2
    iff n^{k+1} text{ is divisible by }2$$



    We would prove this if we can prove the following two things:



    $$n text{ is divisible by } 2
    Rightarrow n^{k+1} text{ is divisible by }2$$



    and



    $$n text{ is not divisible by } 2
    Rightarrow n^{k+1} text{ is not divisible by }2$$



    The first half: If $n$ is divisible by $2$, then by inductive hypothesis $n^k$ is divisible by $2$ as well, and hence $n$ and $n^k$ are both even. But the product of two even numbers is even, and hence $n^{k+1}=n cdot n^k$ is even as well



    Second half: If $n$ is not divisible by $2$, then by inductive hypothesis $n^k$ is not divisible by $2$ either. Hence, they are both odd. But the product of two odd numbers is odd, and hence $n^{k+1}=n cdot n^k$ is odd as well, and thus not divisible by $2$






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      One approach is to prove a more general result, of which your theorem is just a specific instance. That is, let's prove that in general:



      $forall n in mathbb{Z}, forall p in mathbb{N}^+: n$ is divisible by $2
      iff n^p$       is divisible by $2$



      This we can prove by induction on $p$:



      Base:



      $p=1$.



      We have to show that:



      $$n text{ is divisible by } 2
      iff n^1 text{ is divisible by }2$$



      Well, that is trivially true, since $n^1=n$



      Step:



      Thye inductive hypothesis is that for some $k in mathbb{N}^+$, we have that:



      $$n text{ is divisible by } 2
      iff n^k text{ is divisible by }2$$



      Now we need to show that:



      $$n text{ is divisible by } 2
      iff n^{k+1} text{ is divisible by }2$$



      We would prove this if we can prove the following two things:



      $$n text{ is divisible by } 2
      Rightarrow n^{k+1} text{ is divisible by }2$$



      and



      $$n text{ is not divisible by } 2
      Rightarrow n^{k+1} text{ is not divisible by }2$$



      The first half: If $n$ is divisible by $2$, then by inductive hypothesis $n^k$ is divisible by $2$ as well, and hence $n$ and $n^k$ are both even. But the product of two even numbers is even, and hence $n^{k+1}=n cdot n^k$ is even as well



      Second half: If $n$ is not divisible by $2$, then by inductive hypothesis $n^k$ is not divisible by $2$ either. Hence, they are both odd. But the product of two odd numbers is odd, and hence $n^{k+1}=n cdot n^k$ is odd as well, and thus not divisible by $2$






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        One approach is to prove a more general result, of which your theorem is just a specific instance. That is, let's prove that in general:



        $forall n in mathbb{Z}, forall p in mathbb{N}^+: n$ is divisible by $2
        iff n^p$         is divisible by $2$



        This we can prove by induction on $p$:



        Base:



        $p=1$.



        We have to show that:



        $$n text{ is divisible by } 2
        iff n^1 text{ is divisible by }2$$



        Well, that is trivially true, since $n^1=n$



        Step:



        Thye inductive hypothesis is that for some $k in mathbb{N}^+$, we have that:



        $$n text{ is divisible by } 2
        iff n^k text{ is divisible by }2$$



        Now we need to show that:



        $$n text{ is divisible by } 2
        iff n^{k+1} text{ is divisible by }2$$



        We would prove this if we can prove the following two things:



        $$n text{ is divisible by } 2
        Rightarrow n^{k+1} text{ is divisible by }2$$



        and



        $$n text{ is not divisible by } 2
        Rightarrow n^{k+1} text{ is not divisible by }2$$



        The first half: If $n$ is divisible by $2$, then by inductive hypothesis $n^k$ is divisible by $2$ as well, and hence $n$ and $n^k$ are both even. But the product of two even numbers is even, and hence $n^{k+1}=n cdot n^k$ is even as well



        Second half: If $n$ is not divisible by $2$, then by inductive hypothesis $n^k$ is not divisible by $2$ either. Hence, they are both odd. But the product of two odd numbers is odd, and hence $n^{k+1}=n cdot n^k$ is odd as well, and thus not divisible by $2$






        share|cite|improve this answer









        $endgroup$



        One approach is to prove a more general result, of which your theorem is just a specific instance. That is, let's prove that in general:



        $forall n in mathbb{Z}, forall p in mathbb{N}^+: n$ is divisible by $2
        iff n^p$         is divisible by $2$



        This we can prove by induction on $p$:



        Base:



        $p=1$.



        We have to show that:



        $$n text{ is divisible by } 2
        iff n^1 text{ is divisible by }2$$



        Well, that is trivially true, since $n^1=n$



        Step:



        Thye inductive hypothesis is that for some $k in mathbb{N}^+$, we have that:



        $$n text{ is divisible by } 2
        iff n^k text{ is divisible by }2$$



        Now we need to show that:



        $$n text{ is divisible by } 2
        iff n^{k+1} text{ is divisible by }2$$



        We would prove this if we can prove the following two things:



        $$n text{ is divisible by } 2
        Rightarrow n^{k+1} text{ is divisible by }2$$



        and



        $$n text{ is not divisible by } 2
        Rightarrow n^{k+1} text{ is not divisible by }2$$



        The first half: If $n$ is divisible by $2$, then by inductive hypothesis $n^k$ is divisible by $2$ as well, and hence $n$ and $n^k$ are both even. But the product of two even numbers is even, and hence $n^{k+1}=n cdot n^k$ is even as well



        Second half: If $n$ is not divisible by $2$, then by inductive hypothesis $n^k$ is not divisible by $2$ either. Hence, they are both odd. But the product of two odd numbers is odd, and hence $n^{k+1}=n cdot n^k$ is odd as well, and thus not divisible by $2$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 25 '18 at 21:21









        Bram28Bram28

        63.2k44793




        63.2k44793






























            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%2f3036299%2ffor-all-integers-of-n-n-is-divisible-by-2-iff-n4-is-divisible-by-2%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

            Plaza Victoria

            Image
            Plaza Victoria Plaza Victoria en 2017 Otros nombres Plaza de La Victoria Localización El Almendral, Valparaíso, Chile Vías adyacentes Chacabuco, Molina, Plaza Victoria y Edwards Creación 1841 Metro Bellavista Ubicación 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 Coordenadas: 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 [editar datos en Wikidata] La Plaza Victoria , también llamada Plaza de la Victoria , [ 1 ] ​ es una plaza ubicada en el sector El Almendral del plan de la ciudad de Valparaíso, Chile, de importancia patrimonial, que incluye valiosas estatuas y especies vegetales. [ 2 ] ​ La plaza se creó como tal en la primera mitad del siglo XIX, tomando previamente los nombres de Plaza Nueva y Plaza de Orrego . Si bien desde sus inicios tuvo relevancia histórica, no fue sino a partir de fines de los años 1860 cuando comenzó a cobrar mayor importancia y se convirtió en uno de los principales centros sociales de l...
            Read more

            Puebla de Zaragoza

            Image
            Para otros usos de este término, véase Puebla (desambiguación). Heroica Puebla de Zaragoza Localidad De arriba a abajo de izquierda a derecha: Estrella de Puebla, Volcán Popocatépetl, Catedral de Puebla, Monumento a Ignacio Zaragoza, Estadio Cuauhtémoc, Angelópolis y Vista panorámica de la ciudad. Escudo Otros nombres: El relicario de América/ La ciudad de los Ángeles/ La Angelópolis Lema: Muy noble y muy leal ciudad de Puebla de los Ángeles Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en México Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en Puebla Mapa interactivo Coordenadas 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Coordenadas: 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Idioma oficial Español Entidad Localidad  • País   México  • Estado Puebla  • Municipio Puebla Presidente municipal Claudia Rivera Vivanc...
            Read more

            Musa

            Image
            Para el género de plantas, véase Musa (planta). Apolo y la Nueve Musas En la mitología griega, las musas (en griego antiguo μοῦσαι « mousai» ) son, según los escritores más antiguos, las divinidades inspiradoras de las Artes: cada una de ellas está relacionada con ramas artísticas y del conocimiento. Son hijas de Zeus y de Mnemósine, compañeras del séquito de Apolo, dios olímpico de la música y patrón de las bellas artes, quien tuvo romances con cada una de ellas, dejando descendientes. Bajaban a la tierra a susurrar ideas e inspirar a aquellos mortales que las invocaran. En la época más arcaica eran las ninfas inspiradoras de las fuentes, en las cuales eran adoradas. Finalmente, alrededor de los siglos VIII-VII a. C. [ 1 ] ​ prevaleció en todo el territorio de la Hélade la adoración de las nueve Musas, que son Calíope, Clío, Erato, Euterpe, Melpómene, Polimnia, Talía, Terpsícore y Urania. El culto a las musas era originalmente de Tracia y Beocia, y fueron de vital impo...
            Read more