Question

Proof that golden angle successively divides the largest gap by the golden ratio?

score 450 · Answer 1 · 2026-03-25 11:06:34

450

Views

Proof that golden angle successively divides the largest gap by the golden ratio?

Published on 25 Mar 2026 - 11:06

score 2.9k · Answer 2 · 2014-06-13 19:26:50

2.9k

Views

The sum of $n$ consecutive Fibonacci numbers.

Published on 13 Jun 2014 - 19:26

score 128 · Answer 3 · 2014-06-17 18:34:02

128

Views

Let $u_n$ be the $n$-th entry in the Fibonacci sequence $1,1,2,3,5,8,13,\ldots$

Published on 17 Jun 2014 - 18:34

score 3.7k · Answer 4 · 2014-06-17 23:19:51

3.7k

Views

Asymptotic value of Fibonacci numbers

Published on 17 Jun 2014 - 23:19

score 99 · Answer 5 · 2014-06-24 04:57:12

99

Views

How to establish this inequality without using induction?

Published on 24 Jun 2014 - 4:57

score 5.4k · Answer 6 · 2014-06-24 17:26:02

5.4k

Views

Base case in the Binet formula (Proof by strong induction)

Published on 24 Jun 2014 - 17:26

score 3k · Answer 7 · 2014-06-26 19:04:17

3k

Views

How to tell if a Fibonacci number has an even or odd index

Published on 26 Jun 2014 - 19:04

score 353 · Answer 8 · 2014-06-28 00:21:54

353

Views

Fibonacci Calculation using a larger matrix

Published on 28 Jun 2014 - 0:21

score 186 · Answer 9 · 2014-07-02 21:59:15

186

Views

Fibonacci numbers $F_{n+3} + F_{n} = 2F_{n+2}$

Published on 02 Jul 2014 - 21:59

score 13.4k · Answer 10 · 2014-07-06 20:16:05

13.4k

Views

Converting recursive equations into matrices

Published on 06 Jul 2014 - 20:16

score 3.9k · Answer 11 · 2014-07-07 19:25:27

3.9k

Views

Fibonacci Numbers Proof: $ f_n = \binom n0 + \binom{n-1}1 +\dots+ \binom{n-k}k$

Published on 07 Jul 2014 - 19:25

score 111 · Answer 12 · 2014-07-09 18:09:23

111

Views

Fibonacci numbers identity - proof by induction

Published on 09 Jul 2014 - 18:09

score 1.2k · Answer 13 · 2014-07-10 14:48:39

1.2k

Views

Golden ratio, $n$-bonacci numbers, and radicals of the form $\sqrt[n]{\frac{1}{n-1}+\sqrt[n]{\frac{1}{n-1}+\sqrt[n]{\frac{1}{n-1}+\cdots}}}$

Published on 10 Jul 2014 - 14:48

score 573 · Answer 14 · 2026-03-26 12:53:32

573

Views

The number of partitions of $n$ and the $n$th Fibonacci number.

Published on 26 Mar 2026 - 12:53

score 9.2k · Answer 15 · 2014-07-14 22:30:07

9.2k

Views

How to compute the nth number of a general Fibonacci sequence with matrix multiplication?

Published on 14 Jul 2014 - 22:30

List Question

Proof that golden angle successively divides the largest gap by the golden ratio?

The sum of $n$ consecutive Fibonacci numbers.

Let $u_n$ be the $n$-th entry in the Fibonacci sequence $1,1,2,3,5,8,13,\ldots$

Asymptotic value of Fibonacci numbers

How to establish this inequality without using induction?

Base case in the Binet formula (Proof by strong induction)

How to tell if a Fibonacci number has an even or odd index

Fibonacci Calculation using a larger matrix

Fibonacci numbers $F_{n+3} + F_{n} = 2F_{n+2}$

Converting recursive equations into matrices

Fibonacci Numbers Proof: $ f_n = \binom n0 + \binom{n-1}1 +\dots+ \binom{n-k}k$

Fibonacci numbers identity - proof by induction

Golden ratio, $n$-bonacci numbers, and radicals of the form $\sqrt[n]{\frac{1}{n-1}+\sqrt[n]{\frac{1}{n-1}+\sqrt[n]{\frac{1}{n-1}+\cdots}}}$

The number of partitions of $n$ and the $n$th Fibonacci number.

How to compute the nth number of a general Fibonacci sequence with matrix multiplication?

Trending Questions

Popular # Hahtags

Popular Questions