Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.



Re: [CALCREFORM:3238] induction
Posted:
Sep 21, 2004 11:26 AM


Re: Mark Bridger's request for better induction\wellordering examples.
The three "archetypes" found in most introtoproof texts are 1. Summation\product formulas. 2. Inequalities. 3. Divisibility propositions. Some are useful, most are at least historically interesting. As already pointed out, lack of discovery is common to these examples.
Good sources: _A Transition to Advanced Mathematics_, SmithEggenSt. Andre_ _Chapter Zero_, Carol Schumacher _Introduction to Mathematical Structures_, Steve Galovich
Another collection of very interesting examples have origin in general position arguments and discrete mathematics. Here are a couple of examples:
1. Every partition of the plane by a finite number of straight lines can be twocolored. 2. In a roundrobin tournament (no ties) a _top player_ is a player#1 who, for every other player#2, either beats that player#2 or beats some other player#3 who beats that player#2. Every such tournament with a finite number of players has at a top player. 3. Any 2^nby2^n chessboard with one deleted square can be tiled using 2by2 with one square deleted tiles. 4. A jigsaw puzzle is assembled by successively joining pieces together into blocks. A move is the joining of two pieces to form a block, the joining of a piece to an existing block, and the joining of two exist ing blocks. Every npiece puzzle requires exactly n1 moves.
Although not calculus. I will post this to the group on the odd chance that this of interest to others than just Mark.
Dale M. Rohm



