diff --git a/.gitignore b/.gitignore index 74ccd56..27e690e 100644 --- a/.gitignore +++ b/.gitignore @@ -19,4 +19,7 @@ main.pdf *.fls *.fdb_latexmk *.dvi -*.xdv \ No newline at end of file +*.xdv + +# Do not ignore any notes +!/notes/** diff --git a/notes/2023-10-08_19-50.png b/notes/2023-10-08_19-50.png new file mode 100755 index 0000000..0aea089 Binary files /dev/null and b/notes/2023-10-08_19-50.png differ diff --git a/notes/2023-10-08_19-52.png b/notes/2023-10-08_19-52.png new file mode 100755 index 0000000..aa44e0a Binary files /dev/null and b/notes/2023-10-08_19-52.png differ diff --git a/notes/2023-10-30_11-29.png b/notes/2023-10-30_11-29.png new file mode 100755 index 0000000..dacd108 Binary files /dev/null and b/notes/2023-10-30_11-29.png differ diff --git a/notes/AACoPtDtbiaLbtaIts.pdf b/notes/AACoPtDtbiaLbtaIts.pdf new file mode 100755 index 0000000..ab466df Binary files /dev/null and b/notes/AACoPtDtbiaLbtaIts.pdf differ diff --git a/notes/TODO.md b/notes/TODO.md new file mode 100755 index 0000000..ffa46ad --- /dev/null +++ b/notes/TODO.md @@ -0,0 +1,51 @@ + +# 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 +- Probabalistic proofs +- Bayesian / Frequentist probability +- Data structures + +# Handouts to clean up: + - Euler's number + - Lattices + - Nim handout + - Stocks + - Continued fractions + + +# 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) diff --git a/notes/handouts/2010-11-07 209.1.pub (11.7.2010).pdf b/notes/handouts/2010-11-07 209.1.pub (11.7.2010).pdf new file mode 100755 index 0000000..bf51331 Binary files /dev/null and b/notes/handouts/2010-11-07 209.1.pub (11.7.2010).pdf differ diff --git a/notes/handouts/2016-05-15 1488.0.pub (11.11.2018).pdf b/notes/handouts/2016-05-15 1488.0.pub (11.11.2018).pdf new file mode 100755 index 0000000..9ba770f Binary files /dev/null and b/notes/handouts/2016-05-15 1488.0.pub (11.11.2018).pdf differ diff --git a/notes/handouts/2016-05-15 1877.1.pub (1.12.2020).pdf b/notes/handouts/2016-05-15 1877.1.pub (1.12.2020).pdf new file mode 100755 index 0000000..1cdd720 Binary files /dev/null and b/notes/handouts/2016-05-15 1877.1.pub (1.12.2020).pdf differ diff --git a/notes/handouts/2016-05-22 1194.0.pub (5.22.2016).pdf b/notes/handouts/2016-05-22 1194.0.pub (5.22.2016).pdf new file mode 100755 index 0000000..88c48b1 Binary files /dev/null and b/notes/handouts/2016-05-22 1194.0.pub (5.22.2016).pdf differ diff --git a/notes/handouts/Geometric Optima handout.pdf b/notes/handouts/Geometric Optima handout.pdf new file mode 100755 index 0000000..42b3571 Binary files /dev/null and b/notes/handouts/Geometric Optima handout.pdf differ diff --git a/notes/handouts/N Sahoo BMC Handout_0.pdf b/notes/handouts/N Sahoo BMC Handout_0.pdf new file mode 100755 index 0000000..40bf23f Binary files /dev/null and b/notes/handouts/N Sahoo BMC Handout_0.pdf differ diff --git a/notes/handouts/com_solutions.pdf b/notes/handouts/com_solutions.pdf new file mode 100755 index 0000000..35f0f7f Binary files /dev/null and b/notes/handouts/com_solutions.pdf differ diff --git a/notes/handouts/nim.pdf b/notes/handouts/nim.pdf new file mode 100755 index 0000000..fa87203 Binary files /dev/null and b/notes/handouts/nim.pdf differ diff --git a/notes/handouts/notes07.pdf b/notes/handouts/notes07.pdf new file mode 100755 index 0000000..d62cedf Binary files /dev/null and b/notes/handouts/notes07.pdf differ diff --git a/notes/handouts/nsa/1.pdf b/notes/handouts/nsa/1.pdf new file mode 100755 index 0000000..60f5b76 Binary files /dev/null and b/notes/handouts/nsa/1.pdf differ diff --git a/notes/handouts/nsa/1.sols.pdf b/notes/handouts/nsa/1.sols.pdf new file mode 100755 index 0000000..3d5df1b Binary files /dev/null and b/notes/handouts/nsa/1.sols.pdf differ diff --git a/notes/handouts/nsa/2.pdf b/notes/handouts/nsa/2.pdf new file mode 100755 index 0000000..87091d1 Binary files /dev/null and b/notes/handouts/nsa/2.pdf differ diff --git a/notes/handouts/nsa/3.pdf b/notes/handouts/nsa/3.pdf new file mode 100755 index 0000000..019f165 Binary files /dev/null and b/notes/handouts/nsa/3.pdf differ diff --git a/notes/handouts/nsa/4.pdf b/notes/handouts/nsa/4.pdf new file mode 100755 index 0000000..95b6ada Binary files /dev/null and b/notes/handouts/nsa/4.pdf differ diff --git a/notes/handouts/nsa/5.pdf b/notes/handouts/nsa/5.pdf new file mode 100755 index 0000000..c7e05f0 Binary files /dev/null and b/notes/handouts/nsa/5.pdf differ diff --git a/notes/handouts/nsa/6.pdf b/notes/handouts/nsa/6.pdf new file mode 100755 index 0000000..f0e0d35 Binary files /dev/null and b/notes/handouts/nsa/6.pdf differ diff --git a/notes/handouts/nsa/7.pdf b/notes/handouts/nsa/7.pdf new file mode 100755 index 0000000..c44d804 Binary files /dev/null and b/notes/handouts/nsa/7.pdf differ diff --git a/notes/handouts/rubik/Group Theory and the Rubik's Cube.pdf b/notes/handouts/rubik/Group Theory and the Rubik's Cube.pdf new file mode 100755 index 0000000..4da2cf6 Binary files /dev/null and b/notes/handouts/rubik/Group Theory and the Rubik's Cube.pdf differ diff --git a/notes/handouts/rubik/Rubiks_Cube_Group.pdf b/notes/handouts/rubik/Rubiks_Cube_Group.pdf new file mode 100755 index 0000000..40db962 Binary files /dev/null and b/notes/handouts/rubik/Rubiks_Cube_Group.pdf differ diff --git a/notes/handouts/rubik/group.pdf b/notes/handouts/rubik/group.pdf new file mode 100755 index 0000000..1de008f Binary files /dev/null and b/notes/handouts/rubik/group.pdf differ diff --git a/notes/handouts/rubik/rubik.pdf b/notes/handouts/rubik/rubik.pdf new file mode 100755 index 0000000..757e0c0 Binary files /dev/null and b/notes/handouts/rubik/rubik.pdf differ diff --git a/notes/handouts/solutions fundamental groups.pdf b/notes/handouts/solutions fundamental groups.pdf new file mode 100755 index 0000000..7933182 Binary files /dev/null and b/notes/handouts/solutions fundamental groups.pdf differ diff --git a/notes/handouts/stock.pdf b/notes/handouts/stock.pdf new file mode 100755 index 0000000..d7a6471 Binary files /dev/null and b/notes/handouts/stock.pdf differ diff --git a/notes/handouts/stocks.pdf b/notes/handouts/stocks.pdf new file mode 100755 index 0000000..5f10937 Binary files /dev/null and b/notes/handouts/stocks.pdf differ diff --git a/notes/handouts/tangle.pdf b/notes/handouts/tangle.pdf new file mode 100755 index 0000000..adcc5ac Binary files /dev/null and b/notes/handouts/tangle.pdf differ diff --git a/notes/misc/alligators_colored.pdf b/notes/misc/alligators_colored.pdf new file mode 100755 index 0000000..bf10225 Binary files /dev/null and b/notes/misc/alligators_colored.pdf differ diff --git a/notes/misc/alligators_white.pdf b/notes/misc/alligators_white.pdf new file mode 100755 index 0000000..45c75c8 Binary files /dev/null and b/notes/misc/alligators_white.pdf differ diff --git a/notes/misc/croc.html b/notes/misc/croc.html new file mode 100755 index 0000000..387da2a --- /dev/null +++ b/notes/misc/croc.html @@ -0,0 +1,138 @@ + +Alligator Eggs! + + + +

