实数的GCD求解咨询：已知整数GCD求法，能否计算有理数、无理数的GCD？

Great question! Since you already have a solid handle on integer GCDs, let’s break down how this concept translates to rational and irrational numbers.

Absolutely, we can compute the GCD of two rational numbers—we just need to extend the integer GCD definition a bit. Here's how:

• Rewrite the rationals in simplest form: Let’s say we have two rational numbers ( \frac{a}{b} ) and ( \frac{c}{d} ), where ( a, b, c, d ) are integers, ( b, d > 0 ), and ( \gcd(a,b) = 1 ), ( \gcd(c,d) = 1 ).
• Compute numerator and denominator separately:
  • The numerator of the GCD will be the GCD of the fractions' numerators: ( \gcd(a, c) )
  • The denominator of the GCD will be the least common multiple (LCM) of the fractions' denominators: ( \text{lcm}(b, d) )
• Combine the results: The GCD of ( \frac{a}{b} ) and ( \frac{c}{d} ) is ( \frac{\gcd(a,c)}{\text{lcm}(b,d)} )

Example #

Take ( \frac{3}{4} ) and ( \frac{9}{10} ):

• ( \gcd(3,9) = 3 )
• ( \text{lcm}(4,10) = 20 )
• Their GCD is ( \frac{3}{20} )

To verify: ( \frac{3/4}{3/20} = 5 ) (integer) and ( \frac{9/10}{3/20} = 6 ) (integer), and no larger rational number divides both fractions evenly.

The core idea here is scaling rationals to integers, computing their GCD, then scaling back down—this works because rational numbers form a field where multiplying/dividing by non-zero integers preserves divisibility rules.

This is where things get tricky—in most cases, the GCD of two irrational numbers isn't defined, or doesn't exist in a meaningful way. Here's why:

First, we need to clarify what "divisibility" would mean for irrationals. If we follow the integer/rational definition (a number ( g ) divides ( x ) if ( x/g ) is an integer):

• For trivial pairs like ( \sqrt{2} ) and ( 2\sqrt{2} ), you could argue ( \sqrt{2} ) is a GCD (since ( 2\sqrt{2}/\sqrt{2} = 2 ), an integer). But this only applies when one irrational is an integer multiple of the other.
• For most pairs (e.g., ( \sqrt{2} ) and ( \sqrt{3} )), no such ( g ) exists. Suppose it did: ( \sqrt{2} = m \cdot g ) and ( \sqrt{3} = n \cdot g ) for integers ( m,n ). Then ( \sqrt{2}/\sqrt{3} = m/n ), implying ( \sqrt{6} ) is rational—a contradiction, since ( \sqrt{6} ) is irrational.

Even if we relax the definition to allow ( x/g ) to be rational, there's no "greatest" such ( g ): if ( g ) works, then ( 2g ) would also work (since ( x/(2g) = (x/g)/2 ), which is rational if ( x/g ) is). There's no upper bound here, so the concept of a "greatest" common divisor falls apart.

In short, GCD relies on the unique factorization structure of integers, which doesn't extend nicely to irrational numbers in a way that preserves the "greatest" and "divisor" properties we care about.

内容的提问来源于stack exchange，提问作者user529392