2022/03/24 by Vorrapan Chandee, Xiannan Li, Chandee, Vorrapan +5
Mathematics · Computer Science · #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms
paper · pdf · doi:10.48550/arxiv.2203.13117
We provide a criterion to determine whether a real multiplicative function is a strong Benford sequence. The criterion implies that the k-divisor functions, where k ≠ 10j, and Hecke eigenvalues of newforms, such as Ramanujan tau function, are strong Benford. Moreover, we deduce from the criterion that the collection of multiplicative functions which are not strong Benford forms a group under pointwise multiplication. In contrast to earlier work, our approach is based on Halász's Theorem.