Soru

Zorluk: ZorGreatest Common Divisor (GCD) and Least Common Multiple (LCM)

Two positive integers xx and yy satisfy x<yx < y, GCD(x,y)=15\text{GCD}(x, y) = 15, and LCM(x,y)=1,800\text{LCM}(x, y) = 1,800. If xx is not a multiple of 99 and yy is not a multiple of 2525, what is the value of yxy - x?

Cevap: 285

Cevap

The value of yxy - x is 285.
Expressing xx and yy as 15a15a and 15b15b yields ab=120ab = 120. Testing coprime pairs (a,b)(a,b) shows that only (5,24)(5, 24) gives values x=75x = 75 and y=360y = 360 that satisfy both constraints (75 is not a multiple of 9, and 360 is not a multiple of 25). The difference is 36075=285360 - 75 = 285.

Adım Adım Çözüm

1
Set up coprime factor representation
x=15ax = 15a and y=15by = 15b with GCD(a,b)=1\text{GCD}(a, b) = 1 and a<ba < b
Any two numbers can be expressed as their GCD multiplied by coprime integer quotients.
2
Solve for the product of coprime quotient factors aba \cdot b
ab=120a \cdot b = 120
The LCM of two numbers divided by their GCD equals the product of their coprime quotients.
3
Identify candidate coprime pairs (a,b)(a, b)
(1,120),(3,40),(5,24),(8,15)(1, 120), (3, 40), (5, 24), (8, 15)
Since 120=233151120 = 2^3 \cdot 3^1 \cdot 5^1, all prime factor powers must be assigned entirely to either aa or bb to maintain GCD(a,b)=1\text{GCD}(a, b) = 1.
4
Filter pairs using divisibility constraints on xx and yy
Only (75,360)(75, 360) satisfies x≢0(mod9)x \not\equiv 0 \pmod 9 and y≢0(mod25)y \not\equiv 0 \pmod{25}
75=32575 = 3 \cdot 25 (not divisible by 9) and 360=895360 = 8 \cdot 9 \cdot 5 (not divisible by 25).
5
Calculate the target difference yxy - x
285
36075=285360 - 75 = 285.

Anahtar Kavram

Relationship between GCD, LCM, and prime factorization distribution in coprime quotients.
Bu soruyu puanla