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:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
Math
Appears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3
2×3
2^{34}
234
a_{i-1}
ai−1
\frac{2}{3}
32
\sqrt{2}
2
\sum_{i=1}^3
∑i=13
\sin \theta
sinθ
\boxed{123}
123
Comments
The generating function for the Fibonacci numbers is G(x)=1−x−x2x. (Think of the infinite geometric series and what terms combine to make xn...). So, you want to solve 1−a−a2a=2 or 2a2+3a−2=0. Since we must have 0<a<25−1, this leaves a=21.
@Ivan Stošić
–
Wow, that's amazing. It's like the first time I saw a proof of the sum of a geometric series, where suddenly all the terms canceled out.
I highly recommend Wilf's Generatingfunctionology, which deals with formal generating functions. The second edition is available online for free on the author's site. Using this, you can actually generate a formal proof.
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
The generating function for the Fibonacci numbers is G(x)=1−x−x2x. (Think of the infinite geometric series and what terms combine to make xn...). So, you want to solve 1−a−a2a=2 or 2a2+3a−2=0. Since we must have 0<a<25−1, this leaves a=21.
Log in to reply
Could you elaborate on how you found that closed form?
Log in to reply
Here is an interesting idea. Try to follow these steps carefully:
G(x)=x+x2+2x3+3x4+5x5+8x6+13x7+...
xG(x)=1+x+2x2+3x3+5x4+8x5+13x6+...
xG(x)−G(x)=1+x2+x3+2x4+3x5+5x6+8x7+...
xG(x)=x2+x3+2x4+3x5+5x6+8x7+13x8+...
And finally,
xG(x)−G(x)−xG(x)=1
Solve this for G(x) to get G(x)=1−x−x2x
Log in to reply
I highly recommend Wilf's Generatingfunctionology, which deals with formal generating functions. The second edition is available online for free on the author's site. Using this, you can actually generate a formal proof.
Log in to reply