Answers are grounded in this paper and cite their sources.
This note establishes an exact formula for counting digit blocks in Fibonacci numbers modulo powers of an odd prime. If the prime’s Fibonacci rank r is odd and p² does not divide F_r, then every block of length L in digit positions j through j+L−1 occurs exactly 4r·p^(j−1) times in one complete period modulo p^(j+L). The base-5 case follows from Niederreiter’s result. The broader result is related to the p-adic framework of Bragman and Rowland. It concerns periodic arrays of Fibonacci residues and does not prove that the concatenation of Fibonacci numbers is normal.
No takes yet. Share an insight, caveat, or question.
Dieter Eigler (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: