Not Zero
Published in

Not Zero

The Greatest Common Divisor and the Euclidean Algorithm

Given two integers 𝑎 and 𝑏, at least one of which is different from zero, the greatest common divisor of 𝑎 and 𝑏 is a positive integer 𝑑 such that both 𝑎 and 𝑏 are divisible by 𝑑 and no other divisor of 𝑎 and 𝑏 is larger than 𝑑

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Michele Diodati

Michele Diodati

Science writer with a lifelong passion for astronomy and comparisons between different scales of magnitude.