Euclid Devised an Algorithm For Finding The HCF of Two Numbers.
It Involves Dividing The Higher Number(first) By The Lower Number(second) and Recording The
Remainder.
The Second Number Then Becomes The New First Number and The Remainder Becomes
The New Second Number.
The Process Continues Until a Remainder of Zero is Achieved.
The HCF is The Previous None Zero Remainder. Or if Only One Step, The Lower Number Typed.
Input of Numbers Can Be In Any Order As Code Checks Which is Higher.
Example:- 45 is Entered as 1st Number and 75 as the 2nd Number.
Sums Appear as:-
1st Line:- 75 / 45 = 1 rem 30
2nd Line:- 45 / 30 = 1 rem 15
3rd Line:- 30 / 15 = 2 rem 0
The 3rd line has a ZERO Remainder so the Highest Common Factor of 45 and 75 is the
Remainder from the 2nd Line, Which is 15.
Use Mouse or Tab To Navigate, Large Numbers May Cause The Steps Display To Go Awry,
Have Fun!!.
The Answer is Still Correct, As Long As An Overflow is Not Present.
(Display Showing An Exponent in The Number.. (e+nn)).
Nigel Watson Software. Developed :- January 1999. Enhanced :- October 2003.