The fractions
follow a fixed pattern. Find the greatest common divisor of and .
Treat the numerators and denominators as two separate sequences. They do not interact, so each can be described on its own. Numerators rise by ; denominators rise by . Both are arithmetic.
Write a formula for the -th term of each. Using :
Spot-check at : and , matching .
Locate the term whose denominator is 253. Solving gives — an integer, so this term really does belong to the pattern. Its numerator is
Locate the term whose numerator is 1499. Solving gives , again an integer. Its denominator is
Factor both numbers before taking the GCD. Guessing is unsafe with a four-digit number:
and is prime (it is divisible by no prime up to ).
Take the common part. The only shared prime is , appearing once in , so
The Euclidean algorithm agrees: , , , , .
Need to solve a different problem like this? Open the solver →