| http://www.w3.org/ns/prov#value | - The greatest common divisor of two numbers a and b is the largest integer that divides the numbers without a remainder. +About 2000 years ago, Euclid, one of the greatest mathematician of Greece, devised a fairly simple and efficient algorithm to determine the greatest common divisor of two integers, which is now considered as one of the most efficient and well-known early algorithms in the world.
|
