The Distribution of Self-Fibonacci Divisors
Abstract
Consider the positive integers n such that n divides the n-th Fibonacci number, and their counting function A. We prove that \[A(x) ≤ x1-(1/2+o(1)) x/ x.\]
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.