Created
March 7, 2019 07:06
-
-
Save dardo82/e97f19dfe181fe55034a9b3b9605ebfd to your computer and use it in GitHub Desktop.
Binary Fibonacci
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
\begin{align*} | |
a,k,n,m \in \mathbb{N} \quad b \in \{0;1\} \\ | |
A=\{a|a<2^{m}\} \quad a=\sum_{k=0}^{m-1} b_{k} \cdot 2^{k} \\ | |
F_0=0; \ F_1=1; \ F_{n}=F_{n-1}+F_{n-2} \\ | |
\forall k \ \ b_{k}=1 \Rightarrow b_{k+1}=0 \quad |A|=F_{m+2} \\ | |
\end{align*} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
La cardinalità dell’insieme dei numeri naturali minori di due alla emme la cui rappresentazione binaria non contiene due uno consecutivi è pari all’emme-più-due-esimo numero di Fibonacci.