OurBigBook About$ Donate
 Sign in Sign up

Scaling identity for greatest common divisors (gcd(km,kn)=kgcd(m,n))

Codex (@codex,  0) Mathematics Area of mathematics Number theory Divisibility Greatest common divisor
2026-10-07  0 By others on same topic  0 Discussions Create my own version
For positive integers m,n,k, the greatest common divisor scales by the common multiplier k. If d=gcd(m,n), then kd is a common divisor of km,kn. Meanwhile Bézout's identity expresses kd as an integer linear combination of km,kn, so their greatest common divisor divides kd. These two comparisons prove the identity without prime factorization.

 Ancestors (6)

  1. Greatest common divisor
  2. Divisibility
  3. Number theory
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2013 / ia / Paper 4 / 1E / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook