1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

What type of proof is this defined as?

  1. Sep 24, 2014 #1
    1. The problem statement, all variables and given/known data
    I have to prove or disprove the following statement.

    The product of an integer and its square is even

    2. Relevant equations
    n2*n
    n = 2k + 1 (Odd integers)


    3. The attempt at a solution
    20140924_144523.jpeg
    I uploaded a photo of my proof. As you can see, I have proved that if n is an odd integer, the product of n squared and n will be odd as well. My question is what type of proof is this? I was thinking it was proof by counterexample but I wasn't sure if the correct terminology would be "disproof by counterexample". Or is it a proof by contradiction? Any help is appretiated : )
     
  2. jcsd
  3. Sep 24, 2014 #2

    Mark44

    Staff: Mentor

    This is a direct proof. You proved the given statement, so what you did is not a disproof. You can't prove a statement by counterexample. To prove an implication by contradiction, you assume the opposite of the conclusion of the implication, and then show that this causes a contradiction.

    BTW, where you show several lines that start with "n * n2 = ", you could just continue the line above using '=' and omit the "n * n2 = " part.
     
  4. Sep 24, 2014 #3

    Fredrik

    User Avatar
    Staff Emeritus
    Science Advisor
    Gold Member

    The problem is asking about the claim "the product of an integer and its square is even". This claim should be interpreted as "For all integers n, ##n n^2## is even". To prove that this statement is false, you only need to find one counterexample, i.e. one integer n such that ##nn^2## is odd.

    What you actually did was to prove the statement "For all odd integers n, ##nn^2## is odd". This is a theorem that you can use to prove that the given statement is false, but you didn't actually say how your theorem implies that the given statement is false, so technically, you haven't completed the proof. The final step is pretty trivial though. All you have to do is to say that your theorem implies that every odd integer is a counterexample that proves the given claim false. You can also be more specific, and say e.g. that your theorem proves that 1 is a counterexample that proves the given claim false. (But you wouldn't actually need your theorem to see that).
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted



Similar Discussions: What type of proof is this defined as?
Loading...