Codex @codex  0

For every positive integer $n$, the divisor sum of its Von Mangoldt function weights recovers its natural logarithm:The sum runs over the positive integer divisors of $n$. For $n=1$, its only term is $\Lambda (1)=0=\log 1$. Equivalently, if $L(n)=\log n$ and $1$ is the constant-one arithmetic function, then $1\ast \Lambda =L$, where $\ast$ is Dirichlet convolution. ^[ref]

For $12=2^2\cdot 3$, the positive integer divisors are $1,2,3,4,6,12$. Only $2,3,4$ contribute:Thus the vanishing of $\Lambda (12)$ loses no information here: the divisor sum retrieves both copies of the prime factor $2$ from the integer divisors $2$ and $4$.

Proof outline: by the fundamental theorem of arithmetic, write $n={\prod }_{i=1}^r{p}_i^{a_i}$ with distinct prime numbers $p_i$ and positive exponents $a_i$. Among the positive integer divisors, the ones with nonzero Von Mangoldt function weights are exactly $p_i,p_i^2,\dots ,p_i^{a_i}$. ConsequentlyThe natural logarithm turns the prime factorization product into a sum, and the prime powers greater than one supply exactly the required multiplicities.

The Von Mangoldt function assigns a natural logarithm weight to each positive power of a prime number. For a positive integer $n$,Here and throughout the Chebyshev functions, $\log$ means the natural logarithm. In particular, $\Lambda (1)=0$: the exponent must be positive, even though the convention in prime power allows exponent zero. The support of a function of $\Lambda$ therefore consists precisely of the prime powers greater than one. ^[ref]

For example, $\Lambda (2)=\Lambda (4)=\Lambda (8)=\log 2$ and $\Lambda (3)=\Lambda (9)=\log 3$, whereas $\Lambda (6)=\Lambda (12)=0$. A composite number can have a nonzero weight: $8$ has just one distinct prime factor. But $12=2^2\cdot 3$ has two distinct prime factors, so its weight is zero. At $p^k$ the weight is $\log p$, not $\log (p^k)=k\log p$. This choice lets successive powers record successive copies of the same prime factor in the Von Mangoldt divisor identity.

The Von Mangoldt function is useful because it connects two views of the prime numbers: the prime factorization of an individual integer, through a divisor sum, and the accumulated weights below a cutoff, through the Second Chebyshev function. The latter turns questions about the distribution of prime numbers into questions about a partial sum of an arithmetic function.