September 8th, 2014
N-Body simulation
Optional mathematical proof:
Use mathematical induction to prove that Euclid’s algorithm computes the greatest common divisor of any pair of nonnegative integers p and q.
September 8th, 2014
N-Body simulation
Optional mathematical proof:
Use mathematical induction to prove that Euclid’s algorithm computes the greatest common divisor of any pair of nonnegative integers p and q.