|
Euclid's Algorithm, Heron's Algorithm, Calculation of Pi (MSTE)

Library Home ||
Full Table of Contents ||
Suggest a Link ||
Library Help

| http://www.mste.uiuc.edu/courses/ci301fall98/kyte/euclid.html | |
|
|
|
| Kyte, Moore, Finch; University of Illinois at Urbana-Champaign (UIUC) | |
| Problem (by Hans-Georg Weigand): Euclid's Algorithm gives you the greatest common divisor of two natural numbers; explain the algorithm. Given two numbers (e.g. 121 and 33), calculate the gcd(121,33) (in EXCEL you need the "if-command"). Heron's Algorithm gives you an approximation of an irrational number; explain the algorithm and do it with Excel. Construct an iterated process for calculating pi. Download Excel spreadsheets to help solve the problems. | |
|
|
|
| Levels: | High School (9-12) |
| Languages: | English |
| Resource Types: | Lesson Plans and Activities, Documents/Sketches/Galleries, General Software Miscellaneous |
| Math Topics: | Basic Algebra, Pi |
[Privacy Policy] [Terms of Use]


© 1994-2009 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.