EmojiKaomoji

Number Theory · divisibility

Euclidean Algorithm Relation Formula

Reduces a greatest-common-divisor calculation.

gcd(a,b) = gcd(b, a mod b)

Variables

a, b
integers
b
nonzero divisor

Reference details

Subject
Number Theory
Topic
divisibility
Plain text
gcd(a,b)=gcd(b,a mod b)

Your privacy

Privacy settings

Essential site features work without optional analytics. Optional analytics is currently disabled site-wide and remains off unless both you consent and the owner later enables the verified service.

Essential storage

Used for choices you make on this device, such as theme, favorites, and this privacy preference. It cannot be switched off here.

Always available

This preference panel is not a Google-certified consent management platform and does not authorize advertising. Future advertising in applicable regions requires separate certified CMP configuration.