Concept
Coprime integers
Related lectures (146)
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Proofs: Logic, Mathematics & Algorithms
Explores proof concepts, techniques, and applications in logic, mathematics, and algorithms.
Relations in Computer Science
Explores the properties of relations in computer science, including equivalence relations and the partition of a set.
Prime Numbers and Primality Testing
Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.
Optimization Algorithms: Greedy Approach
Explores optimization problems and greedy algorithms for efficient decision-making.
Sequences and Convergence
Explores sequences, convergence criteria, and accumulation points in sequences.
Predicate Logic: Quantifiers, CNF, DNF
Covers Predicate Logic, focusing on Quantifiers, CNF, and DNF.
Temporal Complexity: Concrete ExampleMOOC: Information, Calcul, Communication: Introduction à la pensée informatique
Explores temporal complexity through a concrete example with positive and negative integers.
Integers Representation: Sign vs. Two's Complement
Explores integer representation methods, comparing sign-and-magnitude with two's complement, and introduces fixed-point and floating-point representations.
Complexity of Algorithms: Proofs of Time Complexity
Covers the analysis of worst time complexity for algorithms and time complexity with real numbers and integers.