a n + 1 = ( ⌊ ⌊ a n ⌋ − ⌊ a n ⌋ ⌋ ) 2
Define the recurrence relation as above, with an initial condition that a 3 3 = 1 . Determine ( ⌊ a 2 ⌋ + 1 ) 2 + ( ⌊ a 2 ⌋ ) 2 .
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.
Your solution is absolutely right. I said m > 1 , so let it's minimum value be 2 . Else one could have also take m to be 3 3 . With A − B to be maximum and greater than the absolute value of the difference of two successive terms means A − B = 6 5 , which is indeed greater than a 2 − a 3 .
Log in to reply
Thank you for the clarification that 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.
How did u determine a2 to be 32^2
Consider a n + 1 = ( ⌊ ⌊ a n ⌋ − ⌊ a n ⌋ ⌋ ) 2 ⟹ a n + 1 = ⌊ ⌊ a n ⌋ − ⌊ a n ⌋ ⌋ . Since the RHS is an integer, this means that a n are perfect squares for all n . Let b 3 4 − n = a n . Then b 1 = a 3 3 = 1 , a 2 = b 3 2 and b n = ⌊ b n + 1 2 − b n + 1 ⌋ . We note that b n + 1 > b n . Let us assume b n + 1 = b n + 1 then:
⌊ b n + 1 2 − b n + 1 ⌋ ⟹ b n + 1 = ⌊ ( b n + 1 ) 2 − b n − 1 ⌋ = ⌊ b n 2 + b n ⌋ < ⌊ b n 2 + b n + 4 1 ⌋ < ⌊ b n + 2 1 ⌋ = b n = b n + 1
Now, if we assume b n + 1 = b n + 1 then:
⌊ b n + 1 2 − b n + 1 ⌋ ⟹ 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
Then we have b n + 1 = b n + 1 . Since b 1 = 1 , then b n = n , and
( ⌊ a 2 ⌋ + 1 ) 2 + ( ⌊ a 2 ⌋ ) 2 = ( ⌊ b 3 2 ⌋ + 1 ) 2 + ( ⌊ b 3 2 ⌋ ) 2 = 3 3 2 + 3 2 2 = 2 1 1 3
Problem Loading...
Note Loading...
Set Loading...
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 is a perfect square, say, a n + 1 = p 2 . Then a n + 2 = ( p − 1 ) 2 , a n + 3 = ( p − 2 ) 2 , etc. Thus, if a 3 3 = 1 2 then a 2 = 3 2 2 = 1 0 2 4 . When the problem talks about m being "minimum and greater than 1", I read that to mean that m = 2 . Thus B = a 2 = 1 0 2 4 and A = 3 3 2 = 1 0 8 9 , with A + B = 2 1 1 3 . I don't understand the condition about A − B being a certain maximum though... maybe the author can explain.