Disproving an incorrect theorem?

  • Thread starter Thread starter YamiBustamante
  • Start date Start date
  • Tags Tags
    Theorem
Click For Summary
The discussion centers around an incorrect theorem claiming that if x + y = 10, then x cannot be 3 and y cannot be 8. The proof presented is flawed because it incorrectly assumes that showing x = 3 and y = 8 leads to a contradiction, while failing to address the correct negation of the theorem. A counterexample, such as x = 3 and y = 7, demonstrates that the theorem is indeed false, as it satisfies the condition x + y = 10. Clarification on negation reveals that the correct negation is x = 3 or y = 8, not both conditions being false. Ultimately, the confusion is resolved, confirming that the theorem is false from the start.
YamiBustamante
Messages
17
Reaction score
0
Incorrect Theorem:
Suppose x and y are real numbers and x + y = 10, then x != 3 and y != 8.

(a) What’s wrong with the following proof of the theorem?

Proof. Suppose the conclusion of the theorem is false. Then x = 3 and y = 8. But then x + y = 11, which contradicts the given information that x + y = 10. Therefore the conclusion must be true.

(b) Show that the theorem is incorrect by finding a counterexample.So according to the answer it's false because x != 3 can't be proven with x = 3 because that's not the negation, but even so, isn't the theorem true because 3 + 8 = 11 which does contradict the premise... I'm very confused by this...

For b, the counter example was x = 3 and x = 7 but how does that disprove it? I'm still very confused by counter examples.
So would it be written as "Suppose x and y are real numbers and x + y = 10, then x = 3 and y = 7" Is that how the counter example would be written?

Please explain!
 
Physics news on Phys.org
YamiBustamante said:
Proof. Suppose the conclusion of the theorem is false. Then x = 3 and y = 8.

That is not the negation of the theorem.
 
micromass said:
That is not the negation of the theorem.
So the proof is false so therefore the theorem is false or is the theorem already false to begin with, so proof would also be false...
 
micromass said:
That is not the negation of the theorem.
Never mind. I figured it out. Thank you.
 
In the statement, the conclusion is "then ##x \ne 3 \text{ and } y \ne 8##"

The negation of the conclusion is ##x = 3 \text{ or } y = 8##. I believe this is what micromass was alluding to.
 
First trick I learned this one a long time ago and have used it to entertain and amuse young kids. Ask your friend to write down a three-digit number without showing it to you. Then ask him or her to rearrange the digits to form a new three-digit number. After that, write whichever is the larger number above the other number, and then subtract the smaller from the larger, making sure that you don't see any of the numbers. Then ask the young "victim" to tell you any two of the digits of the...

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 24 ·
Replies
24
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K