Introduction to number theory lecture 23. Primitive roots.

Introduction to number theory lecture 23. Primitive roots.

Formal & Physical Sciences Mathematics PBMathematicsPBHNumber theory
🎙 Richard E Borcherds 👥 82K 📅 February 23, 2022 ⏱ 35 min 👁 9K 📄 lecture 🧭 2026-08-17
Available in: English (current) Français

Keywords

primitive rootorderEuler's totientprimemodular arithmetic

Summary

This lecture from Berkeley’s Math 115 course introduces primitive roots modulo m. The instructor defines the order of an element and Euler’s totient function, then explains that a primitive root is an element of maximal order. Through examples for small moduli, he illustrates which numbers have primitive roots and which do not. He proves that every prime has a primitive root using a counting argument based on polynomial roots and the identity sum of phi(d) = n. He also discusses the number of primitive roots, which is phi(phi(m)) when they exist, and gives a method to find them by testing powers. The lecture concludes by outlining the classification of numbers with primitive roots, leaving prime powers for the next lecture.

120 words

Critical Evaluation

Value of the Information & Strength of the Argument

The lecture provides a clear and rigorous introduction to primitive roots, building from definitions to a full proof that every prime has a primitive root. The argumentation is solid, using counting arguments and key theorems. The instructor also gives practical methods for finding primitive roots, which adds value for students.

Scientific Rigor, Source Quality, Title Accuracy

The lecture is rigorous, with proofs and references to a standard textbook. The title accurately describes the content. The instructor is a well-known mathematician, adding to credibility. No external sources are cited beyond the textbook and course playlist.

103 words

Title / Content Match

The title accurately reflects the content, which is a focused lecture on primitive roots in number theory.

Quality & Reliability

9/10

Lecture by a renowned mathematician (Fields Medalist) for a university course, rigorous proofs, and references to a standard textbook.

Key Moments

Cited Sources

Concurring Sources

  • An Introduction to the Theory of Numbers — Textbook referenced in the video.

Contribution & Novelties

The lecture provides a clear and rigorous introduction to primitive roots, building from definitions to a full proof that every prime has a primitive root. The argumentation is solid, using counting arguments and key theorems. The instructor also gives practical methods for finding primitive roots, which adds value for students.

Pour aller plus loin :

91 words

Radar Profile

The radar profile shows high scores in information quantity and quality, with a slightly lower technical level, indicating a lecture that is dense but accessible to advanced undergraduates.

Reliability 9/10