Other names include extreme and average ratio, medial section, divine proportion (Latin: proportio divina), divine section (Latin: sectio divina), golden proportion, golden cut, and golden number. Mathematicians since Euclid have study the property of the golden ratio, including its appearance in the dimensions of a regular pentagon and in a golden rectangle, which may be cut into a square and a smaller rectangle with the same aspect ratio. German mathematician Simon Jacob (d. 1564) noted that consecutive Fibonacci numbers converge to the golden ratio; this was rediscovered by Johannes Kepler in 1608.According to one narrative, 5th-century BC mathematician Hippasus observed that the golden ratio was neither a whole number nor a fraction (an irrational number), surprising Pythagoreans. According to Mario Livio: Some of the greatest mathematical minds of all ages, from Pythagoras and Euclid in ancient Greece, through the medieval Italian mathematician Leonardo of Pisa and the Renaissance astronomer Johannes Kepler, to present-day scientific figures such as Oxford physicist Roger Penrose, have spent endless hours over this simple ratio and its property....

COMING SOON!

```
//
// CPP program to find n-th Fibonacci number
// More documentation about the algorithm
//
// The All â–²lgorithms Project
//
// https://allalgorithms.com/
// https://github.com/allalgorithms/cpp
//
// Contributed by: Mohbius
// Github: @mohbius
//
#include <iostream>
#include <cstdlib>
#include <cmath>
using namespace std;
// Approximate value of golden ratio
double PHI = 1.6180339;
// Fibonacci numbers upto n = 5
int f[6] = { 0, 1, 1, 2, 3, 5 };
// Function to find nth
// Fibonacci number
int fib (int n)
{
// Fibonacci numbers for n < 6
if (n < 6)
return f[n];
// Else start counting from
// 5th term
int t = 5, fn = 5;
while (t < n) {
fn = round(fn * PHI);
t++;
}
return fn;
}
int main()
{
std::cout << fib(9) << std::endl; // 34
std::cout << fib(8) << std::endl; // 21
std::cout << fib(7) << std::endl; // 13
return 0;
}
```