Math 2.0

definition

von Mangoldt function

Definition

The von Mangoldt function Λ\Lambda is the arithmetic function given, for each positive integer nn, by Λ(n)={log⁡pif n=pk for a prime p and an integer k≥1,0otherwise.\Lambda(n) = \begin{cases} \log p & \text{if } n = p^k \text{ for a prime } p \text{ and an integer } k \ge 1, \\ 0 & \text{otherwise}. \end{cases} Here log⁡\log is the natural logarithm. The word prime has the meaning of the definition of a prime number.

Remarks

For example, Λ(8)=log⁡2\Lambda(8) = \log 2, Λ(7)=log⁡7\Lambda(7) = \log 7, and Λ(1)=Λ(6)=0\Lambda(1) = \Lambda(6) = 0. For each positive integer nn, ∑d∣nΛ(d)=log⁡n\sum_{d \mid n} \Lambda(d) = \log n. The function Λ\Lambda is not multiplicative. It is named after Hans von Mangoldt. The sum ψ(x)=∑n≤xΛ(n)\psi(x) = \sum_{n \le x} \Lambda(n) is the second Chebyshev function. The prime number theorem is equivalent to ψ(x)∼x\psi(x) \sim x.

Explanations

L1 human

The von Mangoldt function puts the weight log⁡p\log p on each prime power pkp^k, and 00 on all other numbers. With these weights, the divisor sums give exactly log⁡n\log n, which makes the function useful in the study of primes.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Divisibility definition
  2. Prime number definition
  3. von Mangoldt function definition

Sources

  1. Web https://en.wikipedia.org/wiki/Von_Mangoldt_function, Definition