{"version":"1.0","type":"link","title":"Euclidean algorithm - Newikis","description":"In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers, the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/9/96/Euclid%27s_algorithm_Book_VII_Proposition_2_3.svg/1280px-Euclid%27s_algorithm_Book_VII_Proposition_2_3.svg.png","thumbnail_width":1280,"thumbnail_height":1743}