Arithmetic group

Related lectures (29)

Page 2 of 3

Covers dynamical systems on homogeneous spaces and their interactions with number theory.

Covers modular arithmetic operations and polynomial calculations modulo N with various examples.

Covers number theory, division, remainder, congruence, prime numbers, integer representation, and the Euclidean algorithm.

Explores modular arithmetic and its role in the RSA cryptosystem for error detection.

Introduces modulo arithmetic, Euclid's algorithm, and congruence in number theory.

Explores Fermat's Little Theorem, its extensions, primality testing algorithms, and the significance of prime numbers in cryptography.

Covers examples of modular exponentiation, complexities, Lame's Theorem, Collatz Conjecture, and prime numbers.

Explores modular arithmetic, emphasizing inverses and equations in Z/mZ, with practical examples and exercises.

Explores modulo arithmetic rules and check digits for data accuracy.

Explores the verification of programs using Stainless, focusing on functional correctness, proof assistants, and automation of reasoning tasks.