Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with recreational-mathematics
Search options not deleted
user 522088
Applications of mathematics for the design and analysis of games and puzzles
3
votes
1
answer
219
views
Proof of an unknown source Fibonacci identity with double modulo
Many years ago, I saw the following Fibonacci identity from somewhere online, without proof:
Let usual $F(n)$ be Fibonacci numbers with $F(0) = 0, F(1) = 1$, then we have
$$F(n) = \left(p ^ {n + 1} \ …
- 131