Alligator Eggs!

+

A puzzle game by Bret Victor / May 1, 2007

+

+

Materials

+

Step 1: Print out this PDF onto six or so + different + colored + sheets + of + paper.
+(Even better, photocopy it onto cardstock.)

+

+

 

+

Step 2: Print out this PDF onto a couple white sheets of paper.

+

+

 

+

Step 3: Cut out the pieces!

+

+

Pieces

+

These are hungry alligators:

+

+

Hungry alligators are hungry. They'll eat anything that's in front of them! But they are also responsible alligators, so they guard their families.

+

 

+

These are old alligators:

+

+

Old alligators are not hungry. They've eaten enough. All they do is guard their families.

+

 

+

These are eggs:

+

+

Eggs hatch into new families of alligators!

+

Families

+

Here's a small family:

+

+

A green alligator is guarding her green egg.

+

 

+

Here's a slightly bigger family:

+

+

A green alligator and red alligator are guarding a green egg and a red egg. Or, you could say that the green alligator is guarding the red alligator, and the red alligator is guarding the eggs.

+

 

+

Here's a huge family!

+

+

We've got yellow, green, red alligators guarding this family. They are guarding three things: a green egg, an old alligator, and a red egg. The old alligator is guarding a yellow egg and a green egg.

+

Notice that eggs only use the colors of the alligators guarding them. You can't have a blue egg without there being a blue alligator around to guard it.

