Fibonacci

F n = x ! + y ! \large F_n = x! + y!

The above equation holds true for some positive integers n n , x x and y y . Find the largest n < 100 n<100 satisfying this condition, and submit your answer as n + x + y n+x+y .

Notations :

  • F n F_n denote the n th n^\text{th} Fibonacci number , where F 0 = 0 , F 1 = 1 F_0 = 0, F_1 = 1 and F n = F n 1 + F n 2 F_n = F_{n-1} + F_{n-2} for n = 2 , 3 , 4 , n=2,3,4,\ldots .

Notation : ! ! denotes the factorial notation. For example, 8 ! = 1 × 2 × 3 × × 8 8! = 1\times2\times3\times\cdots\times8 .


The answer is 21.

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.

2 solutions

Mark Hennings
Sep 8, 2016

This paper proves that in fact 12 12 is the largest possible value of n n such that F n = x ! + y ! F_n = x! + y! for positive integers x , y x,y (and not just the largest in the range n < 99 n<99 ). We have F 12 = 144 = 5 ! + 4 ! F_{12} = 144 = 5! + 4! , so the solution is 21 \boxed{21} .

Hi Mark, thanks for the mention of the paper. I liked it and will get a copy.

Giorgio Coniglio - 4 years, 9 months ago
Michael Mendrin
Jul 30, 2016

Actually, there's these that work

1 ! + 1 ! = 2 1!+1!=2
1 ! + 2 ! = 3 1!+2!=3
2 ! + 3 ! = 8 2!+3!=8
4 ! + 5 ! = 144 4!+5!=144


all of which are Fibonacci numbers. Probably the question should be reworded.

Yes, you are right and I am rewording the problem. Thanks!

Giorgio Coniglio - 4 years, 10 months ago

Thanks. I've updated the problem statement.

In future, if you spot any errors with a problem, you can “report” it by selecting "report problem" in the “line line line” menu in the top right corner. This will notify the problem creator who can fix the issues.

Brilliant Mathematics Staff - 4 years, 10 months ago

Can you please post a solution sir?

Harsh Shrivastava - 4 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...