A strictly increasing sequence of positive integers a1, a2, a3, ⋯ has the property that for every positive integer k, the subsequence a2k−1, a2k, a2k+1 is geometric and the subsequence a2k, a2k+1, a2k+2 is arithmetic. Suppose that a13=2016. Find a1.
解析
Solution 1
We first create a similar sequence where a1=1 and a2=2. Continuing the sequence,
1,2,4,6,9,12,16,20,25,30,36,42,49,⋯
Here we can see a pattern; every second term (starting from the first) is a square, and every second term (starting from the third) is the end of a geometric sequence. This can be proven by induction. Similarly, a13 would also need to be the end of a geometric sequence (divisible by a square). We see that 2016 is 25⋅32⋅7, so the squares that would fit in 2016 are 12=1, 22=4, 32=9, 24=16, 22⋅32=36, and 24⋅32=144. By simple inspection 144 is the only plausible square, since the other squares in the sequence don't have enough elements before them to go all the way back to a1 while still staying as positive integers. a13=2016=14⋅144, so a1=14⋅36=504.
~IYN~
Solution 2
Setting a1=a and a2=ka, the sequence becomes:
a,ka,k2a,k(2k−1)a,(2k−1)2a,(2k−1)(3k−2)a,(3k−2)2a,⋯
and so forth, with a2n+1=(nk−(n−1))2a. Then, a13=(6k−5)2a=2016. Keep in mind, k need not be an integer, only k2a,(k+1)2a, etc. does. 2016=25∗32∗7, so only the squares 1,4,9,16,36, and 144 are plausible for (6k−5)2. But when that is anything other than 2, k2a is not an integer. Therefore, a=2016/22=504.
Thanks for reading, Rowechen Zhong.
Solution 3
Instead of setting a1 equal to something and a2 equal to something, note that it is rather easier to set a1=x2 and a3=y2 so that a2=xy,a4=y(2y−x),a5=(2y−x)2 and so on until you reached a13=(6y−5x)2 (Or simply notice the pattern), so 6y−5x=2016=1214. Note that since each of the terms has degree 2 so if you multiply x and y by 14 you multiply each term by 14 so each term is still a integer if the terms are already integers before you multiply x and y by 14, so let w=14x and z=14y so 6z−5w=12. Then, for the sequence to be strictly increasing positive integers we have (w,z)=(6,7) so x=614 and a1=x2=62⋅14=504~Ddk001
Solution 4(very risky and very stupid)
The thirteenth term of the sequence is 2016, which makes that fourteenth term of the sequence 2016+r and the 15th term 2016(2016+r)2. We note that r is an integer so that means 2016r2 is an integer. Thus, we assume the smallest value of r, which is 168. We bash all the way back to the first term and get our answer of 504.
-Pleaseletmewin
Solution 5
Let a2k−1=s where k=1. Then, a2k=sr⟹a2k+1=sr2. Continuing on, we get a2k+2=sr(r−1)+sr2=sr(2r−1)⟹a2k+3=sr2(r2r−1)2=s(2r−1)2. Moreover, a2k+4=s(2r−1)(r−1)+s(2r−1)2=s(2r−1)(3r−2)⟹a2k+5=s(2r−1)2(2r−13r−2)2=s(3r−2)2.
It is clear now that a2k+2c=s(cr−(c−1))((c+1)r−c) and a2k+2c−1=s(cr−(c−1))2. Plugging in c=6, a13=s(6r−5)2=2016. The prime factorization of 2016=25⋅32⋅7 so we look for perfect squares.
6r−5≡(6r−5)2≡1(mod6) if r is an integer, and 6ω+5=r⟹6∣s if r is not an integer and ω is rational, so 6∣s. This forces s=2⋅32⋅7⋅N. Assuming (6r−5) is an integer, it can only be 2x, x∈1,2.
If 6r−5=21, r=67. If 6r−5=22, r=23. Note that the latter cannot work since a2k+1=s(49)⟹4∣s but N=1⟹s=2⋅32⋅7 in this scenario. Therefore, r=67⟹s=222016=504. Plugging back k=1, a1=s=504
~Magnetoninja
Solution 6 (Headache)
Bash all the way from a1 and a2 to a13=2016 to get to the equation a1(a16a2−5)2=2016 and then a2=214a1+65a1 (direct consequence). Notice that from the two equations we can deduce that:
a1∣2016,
6∣a1, and
14a1∈Z.
Since 2016=25⋅32⋅7=14(24⋅32), the only possible values of a1 that satisfy the conditions are 126, 504, and 2016 itself. Obviously 2016 cannot be a correct answer choice (from AIME rules), and if a1=126, a3∈Z, so 504 is the solution.
~eevee9406
Solution 7
Let a11=x. Then, a12=xr and a13=xr2=2016. Note, in order to alternate between arithmetic and geometric sequences, you would want r to be as small as possible so our sequence is always positive as stated in the question. Since 2016=25⋅32⋅7, the smallest ratio, r, (which must be greater than 1 as the sequence is strictly increasing) must satisfy that a12=r2016 and a11=r22016 are both integers. Therefore, r1 can at min be 22⋅3m. To minimize this we have m=11 so r=1112. Doing this and working backwards, we get the sequence a1=504a2=588a3=686a4=784a5=896a6=1008a7=1134a8=1260a9=1400a10=1540a11=1694a12=1848a13=2016 so a1=504 ~Sid-darth-vater