0
$\begingroup$

Explain in detail why the following “proof” is incorrect.

Theorem $1$. All positive integers are equal.

Proof. We show that any two positive integers are equal, from which the result follows. We do this by induction on the maximum of the two numbers. Let $P (n)$ be the statement “if $r$ and $s$ are positive integers and max{$r, s$} = $n$ then $r = s$”.

Clearly $P (1)$ is true. Suppose that $P (n)$ is true and let $r, s$ be positive integers whose maximum is $n + 1$. Then max{$r−1,s−1$} = $n$. By the inductive hypothesis, $r−1=s−1$ and hence $r=s$. Thus $P(n+1)$is true.

The result is now proved by mathematical induction.

$\endgroup$

marked as duplicate by dxiv, Em., Patrick Stevens, Mauro ALLEGRANZA, amd May 18 '17 at 6:58

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

  • $\begingroup$ Interestingly, this doesn't quite seem to be the horses question. $\endgroup$ – Patrick Stevens May 18 '17 at 6:32
  • $\begingroup$ $(r-1, s-1)$ may not be positive integers. One or the other may equal 0. $\endgroup$ – Doug M May 18 '17 at 6:37

Browse other questions tagged or ask your own question.