Mathematics RU

Mathematics

Algorithms

Every chapter of the course by topic, level and part. You can pick several topics at once — say, “Puzzles” and “Probability”.

1 Counting: from notches to bits How do you write a number too big for your fingers or for notches on a stick? A walk through the halls of a museum of counting, from a notched bone to binary code, to see how people learned to pack any number into a few signs. Ages 11–15 40 min 4 Divisibility and Euclid's algorithm Puzzles about a calendar, a long number, tiles, jugs and coins, and one answer to all of them: the greatest common divisor, and a way to find it that is more than two thousand years old. Ages 11–15 40 min 36 Gaussian elimination How to find a lost planet from a few observations: turn a system of many equations into a staircase and read the answer from the bottom up. The steps show at once whether the system has one solution, infinitely many or none. Years 1–2 55 min 38 Eigenvectors A matrix usually turns vectors, but many matrices have directions they only stretch. Let’s find them, and it will turn out that the Fibonacci numbers, the Google search engine and a tilted ellipse all work the same way. Years 1–2 50 min 39 Orthogonality, least squares and SVD A data lab: the measurements won’t lie on a line, a cloud of points is stretched on a slant, a photograph takes up too much space. One idea copes with all three problems: drop a perpendicular. Years 1–2 60 min 41 Modular arithmetic and ciphers How do you agree on a secret when everyone can hear your conversation? A cipher-maker’s workshop: Caesar’s wheel, key exchange, RSA, and the arithmetic of remainders on which each of these locks rests. Years 1–2 55 min 42 Rings, fields and codes How do you correct an error in a message when you can’t ask for it again? An engineer’s logbook: from triple repetition and Hamming’s three circles to Galois fields and the Reed–Solomon codes hidden in every QR code. Years 1–2 55 min 46 Graphs A walk round town: bridges, crossroads, roads and maps. Euler reduced a city to nothing but points and the lines between them, and solved the bridge problem. The same trick is used today to plan routes, draw up timetables and colour maps. Ages 16–18 45 min 50 Markov chains and information The letters of a text depend on the ones before them, the weather on yesterday’s. We’ll count this dependence as Markov did in Eugene Onegin, and measure how much information a letter carries, as Shannon did. Years 1–2 50 min 56 Gödel, Turing and the limits of proof A puzzle with four rules, a number that talks about itself, and a program that can’t be written. In 1931 Gödel proved that arithmetic has true but unprovable statements, and in 1936 Turing proved that some questions can’t be settled by any algorithm. Years 1–2 65 min 60 The frontier The course ends where the answers end. A map of the unknown: the Millennium Problems, the Collatz conjecture, P versus NP; how mathematics is done today, together, with computers, Lean and AI; and a return to the seven questions we started with. Year 3 and up 55 min