Lectures related to Arithmetic Fundamentals: Equivalence and Irreducibility

Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.

Introduces sets, maps, divisors, prime numbers, and arithmetic principles related to integers.

Explores Gaussian integers, prime factorization, and number theory concepts related to prime numbers.

Introduces greatest common divisor, prime factorization, and the Euclidean Algorithm.

Covers GCD, LCM, and the Euclidean algorithm for efficient computation of GCD.

Covers integers, rings, subrings, invertibility, divisors of zero, and equivalence relations in formal fractions.

Covers GCD, LCM, and the Euclidean algorithm for efficient computation.

Explores prime numbers, coprime integers, and their properties in number theory.

Covers binary addition, prime numbers, and the sieve of Eratosthenes in number theory.

Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.

Covers groups, rings, number theory, atomic bonds, and materials structure, setting the foundation for further exploration.

Covers the basics of Shor's algorithm for factoring integers and the steps involved in the quantum algorithm.

Explores the history and concepts of Number Theory, including divisibility and congruence relations.

Covers the definition of a function to determine if a given number is prime.

Covers Lenstra's Algorithm for integer factorization, which efficiently computes prime factors of an integer.

Delves into the complexity of factoring polynomials and the implications for security.

Covers integers, rationals, logic, proof techniques, functions, and relations using examples and truth tables.

Explores reciprocity, equivalence, and proof techniques in linear algebra, emphasizing logical reasoning and mathematical rigor.

Covers prime numbers, unique decomposition of natural numbers into prime factors, and practical implications for calculations.

Introduces Cartesian product and induction for proofs using integers and sets.