Integer
One word, taught differently in 2 fields. Each use is given apart.
In Mathematics
The set of numbers denoted by consisting of zero, the positive integers, and the negative integers.
In Systems & CS
A whole number without a decimal point, represented in Python as the int type.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
In Mathematics
2Each in their own terms, from the easiest level.
Casey Rodriguez
The set of natural numbers along with their additive inverses and zero.
In Systems & CS
1David J. Malan
Lectures that assume it
46The first 12 are shown.
- Introduction and Proofs
- Chain Rule; Higher Derivatives
- Cantor's Theory of Cardinality (Size)
- Conditionals
- Hashing with Chaining, Simple Uniform Hashing & Universal Families
- Experimental Facts of Life — Photoelectric Effect, Double Slit & Bell
- Functions
- Divide and Conquer Recurrences
- Algebra of Sets, De Morgan's Laws, Truth Tables & Cardinality
- Strings, Input/Output, and Branching in Python
- Complexity: P, NP, NP-completeness, Reductions
- Gamma Distribution and Poisson Process
Connections
59The lectures that define it or assume it, and the concepts next to it.
Concepts9
Show 3 moreShow fewer
Lectures50
- Sets, Set Operations and Mathematical Induction
- Functions, Variables
- C Programming
- Natural Numbers, Well-Ordering & Mathematical Induction
- Introduction and Proofs
- Chain Rule; Higher Derivatives
Show 44 moreShow fewer
- Cantor's Theory of Cardinality (Size)
- Conditionals
- Hashing with Chaining, Simple Uniform Hashing & Universal Families
- Experimental Facts of Life — Photoelectric Effect, Double Slit & Bell
- Functions
- Divide and Conquer Recurrences
- Algebra of Sets, De Morgan's Laws, Truth Tables & Cardinality
- Strings, Input/Output, and Branching in Python
- Complexity: P, NP, NP-completeness, Reductions
- Gamma Distribution and Poisson Process
- The Complex Numbers
- Integer Arithmetic, Karatsuba Multiplication
- How Hard is too Hard? An Introduction to Complexity
- Streams, Part 2 (1986)
- OLTP vs. OLAP Storage Models & Database Compression
- Arrays
- The Dynamics of Homogeneous Expansion, Part II
- Number Theory for PKC: Euclidean Algorithm, Euler's Phi Function & Euler's Theorem
- Binary Relations, Partitions & Equivalence Relations
- Diffie-Hellman Key Exchange and the Discrete Log Problem
- Toda's 1st Theorem and the Permanent
- Memory
- Number Theory I
- Number Theory II
- TM Variants, Church-Turing Thesis
- Modular Arithmetic and Historical Ciphers
- The Importance of Mathematics
- Computation History Method
- Modular Arithmetic
- Constructing the Rational Numbers
- Fermat's Last Theorem: Abelian and Non-Abelian Approaches
- Liquid Vector Spaces and Condensed Mathematics
- Computational Models: Turing Machines
- All Non-Trivial Variants of 3-LDT
- Floats and Approximation Methods
- 25 Years of Mathematical Thrills
- Python
- Our Solar System and the Pluto Problem
- Parallel Hash Join Algorithms
- On the Strong Density Conjecture for Apollonian Circle Packings
- Planetary Orbits
- List Access, Hashing, Simulations, and Course Wrap-Up
- Formal Logical Notation, Quantifiers & Constructing Mathematical Proofs
- AtomVM Landscape: Recent Improvements and Project Roadmap