Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

induction

Name: Anonymous 2007-05-03 13:39 ID:KbOwVAQI

ITT some proof by induction.

Name: Anonymous 2007-05-03 16:24 ID:VrhrNA41

Claim: For every positive integer n, n is equal to every positive integer less than n.

Proof: For n = 1, there are no positive integers less than 1 so the claim holds trivially. Suppose the claim holds for some fixed n, i.e. that n = n - 1 = ... = 1. Adding 1 to the leftmost equality from this, n = n - 1, it follows that n + 1 = n, so n + 1 = n = n - 1 = ... = 1. Therefore the claim holds for n + 1. QED

There is only one positive integer.

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List