Why is one example not sufficient to prove m+n≠10 for all integers?

  • Thread starter Thread starter ver_mathstats
  • Start date Start date
  • Tags Tags
    Example Proofs
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
Sign up Log in
2 replies · 2K views
ver_mathstats
Messages
258
Reaction score
21

Homework Statement


Suppose you are asked to prove that for all integers m and n, m+n≠10. You give the example m=1 and n=2. Why is this not sufficient?

Homework Equations

The Attempt at a Solution


I can't quite understand why it is not sufficient? Could someone please explain to me why is it insufficient?
 
Physics news on Phys.org

Discussion

ver_mathstats said:

Homework Statement


Suppose you are asked to prove that for all integers m and n, m+n≠10. You give the example m=1 and n=2. Why is this not sufficient?

Homework Equations

The Attempt at a Solution


I can't quite understand why it is not sufficient? Could someone please explain to me why is it insufficient?
What do you mean? ##m+n\neq 10## isn't true for some integers. It is sufficient to say ##4+6=10## in order to disprove it. As it cannot be proven, there cannot be a sufficient condition for a proof either.

An example is never sufficient to prove an all quantifier, only to disprove one.
 
Put slightly differently, you are asked to show that no integers n and m exist that satisfy n+m = 10. Then it is not enough to give a single example of integers that do not sum to 10 as another pair of integers could do that (and does).