A logarithmic analogue of Alladi's formula
Abstract
Let μ(n) be the M\"obius function. Let P-(n) denote the smallest prime factor of an integer n. In 1977, Alladi established the following formula related to the prime number theorem for arithmetic progressions \[ -Σn≥ 2\\ P-(n) ( modk)μ(n)n=1(k) \] for positive integers , k with (,k)=1, where is Euler's totient function. In this note, we will show a logarithmic analogue of Alladi's formula in an elementary proof.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.