Sequence and series (6)

Algebra Level pending

The sequence { a n } \{a_n\} is given by a 1 = 1 a_1 = 1 and 5 a n + 1 a n = 3 3 n + 2 + 1 5^{a_{n+1} - a_n} = \dfrac{3}{3n+2} + 1 for n 1 n\ge 1 .

Find the smallest integer m > 1 m > 1 such that a m a_m is an integer.

52 31 41 25

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Chew-Seong Cheong
Apr 25, 2020

Given that 5 a n + 1 a n = 3 3 n + 2 + 1 5^{a_{n+1}-a_n} = \dfrac 3{3n+2} + 1 , we have:

5 a n + 1 5 a n = 3 3 n + 2 + 1 Let b k = 5 a k b n + 1 = ( 3 3 n + 2 + 1 ) b n b 2 = ( 3 3 + 2 + 1 ) 5 1 = 3 + 5 = 8 b 3 = ( 3 8 + 1 ) 8 = 3 + 8 = 11 b 4 = ( 3 11 + 1 ) 11 = 3 + 11 = 14 \begin{aligned} \frac {5^{a_{n+1}}}{5^{a_n}} & = \frac 3{3n+2} + 1 & \small \blue{\text{Let }b_k = 5^{a_k}} \\ b_{n+1} & = \left(\frac 3{3n+2} + 1 \right)b_n \\ \implies b_2 & = \left(\frac 3{3+2} + 1 \right)5^1 = 3 + 5 = 8 \\ b_3 & = \left(\frac 3{8} + 1 \right)8 = 3 + 8 = 11 \\ b_4 & = \left(\frac 3{11} + 1 \right)11 = 3 + 11 = 14 \end{aligned}

Therefore, it would appears that b n = 3 ( n 1 ) + 5 = 3 n + 2 b_n = 3(n-1) + 5 = 3n + 2 , which can be easily proven by induction , because b n + 1 = ( 3 3 n + 2 + 1 ) b n = ( 3 3 n + 2 + 1 ) ( 3 n + 2 ) = 3 + 3 n + 2 = 3 ( n + 1 ) + 2 \\ b_{n+1} = \left(\dfrac 3{3n+2} + 1 \right)b_n = \left(\dfrac 3{3n+2} + 1 \right)(3n+2) = 3 + 3n+2 = 3(n+1) + 2 .

Since b m = 5 a m b_m = 5^{a_m} , for a m a_m to be an integer, b m = 3 m + 2 b_m = 3m+2 must be a power of 5 5 . 3 m + 2 = 5 1 3m+2= 5^1 is when m = 1 m=1 . For higher power of 5 5 , 3 m + 2 0 (mod 25) m 41 3m+2 \equiv 0 \text{ (mod 25)} \implies m \equiv \boxed{41} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...