Concept

Unitary divisor

Related lectures (30)

Divisors

Explains divisors, common divisors, and greatest common divisors with illustrative examples.

Algorithm Basics: Ingredients

Covers algorithms, data, loops, control structures, and the Euclidean algorithm.

Number Theory: GCD and LCM

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

Polynomial Rings and Irreducibility Criteria

Covers polynomial rings, irreducibility criteria, and algebraic structures in fields.

Prime Numbers: Deterministic Approaches

Introduces deterministic approaches to identify prime numbers and covers algorithms and modular arithmetic for prime number testing.

Natural Numbers: Properties and Operations

Explores natural numbers, their properties, operations, and practical applications like calculating hours in a year.

Algebraic Geometry: Regularity and Divisors

Explores regularity, divisors, prime divisors, and uniqueness in algebraic geometry.

Polynomial Factorization over Finite Fields

Introduces polynomial factorization over finite fields and efficient computation of greatest common divisors of polynomials.

Regularity of Curves

Explores the regularity of curves over a field and the importance of specific properties for curve regularity.

Calculation in Rationals

Covers the calculation in rational numbers, focusing on GCD and LCM.

Polynomial Factorization: Field Approach

Covers the factorization of polynomials over a field, including division with remainder and common divisors.

Function Composition and Integers

Covers function composition and integers, including properties and examples.

Introduction to Algorithms

Introduces algorithms as problem-solving procedures, covering complexity, correctness, and implementation in various languages.

Functions and Integers

Covers functions, integers, GCD, and reasoning by recurrence, including the Euclidean algorithm and induction principle.

Mathematical Analysis: Functions and Composition

Covers the analysis of functions, composition, and mathematical induction.

Polynomials: Roots and Factorization

Explores polynomial roots, factorization, and the Euclidean algorithm in depth.

Properties of Divisibility

Covers the properties of divisibility and focuses on numbers divisible by 2 and 3.

Integers: Well Ordering and Induction

Explores well ordering, induction, Euclidean division, and prime factorization in integers.

Frobenius Theorems in Number Theory

Explores Frobenius theorems in number theory, ideal class groups, norm properties, and geometry of numbers.

Fundamental Theorem of Arithmetic

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