NotesFAQContact Us
Collection
Advanced
Search Tips
Peer reviewed Peer reviewed
Direct linkDirect link
ERIC Number: EJ858118
Record Type: Journal
Publication Date: 2009
Pages: 7
Abstractor: As Provided
Reference Count: 3
ISBN: N/A
ISSN: ISSN-0020-739X
Iteration, Not Induction
Dobbs, David E.
International Journal of Mathematical Education in Science and Technology, v40 n4 p517-523 2009
The main purpose of this note is to present and justify proof via iteration as an intuitive, creative and empowering method that is often available and preferable as an alternative to proofs via either mathematical induction or the well-ordering principle. The method of iteration depends only on the fact that any strictly decreasing sequence of positive integers must terminate in finitely many steps. Four examples are presented using the method of iteration. These examples concern the factorization of integers or polynomials into products of primes, the calculation of quotients and remainders via the division algorithm (and, hence, of greatest common divisors via the Euclidean Algorithm) and the rank of matrices via elementary row and column operations. We also justify the method of proof by iteration by showing that its validity is a logical consequence of the method of mathematical induction. Various parts of this material would be suitable for courses on Precalculus, Discrete Mathematics, Abstract Algebra or Matrix Theory/Linear Algebra.
Taylor & Francis, Ltd. 325 Chestnut Street Suite 800, Philadelphia, PA 19106. Tel: 800-354-1420; Fax: 215-625-2940; Web site: http://www.tandf.co.uk/journals
Publication Type: Journal Articles; Reports - Descriptive
Education Level: N/A
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A