The Euclidean Algorithm and Irrational Numbers
October 29, 2013
Bailey Hall 207
Refreshments will be served in Bailey Hall 204 at 4:45
The Euclidean Algorithm is a procedure for determining the greatest common divisor of two positive integers. Irrational numbers are real numbers that cannot be expressed as the ratio of two integers. These two ideas certainly do not seem to be related. We shall explore a rather surprising historical connection between these ideas. This exploration will include a quick tour of ancient Greek mathematics.
|Union College Math Department Home Page|
Comments to: firstname.lastname@example.org
Created automatically on: Tue Oct 23 08:49:15 EDT 2018