Analyzing the Setup
Imagine standing at the start of a long, perfectly straight path. You are at the first marker, a1=1. Your goal is to reach the n-th marker, an=300.
Between these two points, you are taking consistent, equal steps of size d. This is the essence of an Arithmetic Progression (AP).
The relationship between our start, our end, and our steps is governed by the elegant formula:
This equation is our bridge. It tells us that to get from the first term to the n-th term, we must traverse exactly n−1 intervals of length d.
The Integer Constraint and the Number Theory Trap
When we substitute our known values into the bridge formula, we get 300=1+(n−1)d, which simplifies beautifully to:
Now, here is where the problem tests your mathematical intuition. We have one equation and two unknowns, n and d, but we are given a secret weapon: d is an integer.
This means that (n−1) must be a divisor of 299. To unlock this, we perform a prime factorization of 299. Since 299 is not divisible by 2 or 3, we test higher primes and discover that:
Thus, the possible values for (n−1) are 1,13,23, and 299.
Navigating the Constraints
We are not done yet! We have a range constraint: 15<n<50. If we subtract 1 from all parts of this inequality, we get:
Looking at our list of divisors—1,13,23,299—only one number sits comfortably in that window: 23. This is the moment of clarity.
We now know that n−1=23, which implies n=24. With n in hand, finding d is trivial:
We have successfully decoded the sequence!
The Final Calculation
The question asks for the ordered pair (Sn−4,an−4). Since n=24, we are looking for (S20,a20).
First, let's find the twentieth term, a20. Using our formula ak=a1+(k−1)d, we calculate:
Now, for the sum S20. We use the efficient sum formula:
Substituting our values, we get:
S20=220(1+248)=10(249)=2490
The final result is the ordered pair (2490,248). You have navigated the constraints, applied the number theory, and executed the calculation with precision.