Like it!

Algebra Level 5

a n + 1 = ( a n a n ) 2 \large{{ a }_{ n+1 }={ \left( \left\lfloor \sqrt { \left\lfloor { a }_{ n } \right\rfloor -\left\lfloor \sqrt { { a }_{ n } } \right\rfloor } \right\rfloor \right) }^{ 2 }}

Define the recurrence relation as above, with an initial condition that a 33 = 1 a_{33} = 1 . Determine ( a 2 + 1 ) 2 + ( a 2 ) 2 { \left( \left\lfloor \sqrt { { a }_{ 2 } } \right\rfloor +1 \right) }^{ 2 } + { \left( \left\lfloor \sqrt { { a }_{ 2 } } \right\rfloor \right) }^{ 2 } .


The answer is 2113.

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.

2 solutions

Otto Bretscher
Sep 22, 2015

I must confess that I don't fully understand the wording of this problem... I was lucky enough to stumble upon the answer.

First we note that a n + 1 a_{n+1} is a perfect square, say, a n + 1 = p 2 a_{n+1}=p^2 . Then a n + 2 = ( p 1 ) 2 , a n + 3 = ( p 2 ) 2 , a_{n+2}=(p-1)^2, a_{n+3}=(p-2)^2, etc. Thus, if a 33 = 1 2 a_{33}=1^2 then a 2 = 3 2 2 = 1024 a_2=32^2=1024 . When the problem talks about m m being "minimum and greater than 1", I read that to mean that m = 2 m=2 . Thus B = a 2 = 1024 B=a_2=1024 and A = 3 3 2 = 1089 A=33^2=1089 , with A + B = 2113 A+B=\boxed{2113} . I don't understand the condition about A B A-B being a certain maximum though... maybe the author can explain.

Your solution is absolutely right. I said m > 1 m>1 , so let it's minimum value be 2 2 . Else one could have also take m m to be 33 33 . With A B A-B to be maximum and greater than the absolute value of the difference of two successive terms means A B = 65 A-B=65 , which is indeed greater than a 2 a 3 a_{2}-a_{3} .

Department 8 - 5 years, 8 months ago

Log in to reply

Thank you for the clarification that A B A-B should be "greater than" the absolute value of the difference of two consecutive terms... maybe you can put that formulation in the problem as well, for clarity.

Otto Bretscher - 5 years, 8 months ago

How did u determine a2 to be 32^2

Shidharth Srinivasan - 4 years, 9 months ago
Chew-Seong Cheong
Oct 19, 2016

Consider a n + 1 = ( a n a n ) 2 a_{n+1} = \left( \left \lfloor \sqrt{\left \lfloor a_n \right \rfloor - \left \lfloor \sqrt{a_n} \right \rfloor} \right \rfloor \right)^2 a n + 1 = a n a n \implies \sqrt{a_{n+1}} = \left \lfloor \sqrt{\left \lfloor a_n \right \rfloor - \left \lfloor \sqrt{a_n} \right \rfloor} \right \rfloor . Since the RHS is an integer, this means that a n a_n are perfect squares for all n n . Let b 34 n = a n b_{34-n} = \sqrt{a_n} . Then b 1 = a 33 = 1 b_1 = \sqrt {a_{33}} = 1 , a 2 = b 32 \sqrt{a_2} = b_{32} and b n = b n + 1 2 b n + 1 b_n = \left \lfloor \sqrt{b_{n+1}^2 - b_{n+1}} \right \rfloor . We note that b n + 1 > b n b_{n+1} > b_n . Let us assume b n + 1 = b n + 1 b_{n+1} = b_n+1 then:

b n + 1 2 b n + 1 = ( b n + 1 ) 2 b n 1 = b n 2 + b n < b n 2 + b n + 1 4 < b n + 1 2 = b n b n + 1 = b n + 1 \begin{aligned} \left \lfloor \sqrt{b_{n+1}^2 - b_{n+1}} \right \rfloor & = \left \lfloor \sqrt{(b_n+1)^2 - b_n-1} \right \rfloor \\ & = \left \lfloor \sqrt{b_n^2 + b_n} \right \rfloor \\ & < \left \lfloor \sqrt{b_n^2 + b_n + \frac 14} \right \rfloor \\ & < \left \lfloor b_n + \frac 12 \right \rfloor \\ & = b_n \\ \implies b_{n+1} & = b_n + 1 \end{aligned}

Now, if we assume b n + 1 = b n + 1 b_{n+1} = b_n+1 then:

b n + 1 2 b n + 1 = ( b n + 2 ) 2 b n 2 = b n 2 + 3 b n + 2 > b n 2 + 2 b n + 1 > b n + 1 = b n + 1 b n b n + 1 b n + 1 \begin{aligned} \left \lfloor \sqrt{b_{n+1}^2 - b_{n+1}} \right \rfloor & = \left \lfloor \sqrt{(b_n+2)^2 - b_n-2} \right \rfloor \\ & = \left \lfloor \sqrt{b_n^2 + 3b_n+2} \right \rfloor \\ & > \left \lfloor \sqrt{b_n^2 + 2 b_n + 1} \right \rfloor \\ & > \left \lfloor b_n + 1 \right \rfloor \\ & = b_n + 1 \ne b_n \\ \implies b_{n+1} & \not > b_n + 1 \end{aligned}

Then we have b n + 1 = b n + 1 b_{n+1} = b_n+1 . Since b 1 = 1 b_1 = 1 , then b n = n b_n = n , and

( a 2 + 1 ) 2 + ( a 2 ) 2 = ( b 32 + 1 ) 2 + ( b 32 ) 2 = 3 3 2 + 3 2 2 = 2113 \begin{aligned} \left(\left \lfloor \sqrt {a_2} \right \rfloor +1 \right)^2 + \left(\left \lfloor \sqrt {a_2} \right \rfloor \right)^2 & =\left(\left \lfloor b_{32} \right \rfloor +1 \right)^2 + \left(\left \lfloor b_{32} \right \rfloor \right)^2 \\ & =33^2+32^2 = \boxed{2113} \end{aligned}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...