Providing a Proof for the Termination of Euclid Algorithm in CSC 490 Fall 2006 - Prof. Gar, Assignments of Computer Science

CSC 490 – Computer Science Senior Seminar I Professor Gary

Locklair

Written Homework Assignment #2 Fall

2006

Chapter 10 in The New Turing Omnibus – Program Correctness

assignment: A. Using the same techniques outlined in the chapter, provide a

proof that the “Euclid” algorithm terminates for all inputs satisfying the

initial conditions.

{15 points}

Chapter 10 in The New Turing Omnibus – Program Correctness

assignment: A. Using the same techniques outlined in the chapter, provide a

proof that the “Euclid” algorithm terminates for all inputs satisfying the

initial conditions.

{15 points}

Use appropriate assertions and prove them inductively. Please word-process

or neatly write your answers.