All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Matrixed Fibonacci (Posted on 2019-04-08) Difficulty: 3 of 5
Fn is the n-th Fibonacci number defined by the recurrence relation Fn = Fn-1 + Fn-2 with F1 = F2 = 1. If n is a perfect square and n > 4, then find the value of the determinant below

| F1          F2          ... F√n  |
| F√n+1     F√n+2    ... F2√n |
|    .           .                .    |
|    .           .                .    |
| Fn-√n+1   Fn-√n+2  ... Fn   |

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionAnalytic SolutionBrian Smith2019-04-09 11:49:43
Solutionanswer (computer exploration)Charlie2019-04-08 16:41:42
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (11)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information