arXiv (All)
open access
The Distribution of Self-Fibonacci Divisors
Consider the positive integers $n$ such that $n$ divides the $n$-th Fibonacci number, and their counting function $A$. We prove that \[A(x) \leq x^{1-(1/2+o(1))\log\log\log x/\log\log x}.\]
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Le carré de la fonction des diviseurs#1353485
- Piercing boxes and products of trees#1341591
- Logarithmic returns of top 100 cryptos (2015-2022)#205106
- Weighted Versions of the Arithmetic-Mean-Geometric Mean Inequality and Zaremba's Function#1110048
- The exponent of harmonic LCM avoidance#975319
Record · ID 1215324
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive