Lecture notes on number theory for computer science students
By
[Submitted on 18 Jun 2026]
Summary
This e-book collects lecture notes on elementary and intermediate number theory aimed at computer science students. It covers five thematic areas: introductory topics (divisibility, primes, modular arithmetic), advanced topics (Euler's totient, Chinese remainder theorem, Fermat's/Euler's theorems), primitive roots and quadratic residues with cryptographic applications, primality testing algorithms (Miller, Rabin, Solovay-Strassen), and an introduction to advanced number theory (multiplicative functions, Möbius function, Dirichlet products). The material is suitable for undergraduate and graduate computer science students, particularly as background for cryptography courses.
Source
Twitter / XLecture notes on number theory for computer science studentsarxiv.orgKey quotes
· 4 pulledThis brief, in the form of an e-book, is a collection of notes that cover elementary and medium level number theory with a target audience of primarily computer science students.
It can be used in the number theory portion of a discrete mathematics course, or a course on the mathematical foundations of computer science, or as background material for a cryptography course.
Different parts of this e-book are for freshman to senior undergraduate students in computing and in particular computer science.
Graduate students with limited exposure to number theory can use it to acquire a background suitable for typical cryptography courses at the master's level.
You might also wanna read
Lean proof of Fermat's Last Theorem [pdf]
Elementary Discrete Mathematics Course for Science and Engineering at MIT
This article discusses a course on elementary discrete mathematics for science and engineering, focusing on mathematical tools and proof tec
Discrete Mathematics: An Open Introduction [pdf]
Understanding the P vs NP Problem: A Primer on Computational Complexity Theory
The article is a personal reflection on the P vs NP problem in computer science, sparked by the author's dream about P=NP. It serves as an i
adlrocha.substack.com·6mo ago
An Interactive Introduction to Elliptic Curve Cryptography: From Mathematics to Practical Applications
This article provides an interactive introduction to Elliptic Curve Cryptography (ECC), explaining how it enables secure communication over
growingswe.com·4mo ago
Imperial College London Leads Open-Source Project to Formalize Fermat's Last Theorem Proof
An ongoing multi-author open-source project led by Kevin Buzzard aims to formalize the proof of Fermat's Last Theorem using the Lean theorem
github.com·11mo ago
Comments
Sign in to join the conversation.
No comments yet. Be the first.