Superman is taking part in a hurdle race with 12 hurdles. At any stage he can jump across any number of hurdles lying ahead. For example, he can cross all 12 hurdles in one jump or he can cross 7 hurdles in the first jump, 1 in the later and the rest in the third jump. In how many different ways can superman complete the race?
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
You are discussing questions from the BdMO (Bangladesh Math Olympiad) -2012, aren't you?
Log in to reply
All of the 3 discussions are from MO question sets...
I tried to utilize Brilliant !!!!!
We solve this recursively.
Let f(n) be the number of ways Superman can complete a race with n hurdles. Clearly, f(n)=i=0∑n−1f(i). And since we have f(0)=f(1)=1, it's not difficult to see that f(n) is in fact 2n−1.