 The basic principle is that each step of the algorithm reduces "f" inexorably; hence, if can be reduced only a finite number of times, the algorithm must stop in a finite number of steps.This principle relies on the well-ordering property of the non-negative integers, which asserts that every non-empty set of non-negative integers has a smallest member.The fundamental theorem of arithmetic applies to any Euclidean domain