Theory of numbers: Multiplicative functions

Theory of numbers: Multiplicative functions

by Richard E Borcherds

Formal & Physical Sciences Mathematics PBMathematicsPBHNumber theory
🎙 Richard E Borcherds 👥 82K 📅 January 26, 2021 ⏱ 30 min 👁 10K 📄 lecture 🧭 2026-08-17
Available in: English (current) Français

Keywords

multiplicative functionarithmetic functiondivisor functionEuler's totientDirichlet series

Summary

This lecture introduces multiplicative functions, a class of arithmetic functions satisfying f(mn)=f(m)f(n) for coprime m,n. The instructor begins with examples like the divisor function σ0(n), which counts divisors, and shows how to compute it via prime factorization. He then discusses the average order of σ0(n), deriving that it is approximately log n. Next, he introduces the sum of divisors function σ1(n) and the sum of squares of divisors σ2(n), demonstrating their multiplicativity and providing formulas. The lecture also covers additive functions like ω(n) and Ω(n), which count distinct and total prime factors, and shows that their average order is log log n, a slowly growing function. Finally, Euler’s totient function φ(n) is defined and a formula is derived using inclusion-exclusion, proving its multiplicativity. The lecture concludes by hinting at Dirichlet series as a tool for studying multiplicative functions in the next session.

142 words

Critical Evaluation

Value of the Information & Strength of the Argument

The lecture provides a solid introduction to multiplicative functions, with clear definitions, examples, and derivations. The argumentation is rigorous, building from basic definitions to more complex concepts. The instructor uses concrete computations and intuitive explanations, such as the probabilistic interpretation of φ(n), to enhance understanding. The value lies in its pedagogical clarity and the foundational knowledge it imparts for further study in analytic number theory.

Scientific Rigor, Source Quality, Title Accuracy

The lecture is mathematically rigorous, with all claims either proven or stated as known results (e.g., Euler’s estimate for the sum of reciprocals of primes). No external sources are cited, but the content is standard and well-established. The title accurately reflects the content, which focuses on multiplicative functions. The lecture is part of a structured course, and the instructor’s expertise ensures reliability.

142 words

Title / Content Match

The title accurately reflects the content, which focuses on multiplicative functions in number theory.

Quality & Reliability

9/10

Lecture by a renowned mathematician, rigorous definitions and proofs, clear explanations, no unsubstantiated claims.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Cited Sources

Concurring Sources

Contribution & Novelties

This lecture provides a clear and rigorous introduction to multiplicative functions, a fundamental concept in number theory. It covers key examples, derivations of formulas, and average orders, setting the stage for more advanced topics like Dirichlet series. The pedagogical approach is effective, making complex ideas accessible.

Pour aller plus loin :

100 words

Radar Profile

The radar profile shows high scores across all dimensions, indicating a well-balanced and reliable educational content. The lecture excels in quality and reliability, with strong technical depth and adequate information density.

Reliability 9/10