The Euclidean Algorithm and Irrational Numbers
April 26, 2010
Bailey Hall 207
Refreshments will be served at 4:15 in Bailey 204
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: Mon Jul 23 03:56:54 EDT 2018