Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Is it true that there exists arbitrarily large$n \in \mathbb{N}$ with arbitrarily many prime factors such that $n$ divides $F_n$, where $F_n$ represents the n-th Fibonacci number?
Is it true that there exists arbitrarily large$n \in \mathbb{N}$ such that $n$ divides $F_n$, where $F_n$ represents the n-th Fibonacci number?
Is it true that there exists $n \in \mathbb{N}$ with arbitrarily many prime factors such that $n$ divides $F_n$, where $F_n$ represents the n-th Fibonacci number?
