There exists an integer k such that $n = 3k+1$. Then $n^2 = (3k+1)^2 =9k^2 + 6k + 1 = 3 (3k2 +2k)+1$.

1,003

enter image description hereQuestion has been answered in the comments by JMoravitz.

Share:
1,003

Related videos on Youtube

Hidaw
Author by

Hidaw

Updated on April 10, 2020

Comments

  • Hidaw
    Hidaw over 3 years

    Consider the following proof fragment.

    There exists an integer $k$ such that $n = 3k+1$.

    Then $n^2 = (3k+1)^2 =9k^2 + 6k + 1 = 3 (3k^2 +2k)+1$.

    For each of the statements, $(a), (b), (c)$, below, answer the following.

    Does the fragment provide a proof of the statement? If yes, explain why. If no, explain why not. The letter n denotes an integer.

    (a) If $n$ is odd, then $n^2$ is odd.

    (b) If $n^2$ is divisible by $3$, then $n$ is divisible by $3$.

    (c) If $n$ leaves remainder $1$ on division by $3$, then so does $n^2$.

    I am having some trouble understanding the question. I have started a) by assuming $n$ is odd and I took $n=3k+1$ and then I showed that $n^2=(3k+1)^2=3(3k^2+2k)+1$ and I said that if $n=3k+1$ is odd $3k$ is even so $k$ is even and can be writen as $k=2m$ where $m$ is an integer. After that I sub. $k=2m$ into the $n^2=3(3k^2+2k)+1$ and I find that $n^2=2$(somthing)$+1$ so it is odd.

    I have been told by my Professor that is I should not use the statment given to me to answer $a,b$, and $c$. I was wondering if for $a)$ I am just supposed to take $n=2k+1$ and then show that $n^2$ is odd. Can someone help me out?

    • JMoravitz
      JMoravitz over 6 years
      Read the question more carefully. "Does the fragment provide a proof of the statement _____". Nowhere in the proof fragment does it mention anything about what happens if $n$ is even or odd, nor the implication that $n$ odd implies $n^2$ odd, so the fragment does not provide a proof for this fact (or have anything to do with it at all). They are not asking you to prove those three facts (despite all three being true), just check to see whether or not the excerpt at the top proves them.
    • JMoravitz
      JMoravitz over 6 years
      How about (b) and (c)? Does the proof excerpt mention what happens if $n^2$ is divisible by three? If it does talk about what happens when $n^2$ is divisible by three does it successfully reach the conclusion that $n$ must also be divisible by three? Does the proof excerpt mention what happens if $n$ leaves remainder $1$ when divided by $3$? Does it then successfully reach the conclusion that the remainder of $n^2$ must then also leave remainder $1$ when divided by three?
    • Hidaw
      Hidaw over 6 years
      @JMoravitz thank you so much. That helped a lot! I know what I have to do now:)
    • mrnovice
      mrnovice over 6 years
      @JMoravitz would you consider submitting your comments as an answer?
  • erfink
    erfink over 6 years
    This does not provide an answer to the question. To critique or request clarification from an author, leave a comment below their post. - From Review
  • Hidaw
    Hidaw over 6 years
    @erfink the question has been answered by JMoravitz in the comments above. Since JMoravitz answered in the comments I cannot accept his answer and mark this question as "Answered", so that is the reason I wrote that.
  • Jyrki Lahtonen
    Jyrki Lahtonen over 6 years
    @Flow, we understand why you wrote this. Props for trying to remove the question from the unanswered queue! May be you should have given an annotated summary rather than post a screenshot :-)