Concept
Integer
Related lectures (96)
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Holomorphic Functions: Taylor Series Expansion
Covers the basic properties of holomorphic maps and Taylor series expansions in complex analysis.
Relations in Computer Science
Explores the properties of relations in computer science, including equivalence relations and the partition of a set.
Temporal Complexity: Concrete ExampleMOOC: Information, Calcul, Communication: Introduction à la pensée informatique
Explores temporal complexity through a concrete example with positive and negative integers.
Number Theory: Congruence
Explains congruence modulo m and its applications in arithmetic operations.
Montgomery Multiplication
Covers Barrett reduction, Montgomery form of integers, and efficient Montgomery product computation.
Prime Numbers: Finding and Testing
Covers the definition of a function to determine if a given number is prime.
Quantum Random Number Generation
Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.
Binary Integer RepresentationMOOC: Information, Calcul, Communication: Introduction à la pensée informatique
Covers the binary representation of integers, including positive and negative numbers.
Functions and Integers
Covers functions, integers, GCD, and reasoning by recurrence, including the Euclidean algorithm and induction principle.