Mathematics

Introduction to number theory lecture 7. Binomial coefficients.

Introduction to number theory lecture 6. Multiplicative functions.

Introduction to number theory lecture 5. Primes.

The Central Binomial Coefficient || @ CMU || Recitation 1 of CS Theory Toolkit

Methodological frames: mathematical structuralism and proof theory

Introduction to number theory lecture 4. More on Euclid's algorithm

Introduction to number theory lecture 3: Divisibility and Euclid's algorithms.

Introduction to number theory lecture 2: Survey.

Introduction to number theory lecture 1.

GG ChiSquared Overview

What is concrete incompleteness?

Zermelo Fraenkel Choice

Zermelo Fraenkel Separation and replacement

Zermelo Fraenkel Powerset

Zermelo Fraenkel Infinity

Zermelo Fraenkel Pairing and union

Zermelo Fraenkel Foundation

Zermelo Fraenkel Extensionality

Zermelo Fraenkel Introduction

Zermelo Fraenkel Introduction

Cayley's tree formula (after Andre Joyal)

Categories 7 Yoneda's lemma

A general numerical optimization pattern/algorithm

How Imaginary Numbers Were Invented

RIngs 22 Hensel's lemma

Rings 21 Formal power series

Rings 20 Resultants

RIngs 19 Symmetric functions

Why do we need the Lebesgue integral in probability?

Rings 18 Hilbert's theorems

Rings 17 Noetherian rings

Rings 16 Factorization of polynomials

RIngs 15 Polynomials

Continuous functions from a compact space to R are bounded

RIngs 14 Limits and exactness

Beyond the Mandelbrot set, an intro to holomorphic dynamics

Rings 13 Colimits and exactness

Rings 12 Duality and injective modules

Newton’s fractal (which Newton knew nothing about)

Categories 6 Monoidal categories

Rings 11 Tensor products of modules