F n denote the n th Fibonacci number. If we know that F 2 4 = 4 6 3 6 8 and F 2 8 = 3 1 7 8 1 1 , then compute F 2 6 .
LetDetails and Assumptions:
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.
Nice solution
How did you know you were to begin with F{n+4}
Log in to reply
Since we are given F 2 4 and F 2 8 , I wanted to develop a general formula that would have the lesser of these, namely F 2 4 , as F n , which would then have F 2 8 represented as F n + 4 . So it was just a notational choice, really.
N present at 4
Really Great..
But I don't know anything about Fibonacci. Can you tell me something about it please..
I really love this solution
That solution cool, Brian!
Nice solution
This is exactly what I did but they said not to use calcs so i did the adding and subtracting wrong...
Good solution
You deserve to be on Brilliant. Nice solution.
But why substituteing n =24 rather than any other.for eg.. 28
We let F 2 4 = a , F 2 5 = b , F 2 6 = a + b , F 2 7 = a + 2 b a n d F 2 8 = 2 a + 3 b
See what happens when we add F 2 4 a n d F 2 8 : F 2 4 + F 2 8 = a + ( 2 a + 3 b ) = 3 ( a + b )
We know that a + b = F 2 6
And we already know the value of F 2 4 a n d F 2 8
So substitution: 3 F 2 4 + F 2 8 = 3 4 6 3 6 8 + 3 1 7 8 1 1 = 1 2 1 3 9 3
Effecient and simple! :-)
Very nice solution
Thanks..It's really simple. I am really delighted by your answer.
Do you have any idea how the Fibonacci sequence can be applied to C++? Just interested :)
Log in to reply
You can use dynamic programing like,
int Fibonacci(int n) { if ( n == 0 ) return 0; else if ( n == 1 ) return 1; else return ( Fibonacci(n-1) + Fibonacci(n-2) ); }
else in the iterative form:
int term1 = 0, term2 = 1; cout<<term1; cout<<term2; for(i=0;i<n;i++) { sum = term1 + term2; term1 = term2; term2 = sum; cout<<term2; }
I'm not a programmer.
Log in to reply
Dynamic programming is not actually the programming that u r thinking...
Kudos to you brother
By Catalan's Identity, F n 2 = ( − 1 ) n + r F r 2 + F n − r F n + r .
Letting n = 2 6 and r = 2 , we have F 2 6 = F 2 2 + F 2 4 F 2 8 = 1 + 4 6 3 6 8 × 3 1 7 8 1 1 = 1 2 1 3 9 3 .
Unconventional yet brilliant. Well done!
Beautiful maths. Clever chap. High IQ.
Not sure how I have never heard that theorem before, but thank you for some new insight!
Very new for me. But also very clever. :-)
This is new..thanks for new info btw..
Thanks for that, poi(?)
brilliant Jake lai. amazing answer
First we write those 3 identities :
F 2 8 = F 2 7 + F 2 6 F 2 7 = F 2 6 + F 2 5 F 2 5 + F 2 4 = F 2 6
After ading up, we have :
F 2 8 + F 2 4 = 3 F 2 6 F 2 6 = 3 F 2 8 + F 2 4 F 2 6 = 3 4 6 3 6 8 + 3 1 7 8 1 1 = 1 2 1 3 9 3
I used this same one haha :)
Thats basically how I solved it: 3 equations, 3 unknowns
Very good and vsimplified approach,congratulations
In fibonacci series, as we go bigger, the ratio between 2 consecutive numbers is approximately equal to phi. So I multiplied 46368 x 1.618 x 1.618 and rounded off to get 121393
Nice use of golden ratio! Great job.
lol that is the exact same thing I did to solve this.
We find, by inspection, that F 2 = 3 F 0 + F 4 and F 3 = 3 F 1 + F 5 . Adding these equations yields F 4 = 3 F 2 + F 6 and, by induction, F n = 3 F n − 2 + F n + 2 for n ≥ 2 . For n = 2 6 we find F 2 6 = 3 F 2 4 + F 2 8 = 1 2 1 3 9 3 .
A great gem. Well done!
F 2 8 = F 2 7 + F 2 6 F 2 7 = F 2 6 + F 2 5 F 2 6 = F 2 5 + F 2 4
Substitute 3 1 7 8 1 1 for F 2 8 in the first equation. Then, use the second and third equations to write the entire first equation in terms of F 2 6 and F 2 4 (note that F 2 5 = F 2 6 − F 2 4 from the third equation). Finally, substitute 4 6 3 6 8 for F 2 4 and solve for F 2 6 .
3 1 7 8 1 1 = F 2 7 + F 2 6 3 1 7 8 1 1 = F 2 6 + F 2 5 + F 2 6 3 1 7 8 1 1 = F 2 6 + F 2 6 − F 2 4 + F 2 6 3 1 7 8 1 1 = 3 F 2 6 − 4 6 3 6 8 3 F 2 6 = 3 6 4 1 7 9 F 2 6 = 1 2 1 3 9 3
If you know that Fibonacci is essentially a geometric series rounded to integers, you only have to take the geometric mean of the two numbers and observe that the result is extremely close to an integer. It must be our answer.
However, I respect the solutions here which did not require a calculator (or an extremely tedious paper calculation).
My solution is pretty much the same as the others but here it is....
We have this formula
F 2 4 + F 2 5 + F 2 7 = F 2 8
Based on
F n + 2 = F n + 1 + F n
Now we can manipulate the defining formula for Fibbonacci
F n + 2 = F n + 1 + F n
⇒ F n + F n + 2 = 2 F n + F n + 1
Then we'll replace F 2 5 + F 2 7 in the starting formula
F 2 4 + 2 F 2 5 + F 2 6 = F 2 8
Now we can form a system of equations
F 2 4 + 2 F 2 5 + F 2 6 = F 2 8 ∧ F 2 6 = F 2 5 + F 2 4
Which we can solve easily
F 2 4 + 2 F 2 5 + ( F 2 4 + F 2 5 ) = F 2 8
2 F 2 4 + 3 F 2 5 = F 2 8
F 2 5 = 3 F 2 8 − 2 F 2 4
F 2 5 = 7 5 0 2 5
Now that we know F 2 5 , we can find out F 2 6
F 2 6 = F 2 4 + F 2 6
F 2 6 = 7 5 0 2 5 + 4 6 3 6 8 = 1 2 1 3 9 3
My approach was somewhat simple: We know the Fibonacci sequence changes by ≈ 1 . 6 1 8 . And that we can express phi as 2 c o s ( 3 6 ) . So, in order to find F 2 6 , we take F 2 4 and multiply by phi twice: 4 6 3 8 6 ⋅ 2 c o s ( 3 6 ) = 7 5 0 2 5 And 7 5 0 2 5 ⋅ 2 c o s ( 3 6 ) = 1 2 1 3 9 3 We can simply check our answer: 1 2 1 3 9 3 − 7 5 0 2 5 = 4 6 3 8 6 So the answer is 1 2 1 3 9 3 .
I can't believe it. This is my first level 4 Algebra solution. Am I dreaming?
My simple solution: We have F 2 4 , F 2 5 , F 2 6 , F 2 7 , F 2 8 .
We know all about the Fibonacci sequence, like: F n = F n − 1 + F n − 2 .
We also know the value of the first and last number, which are: F 2 4 = 4 6 3 6 9 and F 2 8 = 3 1 7 8 1 1 .
And for things get more clear (and easy to work with algebra), let's say that: F 2 4 = a , F 2 5 = b , F 2 6 = c (which we want to find it), F 2 7 = d and F 2 8 = e .
So, a = 4 6 3 6 9 and e = 3 1 2 8 1 1 .
We can assume that:
a + b = c ⟹ b = c − 4 6 3 6 8
b + c = d
c + d = e ⟹ d = 3 1 7 8 1 1 − c
Making some basic algebra:
c − 4 6 3 6 8 + c = 3 1 7 8 1 1 − c
3 c = 3 6 4 1 7 9
c = 1 2 1 3 9 3
Which correspond to: F 2 6 = 1 2 1 3 9 3 .
Let x 0 = F 2 4 , x 4 = F 2 8 and n = F 2 6 = x 2
Translating the formula given into our terms gives us
x n + 2 = x n + 1 + x n
(Not really much of a difference but still needed)
This means that
x 4 = x 3 + x 2
This can be written in a different way by substituting
x 4 = ( n + x 1 ) + ( n ) ⇒ x 4 = 2 n + x 1
Since n = x 2 = x 1 + x 0 we can substitute that in to get
x 4 = 2 ( x 1 + x 0 ) + x 1 = 3 x 1 + 2 x 0
Now we can start substituting in values for our algebra
3 1 7 , 8 1 1 = 3 x 1 + 2 ( 4 6 , 3 6 8 )
We can now find a value for x 1
3 3 1 7 , 8 1 1 − 9 2 , 7 3 6 = x 1 = 7 5 , 0 2 5
And now we have all the values for finding n
n = x 1 + x 0 = 7 5 , 0 2 5 + 4 6 , 3 6 8 = 1 2 1 , 3 9 3
So F 2 6 = 1 2 1 , 3 9 3
Computer Science Solution in C++
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
|
Good solution even though I have absolutely no idea what the codes mean.
Why didn't you make use of a recursive function?
using the formula :Fn = s q r t ( 5 ) ϕ n − ( − 1 / ϕ ) n where ϕ is the golden ratio, this could help prove that , Fn + Fn+4 = 3Fn+2 ,which would help in the above question. Note that with this formula we can directly substitute the value of n and solve the question immediately no proof required.
Let F25 = x Then, F26 = 46368 + x. And, F27 = F25 + F26 = x + 46368 + x = 2x + 46368. It means that : F28 = 46368 + x + 2x + 46368. 317811 = 3x + 92736. 225075 = 3x. x = 75025.
So, F26 = 46368 + 75025. = 121393.
I'm kind of ignorant compared to some of the others who solved this. I got it right but it took a while and took trial and error. I would not recommend solving how I did.
First I hypothesized that f27 is 2/3 (66.6%) of f28. That every n is 2/3 of n+1. When checking this it was wrong. But when lowering the precentage from 66.6 to 61.8035(this number came from trial and error Untill taking 61.8035% of f28 5 times got close enough to f24). After that percentage was correct I just took it twice giving me 121, 393.397.
Not sure how coherent my answer was. I tried explaining the best I could. I know it was a bad way to solve but it was the only way I could figure out how and hey, it worked!
Not very efficient, but... F 2 8 = F 2 6 + F 2 7
So, 3 1 7 8 1 1 = F 2 6 + F 2 7
Now 3 1 7 8 1 1 = ( 4 6 3 6 8 + F 2 5 ) + ( 2 ∗ F 2 5 + 4 6 3 6 8 )
Simplify: 3 1 7 8 1 1 = 9 2 7 3 6 + 3 ∗ F 2 5
Solve for F 2 5 : F 2 5 = 7 5 0 2 5
Thus, F 2 6 = 7 5 0 2 5 + 4 6 3 6 8 = 1 2 1 3 9 3 .
F28 = F27 +F26
F26 =317811 - F27
F26 = 317811 - F26 -F25 ---- 1
F26= F25 +46368 ------- 2
adding 1 and 2 we get
3F26 =317811 +46368
F26=121393
If you're lazy, don't read everything I wrote, what really matters is the math notation. Most of these writings are just personal notations. By the way, I am not the most expert guy with math notation, so there may be a few ambiguities with the formal notation I love using.
It's a childish and rustic solution, I think, but it worked for me with what I knew. As a student, that's what I've been taught and that's what best suits for me. That's what makes me love math as well. Thank you, my teachers.
Well, knowing that:
F n − 1 + F n = F n + 1
and if F n + 1 = 5 → ( F n = 3 ∧ F n − 1 = 2 ) ∵ 2 + 3 = 5
We also know that
F 2 4 = 4 6 3 6 8
F 2 8 = 3 1 7 8 1 1
and we wanna find F 2 6 . To find it, we need to know either it's antecedent or it's subsequent terms. We don't know them. If we wanna find F 2 6 we need to get rid of unknown terms. We still don't have enough information about these unknown terms, so I'll brainstorm some more among the things we know and can deduce by what we know.
F 2 4 + F 2 5 = F 2 6
F 2 5 + F 2 6 = F 2 7
F 2 6 + F 2 7 = F 2 8
That's enough. By that we can do some math black magic, and by that I mean isolate the unknown terms, so we can use them in substitution. It's important that we cannot isolate two terms from the same equation. Try doing this and using substitution and you'll get into an infinite loop or you'll get ( R ) . But it's ok, we have two equations for isolation and one for substitution. That's how I did it.
F 2 5 = F 2 7 − F 2 6 Here I thought: ok, I gotta find one unknown term, so I'll find F 2 5 , why not, right? So that's my starting point.
F 2 5 = F 2 8 − F 2 6 − F 2 6 Substution
F 2 5 = F 2 8 − 2 F 2 6 Simplification
F 2 6 − F 2 4 = F 2 8 − 2 F 2 6 Substitution
− F 2 4 = F 2 8 − 3 F 2 6 Subtractive Property of Equality
− 3 F 2 6 + F 2 8 = − F 2 4 Symmetric Property of Equality
− 3 F 2 6 = − F 2 8 − F 2 4 * Subtractive Property of Equality
F 2 6 = 3 F 2 8 + F 2 4 * Division Property of Equality
F 2 6 = 3 3 1 7 8 1 1 + 4 6 3 6 8 Substitution
F 2 6 = 1 2 1 3 9 3 Simplification
Of course there are some other ways of doing this same thing in a more neat way. It just happened everything flowed fine for me, but at the first time I didn't use this strategy I'm mentioning now, so that's why it's like this. I hope it's clear enough, but feel free to ask me to clarify even more, if it helps you or someone else understand. Some guys out there were finding some patterns I am very curious about and I'll certainly look into. Hope this helps.
Great explanation of the thought process that goes into solving a problem like this through experimentation. Sometimes, we have to get our hands dirty in order to solve a problem and discover the mathematical result.
Fibonacci series : 1 , 1 , 2 , 3 , 5 , 8 , 13 , ...... element = previous element + previous of previous element .... here if we take first five element as 1, 1, 2, 3, 5 ... so f1 = 1 & f5 = 5 , from that f3 = (1+5) / 3 = 2 . That's how every five pair works as in middle solution ; so the ans would be f26 = ( f24 + f28 ) / 3
Haha, I thought they said to not use a calculator. I had to use one.
F25=F24+F23
F26= F25+F24= 2F24+F23
F27= F26+F25 = 3F24+2F23
F28= F27+F26= 5F24+3F23
F28=317811. F24=46368
F28= 5F24+3F23
317811 =5(46368)+3F23
317811-5(46368)=3F23
85971/3=F23
F23=28657
F26=2F24+F23= 2(46368)+28657
F26=121393
Let's say F24 = A, F28 = B, and F25 = A + x. Then, F26 = 2A + x F27 = 3A + 2x F28 = 5A + 3x
So, B = 5A + 3x => B = 3* (2A + 3) - A => B = 3* F26 - A => F26 = (A+B)/3
But A = F24 = 46368 and B = F28 = 317811
So, F26 = (46368 +317811) / 3 = 121393 Answer
Problem Loading...
Note Loading...
Set Loading...
In general we have
F n + 4 = F n + 3 + F n + 2 = ( F n + 2 + F n + 1 ) + F n + 2 = 2 ∗ F n + 2 + F n + 1 .
Now F n + 2 = F n + 1 + F n ⟹ F n + 1 = F n + 2 − F n .
Thus F n + 4 = 2 ∗ F n + 2 + ( F n + 2 − F n ) = 3 ∗ F n + 2 − F n
⟹ F n + 2 = 3 F n + 4 + F n .
Plugging in n = 2 4 we have
F 2 6 = 3 F 2 8 + F 2 4 = 3 3 1 7 8 1 1 + 4 6 3 6 8 = 1 2 1 3 9 3 .