Remove extra files

Misc/Moscow Puzzles/main.tex

@@ -1,36 +0,0 @@
-% use [nosolutions] flag to hide solutions.
-% use [solutions] flag to show solutions.
-\documentclass[
-	solutions
-]{../../../lib/tex/ormc_handout}
-\usepackage{../../../lib/tex/macros}
-
-
-\usepackage{subfiles}
-\usepackage{graphicx}
-\graphicspath{ {./images} }
-
-
-\uptitlel{Intermediate 2}
-\uptitler{\smallurl{}}
-\title{Warm - Up}
-\subtitle{
-	Prepared by Mark on \today \\
-	\medskip
-	These problems were originally found in \\
-	Boris Kordemsky's \textit{The Moscow Puzzles}
-}
-
-\begin{document}
-
-	\maketitle
-
-	\subfile{problems/217}
-	\vfill
-	\pagebreak
-
-	\subfile{problems/101}
-	\vfill
-	\pagebreak
-
-\end{document}

Misc/Moscow Puzzles/problems/101.tex

@@ -1,23 +0,0 @@
-\documentclass[../main.tex]{subfiles}
-
-\begin{document}
-
-	\problem{The Courageous Garrison}
-
-	A courageous garrison was defending a snow fort. The commander arranged his forces as shown in the square frame (the inner square showing the garrison's total strength of 40 boys): 11 boys defending each side of the fort.
-
-	\begin{figure}[h]
-		\centering
-		\includegraphics[width=12cm]{101a}
-	\end{figure}
-
-	The garrison ``lost'' 4 boys during each of the first, second, third, and fourth assaults and 2 during the fifth and last. But after each charge 11 boys defended each side of the snow fort. How?
-
-	\vfill
-
-	\begin{figure}[h]
-		\centering
-		\includegraphics[width=4cm]{101b}
-	\end{figure}
-
-\end{document}

Misc/Moscow Puzzles/problems/110.tex

@@ -1,16 +0,0 @@
-\documentclass[../main.tex]{subfiles}
-
-\begin{document}
-
-	\problem{Knight's Move}
-
-	To solve this problem you need not be a chess player. You need only know the way a knight moves on the chessboard: two squares in one direction and one square at right angles to the first direction. The diagram shows 16 black pawns on a board.
-
-	\begin{figure}[h]
-		\centering
-		\includegraphics[width=12cm]{110}
-	\end{figure}
-
-	Can a knight capture all 16 pawns in 16 moves?
-
-\end{document}

Misc/Moscow Puzzles/problems/120.tex

@@ -1,24 +0,0 @@
-\documentclass[../main.tex]{subfiles}
-
-\begin{document}
-
-	\problem{One Hundred and Forty-Five Doors}
-	A prisoner was thrown into a medieval dungeon with 145 doors. Nine, shown by black bars, are locked, but each one will open if before you reach it you pass through exactly 8 open doors. \\
-	You don't have to go through every open door but you do have to go through every cell and all 9 locked doors. If you enter a cell or go through a door a second time, the doors clang shut, trapping you. \\
-
-	\medskip
-
-	The prisoner (in the lower right corner cell) had a drawing of the dungeon. He thought a long time before he set out. He went through all the locked doors and escaped through the last, upper left corner one. What was his route?
-
-	\begin{figure}[h]
-		\centering
-		\includegraphics[width=8cm]{120}
-	\end{figure}
-
-
-	\begin{figure}[h]
-		\centering
-		\includegraphics[width=8cm]{120}
-	\end{figure}
-
-\end{document}

Misc/Moscow Puzzles/problems/121.tex

@@ -1,37 +0,0 @@
-\documentclass[../main.tex]{subfiles}
-
-\begin{document}
-
-	\problem{How Does the Prisoner Escape?}
-
-	This dungeon has $49$ cells. In $7$ cells ($A$ to $G$ in the diagram) there is a locked door (black bar). The keys are in cells $a$ to $g$ respectively. The other doors open only from one side, as shown. \\
-
-	\medskip
-
-	How does the prisoner in cell $O$ escape? He can pass through any door any number of times and need not unlock the doors in any special order. His aim is to get the key from cell $g$ and use it to escape through cell $G$
-
-	\vfill
-
-	\begin{figure}[h]
-		\centering
-		\includegraphics[width=8cm]{121}
-	\end{figure}
-	\vfill
-
-	Extra copies of the dungeon are on the next page.
-	\pagebreak
-
-	\vfill
-	\begin{figure}[h]
-		\centering
-		\includegraphics[width=8cm]{121}
-	\end{figure}
-	\vfill
-	\begin{figure}[h]
-		\centering
-		\includegraphics[width=8cm]{121}
-	\end{figure}
-	\vfill
-	\pagebreak
-
-\end{document}

Misc/Moscow Puzzles/problems/217.tex

@@ -1,9 +0,0 @@
-\documentclass[../main.tex]{subfiles}
-
-\begin{document}
-
-	\problem{Mutual Aid}
-
-	During the rebuilding after World War II, the Soviet Union was short of tractors. The machine and tractor stations would lend each other equipment as needed. Three machine and tractor stations were neighbors. The first lent the second and third as many tractors as they each already had. A few months later, the second lent the first and third as many as they each had. Still later, the third lent the first and second as many as they each already had. Each station now had 24 tractors. How many tractors did each station originally have?
-
-\end{document}

Misc/Moscow Puzzles/problems/239.tex

@@ -1,16 +0,0 @@
-\documentclass[../main.tex]{subfiles}
-
-\begin{document}
-
-	\problem{The Air Parade}
-
-	Volodya asked, ``What plane did you fly during the air parade?'' His father sketched a formation of 9 planes.
-
-	\begin{figure}[h]
-		\centering
-		\includegraphics[width=9cm]{239}
-	\end{figure}
-
-	``The number of planes to the right of me multiplied by the number of planes to the left of me is 3 less than it would have been if my plane had been 3 places to the right of me.'' How did Volodya solve the problem?
-
-\end{document}

Misc/Moscow Puzzles/problems/252.tex

@@ -1,40 +0,0 @@
-\documentclass[../main.tex]{subfiles}
-
-\begin{document}
-
-	\problem{An Elephant and a Mosquito}
-
-	Does the weight of an elephant equal the weight of a mosquito? Let $x$ be the weight of an elephant, and $y$ that of a mosquito.
-
-	\begin{figure}[h]
-		\centering
-		\includegraphics[width=10cm]{252}
-	\end{figure}
-
-	Call the sum of the two weights $2v$, then $x + y = 2v$.
-
-	From this equation we can obtain two more:
-
-	\[
-		x - 2v = -y \text{; } x = - y + 2v
-	\]
-
-	Multiply:
-	\[
-		x^2 - 2vx = y^2 - 2vy
-	\]
-
-	Add $v^2$:
-	\[
-		x^2 - 2vx + v^2 = y^2 - 2vy + v^2 \text{, or } (x - v)^2 = (y - v)^2
-	\]
-
-	Take square roots:
-	\[
-		x - v = y - v \text{; } x = y
-	\]
-
-	That is, the elephant's weight ($x$) equals the mosquito's weight ($y$). What is wrong here?
-
-
-\end{document}

Misc/Moscow Puzzles/problems/255.tex

@@ -1,16 +0,0 @@
-\documentclass[../main.tex]{subfiles}
-
-\begin{document}
-
-	\problem{The Lucas Problem}
-
-	This problem was invented by Edouard Lucas, a French nineteenth-century mathematician. \\
-	``Every day at noon,'' Lucas said, ``a ship leaves Le Havre for New York and another ship leaves New York for Le Havre. The trip lasts 7 days and 7 nights. How many New York-Le Havre ships will the ship leaving Le Havre today meet during its journey to New York? Can you answer graphically?
-
-	\begin{figure}[h]
-		\centering
-		\includegraphics[width=10cm]{255}
-	\end{figure}
-
-
-\end{document}

Misc/Moscow Puzzles/problems/263.tex

@@ -1,16 +0,0 @@
-\documentclass[../main.tex]{subfiles}
-
-\begin{document}
-
-	\problem{A Shooting Match}
-	Andryusha, Borya, and Volodya each fired 6 shots, and each got 71 points.
-
-	\begin{figure}[h]
-		\centering
-		\includegraphics[width=8cm]{263}
-	\end{figure}
-
-	Andryusha's first 2 shots got 22 points and Volodya's first shot got only 3 points. \\
-	Who hit the bull's-eye?
-
-\end{document}

notes/TODO.md

@@ -1,49 +0,0 @@
-
-# Game ideas
- - Math dominos:
-   - Each problem is a domino tile, by difficulty.
-   - Score is sum if 1st try, max if 2nd try. Subtract min if no solution.
-   - Each team can have 2-3 dominos at a time. No free swaps.
-   - Pick up dominos without knowing problem.
-
- - что-где-когда:
-  - All teams solve one problem at once.
-
- - Spacewar!:
-   - Two teams, each starts in one root node.
-   - Graph of problems, symmetric across middle
-   - easy problems close, hard problems far.
-   - Goal: capture as many nodes as possible
-     - Solve a problem, capture a node
-     - solve a problem on the other team's side, capture their node.
-     - TODO: a fun way to resolve conflicts?
-
-
-# Topics:
-- Divisibility proofs & properties
-- 1 exists ==> assume 2 exist
-- <= , >= ==> =
-- pidgeonhole
-
-# Handout ideas:
-- Notation toolbox
-- Propositional logic
-- Rubik's group
-- Graph combinatorics
-- Fourier transforms
-- Probabilistic proofs
-- Bayesian / Frequentist probability
-- Data structures
-
-# Handouts to clean up:
- - Euler's number
- - Lattices
- - Nim handout
- - Stocks
-
-# Problems to record:
- - Nikita: weight of 100 cows
- - Seat swapping: everyone wants a seat that's not their own, no two people want the same seat. Each cycle, everyone swaps. Min # of cycles? Solution: 2, reflect. use even and odd cycles. Takeaway: composition of reflections is rotation.
- - Geometric optimization: ant on cube shortest path, ant on brick shortest path, ribbon on brick (over-under, h-shape) minimal length, Farthest point from corner of brick
- - 180: Sperner lemma and brouwer theorem
- - 25 horses. 5 at a time. find top 3? (7 races)

notes/topics.md

@@ -1,68 +0,0 @@
- - Telescoping sums
- - Division algorithm
- - Peano axions
- - Proof basics
- - Show that irrational
- - Voting systems
- - Weighings
-
-# Beginners 1
-Grades 2 - 4
- - Basic cyphers
- - Modular Arithmetic
- - Numbers in other bases
-
-
-
-# Beginners 2:
-Grades 4 - 6
-
- - Pidgeonhole principle
- - Combinatorics
-  - N choose K (c and p)
-  - stars and bars
- - Induction
-   - Boosted induction (cauchy, etc)
- - Compass-and-Ruler constructions
-
-
-
-# Intermediate 1:
-Grades 5 - 7
- - Graphs
-   - Instant Insanity
-   - Euler walks and paths
-   - Konigsberg
- - Logs & Slide rules
- - Vectors and Applications
- - Probability
-   - Monty Hall problem
-
-
-
-# Intermediate 2:
-Grades 6 - 9
-
-
-
-# Advanced 1:
-Grades 9 - 10
- - Linear Algebra Basics
- - Graph Theory
-   - Algorithms:
-     - Ford-Fulkerson
-     - Dijkstra
-     - Minimal spanning tree
-   - Three-color theorem
-
-
-
-# Advanced 2:
-Grades 11 - 12
- - Logic
-   - Exists, forall, not. (Definable sets handout)
-   - Mockingbird, lambda
- - Numerical cryptography
- - Group Theory
- - Understand Euler's Number
- - Relations