+

Eating

+

Now, things are going to get messy. Here are two families, side-by-side:

+

+

That green alligator sure is hungry. And there's a yellow family, right in front of her mouth, and it looks tasty!

+

+

I think you know what happens next.

+

+

Unfortunately, the green alligator's eyes were bigger than her stomach. She ate too much!

+

+

And so she dies, and goes off to alligator heaven. But, the story doesn't end there. Because the green alligator died, the green egg starts to hatch...

+

+

Amazingly, it hatches into exactly what the green alligator ate. It's the miracle of life!

+

+

Now, we're down to one family. We have a red alligator guarding a yellow alligator and a red egg, and the yellow alligator is guarding her yellow egg.

+

But that yellow alligator sure is hungry, and there's a tasty red egg in front of her. Here we go again...

+

+

Poor alligator. Even a single egg is too much for her stomach!

+

+

The yellow alligator dies... but once again, the yellow egg starts to hatch...

+

+

And it hatches into exactly what the yellow alligator ate!

+

+

Now, there's nothing for anyone to eat, so we stop.

+

The Eating Rule

+

That was an example of the first rule of the game: the eating rule.

+

The eating rule says that if there are some families side-by-side...

+

+

the top-left alligator eats the family to her right.

+

+

Then, that alligator dies. But if she was guarding any eggs of the same color, each of those eggs hatches into what she ate.

+

+

The Color Rule

+

Continuing with the example above, the orange alligator eats the yellow family, leaving this:

+

+

Now, the green alligator at the top-left wants to eat the family to her right. But before she can do so, we need to look at the color rule.

+

The color rule says that if an alligator is about to eat a family, and there's a color that appears in both families, we need to change that color in one family to something else.

+

In the picture above, green and red appear in both the first and second families. So, in the second family, we switch all of the greens to cyan, and all of the reds to blue.

+

+

Now that they don't share any colors, we can eat!

+

+

And eat!

+

+

And eat!

+

+

And eat, until there's nothing more that can be eaten.

+

+

Old Alligators

+

There's only one more rule in this game, and it has to do with old alligators:

+

+

The top-left alligator here is not hungry. She's not going to eat anything. All she cares about is her family. So, how does she die?

+

She dies when she's only guarding one thing. Right now, she's guarding both a green family and a red family. They need her to take care of them. But that green alligator is hungry. The green alligator eats the red family...

+

+

Now, the old alligator is only guarding a single family. That family can take care of itself. She's no longer needed. So, she grows old and dies.

+

+

That is the old age rule. When an old alligator is just guarding a single thing, it dies.

+

+

Now, the red alligator eats the yellow family, and there's no more that can be eaten.

+

+

Gameplay

+

The game would consist of a series of puzzles, challenging the player to devise a family that, when fed X, produces Y. For example:

+
+

Here are two families. They are named "True" and "False":

+

+

And here is a family called "Not":

+

+

When "Not" eats "True", it produces "False". And when "Not" eats "False", it produces "True". What colors should the two eggs at the bottom be?

+
+

(For this to work well, we'd need a better color rule, to explain that families with different colors in the same "pattern" are equivalent.)

+

These puzzles could be embedded into a story. The player would have to solve each puzzle to see what happens next. Alternatively, this could be made into a board game. Each player would roll a die, travel forward a number of spaces, and solve the puzzle at the destination.

+

Theory

+

This game represents the untyped lambda calculus. A hungry alligator is a lambda abstraction, an old alligator is parentheses, and eggs are variables. The eating rule corresponds to beta-reduction. The color rule corresponds to (over-cautious) alpha-conversion. The old age rule says that if a pair of parentheses contains a single term, the parentheses can be removed.

+

Variations

+

Oliver Steele pointed out that family roles are very important to children, and more could be made of the concept of grandparent alligators, parents, babies (eggs), and so on. Currently, variable names are represented with colors. Both are arbitrary, and require renaming/recoloring rules to avoid capture. An alternative may be something like de Bruijn indices, corresponding to birth order and family relation.

+

Oliver also suggested that kids might not like the idea of parents dying, and perhaps alligator removal could be explained as moving away.

+

By changing the game so alligators are greedy, and eat everything to their right, we represent a right-associative lambda calculus. This seems to eliminate a lot of old alligators (parentheses) in Church numerals, the Y combinator, etc. Unfortunately, it means that old alligators have to be born when an alligator eats more than one thing, among other problems. I'd still like to figure out how to make Church numerals (repeated application) look less ugly.

+

Schematic Form

+

I've found that a schematic form of alligator calculus is actually rather handy for calculating lambda terms by hand. We draw a lambda as a line with a mouth. Parentheses are a line without a mouth. Here's the identity function:

+

+

Here are some Church numerals:

+

+

Here are boolean AND and OR (assuming the standard definitions for TRUE and FALSE):

+

+

The Y combinator:

+

+

I don't know if these are any easier to read than the standard notation, but I've found them to be easier to work with, using pencil and paper. I imagine the terms eating one another and hatching below. I don't get lost in a long chain of symbols, losing track of what's applying to what.

+
\ No newline at end of file diff --git a/notes/misc/exact-values-sin-degrees.pdf b/notes/misc/exact-values-sin-degrees.pdf new file mode 100755 index 0000000..d342c9a Binary files /dev/null and b/notes/misc/exact-values-sin-degrees.pdf differ diff --git a/notes/misc/gear.svg b/notes/misc/gear.svg new file mode 100755 index 0000000..8792358 --- /dev/null +++ b/notes/misc/gear.svg @@ -0,0 +1,491 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + A + + B + 1 + + + + + + + + + + + + + + + + A + I + II + III + + B + 1 + + + + B + 2 + + + + + B + 1 + + + + B + 2 + + + + B + 3 + + + diff --git a/notes/misc/genset.pdf b/notes/misc/genset.pdf new file mode 100755 index 0000000..c543cea Binary files /dev/null and b/notes/misc/genset.pdf differ diff --git a/notes/misc/holfstadter.pdf b/notes/misc/holfstadter.pdf new file mode 100755 index 0000000..e8d240c Binary files /dev/null and b/notes/misc/holfstadter.pdf differ diff --git a/notes/misc/induction.pdf b/notes/misc/induction.pdf new file mode 100755 index 0000000..20f7829 Binary files /dev/null and b/notes/misc/induction.pdf differ diff --git a/notes/misc/parabola multiplication.pdf b/notes/misc/parabola multiplication.pdf new file mode 100755 index 0000000..35504d4 Binary files /dev/null and b/notes/misc/parabola multiplication.pdf differ diff --git a/notes/misc/welldefined.pdf b/notes/misc/welldefined.pdf new file mode 100755 index 0000000..a888075 Binary files /dev/null and b/notes/misc/welldefined.pdf differ diff --git a/notes/misc/writingtips.pdf b/notes/misc/writingtips.pdf new file mode 100755 index 0000000..3f8572e Binary files /dev/null and b/notes/misc/writingtips.pdf differ diff --git a/notes/topics.md b/notes/topics.md new file mode 100755 index 0000000..c84b151 --- /dev/null +++ b/notes/topics.md @@ -0,0 +1,68 @@ + - 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 \ No newline at end of file