From charlesreid1

No edit summary
(Add Binet's Fibonacci Formula (via update-page on MediaWiki MCP Server))
 
(4 intermediate revisions by the same user not shown)
Line 5: Line 5:
<math>
<math>
\pi^{-1} = \displaystyle{ \dfrac{\sqrt{8}}{99^2} } \displaystyle{ \sum_{k \geq 0} \dfrac{ (4k)! }{ (4^k k!)^4 } } \displaystyle{ \dfrac{1103 + 26390 k}{99^{4k}} }
\pi^{-1} = \displaystyle{ \dfrac{\sqrt{8}}{99^2} } \displaystyle{ \sum_{k \geq 0} \dfrac{ (4k)! }{ (4^k k!)^4 } } \displaystyle{ \dfrac{1103 + 26390 k}{99^{4k}} }
</math>
Wallis Product for Pi [https://en.wikipedia.org/wiki/Wallis_product]:
<math>
\dfrac{\pi}{2} = \prod_{n=1}^{\infty} \left( \dfrac{2n}{2n-1} \cdot \dfrac{2n}{2n+1} \right) = \dfrac{2}{1} \cdot \dfrac{2}{3} \cdot \dfrac{4}{3} \cdot \dfrac{4}{5} \cdot \dfrac{6}{5} \cdot \dfrac{6}{7} \cdots
</math>
</math>


Line 19: Line 25:
</math>
</math>


Zeta-regularized product:
Euler formula [https://www.math.purdue.edu/~eremenko/dvi/euler.pdf]:
 
<math>
e^{i \pi} + 1 = 0
</math>
 
Euler's sum of inverse squares:


<math>
<math>
\prod_{k=1}^{\infty} k = \sqrt{2 \pi}
\sum_{n=1}^{\infty} \dfrac{1}{n^2} = \dfrac{\pi^2}{6}
</math>
</math>


Euler formula:
Stirling's Approximation [https://en.wikipedia.org/wiki/Stirling%27s_approximation]:


<math>
<math>
e^{i \pi} + 1 = 0
n! \sim \sqrt{2 \pi n} \left( \dfrac{n}{e} \right)^n
</math>
</math>


Line 41: Line 53:
</math>
</math>


Binet's Fibonacci Formula [https://en.wikipedia.org/wiki/Fibonacci_sequence#Binet's_formula]:
<math>
F_n = \dfrac{ \varphi^n - \psi^n }{ \sqrt{5} }
</math>
where <math>\varphi = \dfrac{1 + \sqrt{5}}{2}</math> (the golden ratio) and <math>\psi = \dfrac{1 - \sqrt{5}}{2} = -\varphi^{-1}</math>.


{{MathFlag}}
{{MathFlag}}

Latest revision as of 21:23, 25 May 2026

The most beautiful formulas:

Ramanujan's inverse pi formula:

$ \pi^{-1} = \displaystyle{ \dfrac{\sqrt{8}}{99^2} } \displaystyle{ \sum_{k \geq 0} \dfrac{ (4k)! }{ (4^k k!)^4 } } \displaystyle{ \dfrac{1103 + 26390 k}{99^{4k}} } $

Wallis Product for Pi [1]:

$ \dfrac{\pi}{2} = \prod_{n=1}^{\infty} \left( \dfrac{2n}{2n-1} \cdot \dfrac{2n}{2n+1} \right) = \dfrac{2}{1} \cdot \dfrac{2}{3} \cdot \dfrac{4}{3} \cdot \dfrac{4}{5} \cdot \dfrac{6}{5} \cdot \dfrac{6}{7} \cdots $

Gaussian integral:

$ \int_{-\infty}^{\infty} e^{-x^2} dx = \sqrt{2 \pi} $

Ramanujan sum:

$ \sum_{k=1}^{\infty} k = - \frac{1}{12} $

Euler formula [2]:

$ e^{i \pi} + 1 = 0 $

Euler's sum of inverse squares:

$ \sum_{n=1}^{\infty} \dfrac{1}{n^2} = \dfrac{\pi^2}{6} $

Stirling's Approximation [3]:

$ n! \sim \sqrt{2 \pi n} \left( \dfrac{n}{e} \right)^n $

Archimedes' Recurrence Formula:

$ a_{2n} = \frac{2 a_n b_n}{a_n + b_n} $

$ b_{2n} = \sqrt{a_{2n} b_n} $

Binet's Fibonacci Formula [4]:

$ F_n = \dfrac{ \varphi^n - \psi^n }{ \sqrt{5} } $

where $ \varphi = \dfrac{1 + \sqrt{5}}{2} $ (the golden ratio) and $ \psi = \dfrac{1 - \sqrt{5}}{2} = -\varphi^{-1} $.