Introduction to number theory lecture 16. More numerical calculation @richarde.borcherds7998

Uploaded February 2022 | Updated September 2026, 1 week ago

This lecture is part of my Berkeley math 115 course "Introduction to number theory"
For the other lectures in the course see youtube.com/playlist?list=PL8yHsr3EFj53L8sMbzIhhXSAOpuZ1Fov8

We give some more examples of numerical algorithms, such as as algorithm to find square roots of -1, and a factoring algorithm, and a prime testing algorithm that works on some Carmichael numbers.

The textbook is "An introduction to the theory of numbers" by Niven, Zuckerman, and Montgomery (5th edition).

Introduction to number theory lecture 16. More numerical calculation

Introduction to number theory lecture 6. Multiplicative functions.

Introduction to number theory lecture 35 Jacobi symbol

Complex analysis: Classification of elliptic functions

Introduction to number theory lecture 42. Examples of indefinite binary quadratic forms.

Vinberg lecture part 2. The reflection group of II25,1