Using Recursion
https://brilliant.org/practice/a-naive-approach/?p=6
The algorithm for smart_fibonacci is wrong (it has a bug).
The correct version is:
def really_smart_fibonacci(n):
a, b = 0, 1
for i in range(1, n):
a, b = b, a+b
return b
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
This has been resolved.
In the future, you can report problems via the report feature.