## Euclid's Algorithm, Heron's Algorithm, Calculation of Pi |
||
---|---|---|

Detailed Description:
Problem Description by Hans-Georg Weigand:1.Euclids Algorithm gives you the greatest common divisor oftwo natural numbers. Explain the Euclids Algorithm. Given aretwo number (e. g. 121 and 33), calculate the gcd(121,33). InEXCEL you need the "if-command".2.Herons Algorithm gives you an approximation of an irrationalnumber, e.g. . Explain Herons Algorithm. Do it with Excel.3.Construct an iterated process for calculation p .
Resource Type:
Lesson (Lessons that don't include any sort of interactive component.)
Category:
Related Resources:
None specified yet
| ||

< Back |