Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Integers: Sets, Maps, and Principles

In course

MATH-310: Algebra

This is an introduction to modern algebra: groups, rings and fields. ...

Description

This lecture covers the fundamental concepts related to integers, including sets operations, injective and surjective maps, natural numbers, well-ordering principle, induction principle, divisors, prime numbers, Euclid's lemma, greatest common divisor, least common multiple, long division theorem, and the Euclidean algorithm. The instructor explains the uniqueness of prime factorization, the fundamental theorem of arithmetic, and Bézout's theorem. The lecture also introduces the Euler's totient function and its application in finding the number of positive integers coprime to a given integer.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Anna Lachowska

Official source

Ontological neighbourhood

Mathematics

Algebra: Abstract algebra

Number theory: Topics in number theory

Related concepts (32)

Coprime integers

In number theory, two integers a and b are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides a does not divide b, and vice versa. This is equivalent to their greatest common divisor (GCD) being 1. One says also a is prime to b or a is coprime with b. The numbers 8 and 9 are coprime, despite the fact that neither considered individually is a prime number, since 1 is their only common divisor.

Gaussian integer

In number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as or Gaussian integers share many properties with integers: they form a Euclidean domain, and have thus a Euclidean division and a Euclidean algorithm; this implies unique factorization and many related properties. However, Gaussian integers do not have a total ordering that respects arithmetic.

Prime number

A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4.

Divisor

In mathematics, a divisor of an integer , also called a factor of , is an integer that may be multiplied by some integer to produce . In this case, one also says that is a multiple of An integer is divisible or evenly divisible by another integer if is a divisor of ; this implies dividing by leaves no remainder. An integer n is divisible by a nonzero integer m if there exists an integer k such that . This is written as Other ways of saying the same thing are that m divides n, m is a divisor of n, m is a factor of n, and n is a multiple of m.

Algebraic integer

In algebraic number theory, an algebraic integer is a complex number which is integral over the integers. That is, an algebraic integer is a complex root of some monic polynomial (a polynomial whose leading coefficient is 1) whose coefficients are integers. The set of all algebraic integers A is closed under addition, subtraction and multiplication and therefore is a commutative subring of the complex numbers. The ring of integers of a number field K, denoted by OK, is the intersection of K and A: it can also be characterised as the maximal order of the field K.

Related lectures (27)

Elementary Algebra: Numeric Sets

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

Number Theory: GCD and LCM

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

Prime Numbers and Primality Testing

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

Number Theory: Greatest Common Divisor and Prime Factorization

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