The fractions
follow a fixed pattern. Find the greatest common divisor of and .
Treat the numerators and denominators as two separate sequences. Numerators: increase by each time. Denominators: increase by . Both are arithmetic, so each has a closed form:
Spot check at : and .
Locate the term whose denominator is 305.
That came out a whole number confirms really is in the sequence. Its numerator is
Locate the term whose numerator is 1999.
Factor both numbers before assuming a common divisor.
For , trial division by every prime up to — — leaves a remainder every time, so is prime.
Compute the GCD. Since is prime, the only candidates for a shared factor are and itself, and . Confirming with the Euclidean algorithm:
The two numbers are coprime. (It is tempting to write and conclude the answer is , but , not — a factorisation worth checking by multiplying back.)
Need to solve a different problem like this? Open the solver →