Analyzing the Setup
Arithmetic Progressions (APs) are the heartbeat of sequences. They are predictable, elegant, and deeply structured.
We define the first sequence, an, with a first term a1 and a common difference da. Similarly, the second sequence, bm, has a first term b1 and a common difference db.
The problem provides a vital piece of intelligence: the common difference of the second sequence is
2 more than the first. Mathematically, we capture this as:
db=da+2
Decoding the First Sequence
We are given two data points for the first sequence: a40=−159 and a100=−399. Using the general term formula an=a1+(n−1)da, we construct the following system of linear equations:
a1+39da=−159
a1+99da=−399
To solve this, we subtract the first equation from the second:
(a1+99da)−(a1+39da)=−399−(−159)
60da=−240
Dividing by
60, we find
da=−4. Substituting this back into the first equation:
a1+39(−4)=−159
a1−156=−159
a1=−3
Crossing the Bridge
Now, we return to our bridge equation. Since
db=da+2 and
da=−4, it follows that:
db=−4+2=−2
The problem states that
b100=a70. First, we calculate the value of
a70 using our parameters for the first sequence:
a70=a1+69da
a70=−3+69(−4)=−3−276=−279
The Final Reveal
We equate this result to the hundredth term of the second sequence:
b100=b1+99db=−279
Substituting
db=−2 into the equation:
b1+99(−2)=−279
b1−198=−279
Solving for
b1, we arrive at the final result:
b1=−279+198=−81
The final value is b1=−81.