1.3 Well Ordering Principle | 1.3 Well Ordering Principle | Unit 1: Proofs | Mathematics for Computer Science | Electrical Engineering and Computer Science

<Well Ordering Principle 3: Video
1.3.1Well Ordering Principle 1: Video
1.3.2Domain for Well Ordering Principle
1.3.3Well Ordering Principle 2: Video
1.3.4Well Ordering Proofs and Counterexamples
1.3.5Well Ordering Principle 3: Video
1.3.6WOP Proof for Geometric Sum
1.3.7Well Ordering Principle - Examples
1.3.8A Bogus Well Ordering Principle Proof
>Well Ordering Principle - Examples

WOP Proof for Geometric Sum

In Well Ordering Proofs, first we assume that there is a nonempty set $C$ of counterexamples and that $m$ is the smallest element of $C$ . Then we reach a contradiction.

What was the contradiction in the proof for the closed expression of the sum of a geometric series?