इस पर अटक गए? इसे AI से हल करें
Arithmetic · real student question

The fractions 2/3, 5/8, 8/13, 11/18, ... follow a fixed pattern. One later term of the pattern is X/253 and another is 1499/Y. Find the greatest common divisor of X and Y.

Question

The fractions

23, 58, 813, 1118, …, X253, …, 1499Y\frac{2}{3},\ \frac{5}{8},\ \frac{8}{13},\ \frac{11}{18},\ \ldots,\ \frac{X}{253},\ \ldots,\ \frac{1499}{Y}

follow a fixed pattern. Find the greatest common divisor of XX and YY.

Step-by-step solution

  1. Treat the numerators and denominators as two separate sequences. They do not interact, so each can be described on its own. Numerators 2,5,8,11,…2,5,8,11,\dots rise by 33; denominators 3,8,13,18,…3,8,13,18,\dots rise by 55. Both are arithmetic.

  2. Write a formula for the nn-th term of each. Using first+d(n−1)\text{first}+d(n-1):

    numerator=2+3(n−1)=3n−1,denominator=3+5(n−1)=5n−2\text{numerator}=2+3(n-1)=3n-1,\qquad \text{denominator}=3+5(n-1)=5n-2

    Spot-check at n=4n=4: 3(4)−1=113(4)-1=11 and 5(4)−2=185(4)-2=18, matching 1118\tfrac{11}{18}.

  3. Locate the term whose denominator is 253. Solving 5n−2=2535n-2=253 gives n=51n=51 — an integer, so this term really does belong to the pattern. Its numerator is

    X=3(51)−1=152X=3(51)-1=152

  4. Locate the term whose numerator is 1499. Solving 3n−1=14993n-1=1499 gives n=500n=500, again an integer. Its denominator is

    Y=5(500)−2=2498Y=5(500)-2=2498

  5. Factor both numbers before taking the GCD. Guessing is unsafe with a four-digit number:

    152=23×19,2498=2×1249152=2^3\times 19,\qquad 2498=2\times 1249

    and 12491249 is prime (it is divisible by no prime up to 3535).

  6. Take the common part. The only shared prime is 22, appearing once in 24982498, so

    gcd⁡(152, 2498)=2\gcd(152,\,2498)=2

    The Euclidean algorithm agrees: 2498=16⋅152+662498=16\cdot152+66, 152=2⋅66+20152=2\cdot66+20, 66=3⋅20+666=3\cdot20+6, 20=3⋅6+220=3\cdot6+2, 6=3⋅2+06=3\cdot2+0.

Answer

X=152,Y=2498,gcd⁡(X,Y)=2X=152,\quad Y=2498,\quad \gcd(X,Y)=2

Need to solve a different problem like this? Open the solver →