Skip to content

Instantly share code, notes, and snippets.

@dardo82
Created March 7, 2019 07:06
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save dardo82/e97f19dfe181fe55034a9b3b9605ebfd to your computer and use it in GitHub Desktop.
Save dardo82/e97f19dfe181fe55034a9b3b9605ebfd to your computer and use it in GitHub Desktop.
Binary Fibonacci
\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*}
@dardo82
Copy link
Author

dardo82 commented Mar 7, 2019

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.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment