Sine of Multiple of Pi by 2 plus i by Natural Logarithm of Golden Mean
Jump to navigation
Jump to search
Theorem
Let $z = \dfrac \pi 2 + i \ln \phi$.
Then:
- $\dfrac {\sin n z} {\sin z} = i^{1 - n} F_n$
where:
- $\phi$ denotes the golden mean
- $F_n$ denotes the $n$th Fibonacci number.
Proof 1
\(\ds \sin n z\) | \(=\) | \(\ds \map \sin {\dfrac {n \pi} 2 + i n \ln \phi}\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds \frac {e^{i \paren {\paren {n \pi / 2} + i n \ln \phi} } - e^{-i \paren {\paren {n \pi / 2} + i n \ln \phi} } } {2 i}\) | Sine Exponential Formulation | |||||||||||
\(\ds \) | \(=\) | \(\ds \frac {e^{i n \pi / 2} e^{-n \ln \phi} - e^{-i n \pi / 2} e^{n \ln \phi} } {2 i}\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds \frac {e^{-n \ln \phi} \paren {\cos \frac {n \pi} 2 + i \sin \frac {n \pi} 2} - e^{n \ln \phi} \paren {\cos \paren {-\frac {n \pi} 2} + i \map \sin {-\frac {n \pi} 2} } } {2 i}\) | Euler's Formula and Corollary | |||||||||||
\(\ds \) | \(=\) | \(\ds \frac {e^{-n \ln \phi} \paren {i \sin \frac {n \pi} 2} - e^{n \ln \phi} \paren {i \map \sin {-\frac {n \pi} 2} } } {2 i}\) | Cosine of Half-Integer Multiple of Pi | |||||||||||
\(\ds \) | \(=\) | \(\ds \frac {i^n e^{-n \ln \phi} - \paren {-i}^n e^{n \ln \phi} } {2 i}\) | Sine of Half-Integer Multiple of Pi and simplification | |||||||||||
\(\ds \) | \(=\) | \(\ds \frac {i^{n - 1} \paren {e^{-n \ln \phi} + e^{n \ln \phi} } } 2\) | simplification | |||||||||||
\(\ds \) | \(=\) | \(\ds i^{n - 1} \frac {\phi^n + \frac 1 {\phi^n} } 2\) | Exponential of Natural Logarithm | |||||||||||
\(\ds \) | \(=\) | \(\ds i^{n - 1} \frac {\phi^n - \paren {-\frac 1 {\phi^n} } } 2\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds i^{n - 1} \frac {\phi^n - \hat \phi^n} 2\) | Reciprocal Form of One Minus Golden Mean |
Setting $n = 1$:
- $\sin z = i^0 \frac {\phi^1 - \hat \phi^1} 2 = \frac {\phi - \hat \phi} 2$
Thus:
\(\ds \dfrac {\sin n z} {\sin z}\) | \(=\) | \(\ds \dfrac {i^{n - 1} \frac {\phi^n - \hat \phi^n} 2} {\frac {\phi - \hat \phi} 2}\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds i^{n - 1} \dfrac {\phi^n - \hat \phi^n } {\phi - \hat \phi}\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds i^{n - 1} \dfrac {\frac {\phi^n - \hat \phi^n} {\sqrt 5} } {\frac {\phi - \hat \phi} {\sqrt 5} }\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds i^{n - 1} \dfrac {F_n} {F_1}\) | Euler-Binet Formula | |||||||||||
\(\ds \) | \(=\) | \(\ds i^{n - 1} F_n\) | Definition of Fibonacci Number: $F_1 = 1$ |
$\blacksquare$
Proof 2
\(\ds \cos z\) | \(=\) | \(\ds \cos \left({\dfrac {\pi} 2 + i \ln \phi}\right)\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds \frac {e^{i \left({\left({\pi / 2}\right) + i \ln \phi}\right)} + e^{-i \left({\left({\pi / 2}\right) + i \ln \phi}\right)} } 2\) | Cosine Exponential Formulation | |||||||||||
\(\ds \) | \(=\) | \(\ds \frac {e^{i \pi / 2} e^{-\ln \phi} + e^{-i \pi / 2} e^{\ln \phi} } 2\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds \frac {e^{-\ln \phi} \left({\cos \frac \pi 2 + i \sin \frac \pi 2}\right) + e^{\ln \phi} \left({\cos \left({-\frac \pi 2}\right) + i \sin \left({-\frac \pi 2}\right)}\right)} 2\) | Euler's Formula and Corollary | |||||||||||
\(\ds \) | \(=\) | \(\ds \frac {e^{-\ln \phi} \left({i \sin \frac \pi 2}\right) + e^{\ln \phi} \left({i \sin \left({-\frac \pi 2}\right)}\right)} 2\) | Cosine of Half-Integer Multiple of Pi | |||||||||||
\(\ds \) | \(=\) | \(\ds \frac {i e^{-\ln \phi} - i e^{\ln \phi} } 2\) | Sine of Half-Integer Multiple of Pi and simplification | |||||||||||
\(\ds \) | \(=\) | \(\ds -i \frac {\phi - \frac 1 {\phi} } 2\) | Exponential of Natural Logarithm | |||||||||||
\(\ds \) | \(=\) | \(\ds -i \frac {\phi^2 - 1} {2 \phi}\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds -i \frac {\phi} {2 \phi}\) | Square of Golden Mean equals One plus Golden Mean | |||||||||||
\(\ds \) | \(=\) | \(\ds \frac {-i} 2\) |
Then:
\(\ds \sin \left({n + 1}\right) z + \sin \left({n - 1}\right) z\) | \(=\) | \(\ds 2 \sin n z \cos z\) | Simpson's Formula for Sine by Cosine | |||||||||||
\(\ds \) | \(=\) | \(\ds -i \sin n z\) |
![]() | This needs considerable tedious hard slog to complete it. In particular: Where to from here? To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Finish}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Sources
- 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 1.2.8$: Fibonacci Numbers: Exercise $33$