Could someone please help me with the attached RMO 2013 problem?
I got the answer to be \(3^{n-1}n + [\frac{n-1}{2}]\), where the square brackets, [], imply the floor function. Is that right? I couldn't find an answer key for this (Maharashtra and Goa) anywhere.
Any help will be highly appreciated.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
I'm getting 2n−1(2n−1).
Log in to reply
Could you please explain?
Log in to reply
Let bn be the number of sequences formed which have an even number of zeros.
Then it is obvious that 4n=an+bn, since there 4n sequences of n terms, and each sequence must contain an even or odd number of zeroes.
Now, look at any sequence part of an. It's first term is either zero (1 way), or not zero (3 ways). If the first term is zero, the remaining sequence must contain an even number of zeroes, and thus is bn−1. Likewise, if the first term is not zero, the remaining sequence is an−1.
Therefore, an=bn−1+3an−1. Eliminating bn from both equations, we have
an=2an−1+4n−1
or an=6an−1−8an−2
Solving this recurrence relation, using a1=1,a2=6,, we get an=2n−1(2n−1)
Log in to reply