478 Commits

Author SHA1 Message Date
Mark 48f09332c3 Fix typst dimensions
CI / Typst formatting (push) Successful in 34s
CI / Typos (push) Successful in 40s
CI / Build (push) Has been cancelled
2025-01-22 11:16:49 -08:00
Mark 0e1ba353c1 Publish package
CI / Typst formatting (push) Successful in 12s
CI / Typos (push) Successful in 15s
CI / Build (push) Successful in 10m55s
2025-01-22 10:07:22 -08:00
Mark 4468bcbb4a Renames 2025-01-22 09:57:07 -08:00
Mark c6a916f087 Tropical edits 2025-01-22 09:57:02 -08:00
Mark 234cb6cd17 Temporary fix 2025-01-22 08:57:45 -08:00
Mark df28a09214 Added typstyle action
Lints / typstyle (push) Successful in 19s
Lints / typos (push) Successful in 21s
Build and deploy / build (push) Failing after 7m49s
2025-01-21 20:33:42 -08:00
Mark cb3e27429f Added Sunny's solutions
Lints / typos (push) Successful in 20s
Build and deploy / build (push) Failing after 8m45s
2025-01-21 19:57:58 -08:00
Mark 8b2f6aa1b1 Move typst lib
Lints / typos (push) Successful in 26s
Build and deploy / build (push) Failing after 8m21s
2025-01-21 18:40:32 -08:00
Mark a82cc8c79f New build system
Lints / typos (push) Successful in 21s
Build and deploy / build (push) Has been cancelled
2025-01-21 18:35:58 -08:00
Mark a14656d94f Minor edits
Lints / typos (push) Successful in 22s
Build and deploy / build (push) Successful in 6m39s
2025-01-21 14:18:26 -08:00
Mark 185768a7bd Added tropical handout
Lints / typos (push) Successful in 22s
Build and deploy / build (push) Has been cancelled
2025-01-21 14:11:52 -08:00
Mark 358e26a0cb No warm-up solutions
Lints / typos (push) Successful in 46s
Build and deploy / build (push) Successful in 8m15s
2025-01-20 19:16:01 -08:00
Mark 6bb56693f8 editorconfig 2025-01-20 19:15:40 -08:00
Mark ce0b06e58e build action
Lints / typos (push) Successful in 1m11s
Build and deploy / build (push) Successful in 11m58s
2025-01-20 11:19:08 -08:00
Mark b3652c45b1 format 2025-01-20 11:19:03 -08:00
Mark 8efc57cbeb tweaks 2025-01-20 11:18:59 -08:00
Mark 8182ce6a24 fix typos
Lints / typos (push) Successful in 14s
2025-01-19 20:26:04 -08:00
Mark 5f8c54650f Fix typos
Lints / typos (push) Failing after 17s
2025-01-19 20:24:51 -08:00
Mark cb2a1d99dd action rules
Lints / typos (push) Failing after 20s
2025-01-19 20:13:46 -08:00
Mark a5e1627e77 TODO 2025-01-19 20:13:25 -08:00
Mark 94339372fd Added typos 2025-01-19 20:13:05 -08:00
Mark 5f7a8bb6b7 edits 2025-01-19 15:11:36 -08:00
Mark 5a70784dda Added esoteric handout 2025-01-18 16:10:56 -08:00
Mark 9415d91e6b Added gears svg 2025-01-18 16:10:46 -08:00
Mark b236a3b271 Typos 2025-01-16 16:49:45 -08:00
Mark fb41e67a8f Typo 2025-01-09 11:39:11 -08:00
Mark bd1a72b089 Added generating functions 2025-01-09 11:10:15 -08:00
Mark 7c21b0d489 Added passing warmup 2025-01-04 13:31:18 -08:00
Mark f65ad3de88 Added geometric optimization 2025-01-04 11:02:26 -08:00
Mark 449bd2e24e Added turing machine warm-up 2025-01-04 10:48:06 -08:00
Mark 0ab8dc3734 Painting 2024-12-09 12:21:22 -08:00
Mark c7d91704d9 Rephrase 2024-12-09 12:19:46 -08:00
Mark c18eb70356 Merge branch 'masses' 2024-12-05 13:29:31 -08:00
Mark bdbbee6fdd Added notes 2024-12-05 13:27:47 -08:00
Mark 7f86d64a85 Symmetric group edits 2024-11-12 20:08:33 -08:00
Mark d61359287a typo 2024-10-29 09:27:00 -07:00
Mark 1609ec919a Crypto edits 2024-10-24 09:33:50 -07:00
Mark 8b10780fbe Crypto edits 2024-10-17 21:09:13 -07:00
Mark 760ba456b6 edits 2024-10-14 20:39:01 -07:00
Mark 9363266410 Merge branch 'masses' of ssh://git.betalupi.com:33/Mark/ormc-handouts into masses 2024-10-10 14:33:16 -07:00
Mark 78fb432fa1 Added unfinished mass sections 2024-10-10 14:33:14 -07:00
Mark 9ce88d422e Images 2024-10-10 14:33:05 -07:00
Mark 0b582ec3a4 Added masses intro 2024-10-10 14:32:58 -07:00
Mark 00ba533b3f Added masses draft 2024-10-10 12:44:39 -07:00
Mark 386b83c83f Minor edits 2024-10-04 13:15:44 -07:00
Mark 1be250b8aa Minor edits 2024-10-03 10:37:30 -07:00
Mark 4d86a6c01f Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2024-09-29 13:05:40 -07:00
Mark 89425270b9 Minor edits 2024-09-29 13:05:38 -07:00
Mark 960596b12b Typo 2024-09-26 11:20:56 -07:00
Mark 9a531509ca Merge branch 'stopping' 2024-09-26 09:25:38 -07:00
Mark dc5cb2c9b6 Final edits 2024-09-26 09:25:14 -07:00
Mark e43ff5e1fb Tom edits 2024-09-25 09:16:20 -07:00
Mark 8925d5b823 Finished secretary handout 2024-09-25 09:16:06 -07:00
Mark 42d592e700 Remove unfinished handout 2024-09-14 12:22:17 -07:00
Mark e894f937aa More secratary edits 2024-09-04 22:50:57 -07:00
Mark 97600fbb84 Stopping edits 2024-09-04 16:40:17 -07:00
Mark 29fc8b9aec Stopping problems draft 2024-09-04 10:18:46 -07:00
Mark 716522e5c8 Tweak 2024-07-18 14:17:31 -07:00
Mark c0fb72c540 Typo 2024-07-18 13:43:25 -07:00
Mark 30f1ad612d Typo fix (Koreans) 2024-06-07 14:54:31 -07:00
Mark 57b6ea217e Minor fix 2024-05-25 10:11:24 -07:00
Mark 8bf5c71aa8 Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2024-05-25 10:11:10 -07:00
Mark 04057b0bf9 Edits 2024-05-25 10:10:55 -07:00
Mark fc2a66f027 Added starred 2024-05-24 23:36:55 -07:00
Mark 0e7be26fd7 Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2024-05-24 23:26:21 -07:00
Mark 17c0099753 Tweak 2024-05-24 23:26:01 -07:00
Mark 00463fc2ed Removed 5D chess 2024-05-24 16:24:27 -07:00
Mark f7eb30a916 Minor edits 2024-05-23 12:40:43 -07:00
Mark 7800e94834 Removed stray file 2024-05-01 20:42:06 -07:00
Mark 58d67c5527 Added a warm-up 2024-04-28 16:36:54 -07:00
Mark 1a114682e9 Sizing 2024-04-25 16:43:08 -07:00
Mark 04bdef9f7b Sizing 2024-04-25 16:40:46 -07:00
Mark ff3f5779a5 Cleanup 2024-04-25 16:39:23 -07:00
Mark 0977ee2999 Added a warmup 2024-04-25 16:15:55 -07:00
Mark bd68a650a5 Added missing file 2024-04-25 15:01:47 -07:00
Mark 237497c0c3 Finished compression handout 2024-04-25 14:59:29 -07:00
Mark 0bfe54d69b Polish 2024-04-24 15:33:33 -07:00
Mark 8269bf1135 Polish 2024-04-23 17:33:58 -07:00
Mark d8698b4c81 Added huffman problems 2024-04-23 11:46:39 -07:00
Mark b37af6cc27 Added trees 2024-04-22 17:58:32 -07:00
Mark 8ba834de59 Minor edits 2024-04-21 21:26:19 -07:00
Mark 311f09f00e Build with tectonic 2024-04-12 13:11:57 -07:00
Mark 173705112f Added compression parts 2024-04-12 13:11:24 -07:00
Mark 759e7e05f6 Post-class fixes 2024-04-08 07:37:59 -07:00
Mark f2ba5bf1b3 Minor fixes 2024-04-03 09:03:59 -07:00
Mark c10ef06d85 Cleanup 2024-04-02 21:15:34 -07:00
Mark 17e019fd02 Added URL to all handouts 2024-04-01 21:50:50 -07:00
Mark 0203f1f018 Remove bonus 2024-04-01 07:22:21 -07:00
Mark 98c841f72e Minor edits 2024-04-01 07:21:08 -07:00
Mark 2293c38e8b Added mario kart warmup 2024-03-31 09:46:19 -07:00
Mark 02a3bb2fd7 New warmup & minor edits 2024-03-30 08:44:39 -07:00
Mark 62794fef92 Removed quotient group handout 2024-03-26 08:38:45 -07:00
Mark 3ca94a0c1a Typo 2024-03-25 10:18:23 -07:00
Mark 6d5459eaf4 Typo 2024-03-25 10:12:54 -07:00
Mark b0e1083b7f Minor edit 2024-03-25 10:04:13 -07:00
Mark 073fd9d96b Minor edit 2024-03-23 12:32:00 -07:00
Mark b0bd0bcb5c Added sturmian section 2024-03-23 12:29:48 -07:00
Mark 6a94084190 Edits 2024-03-22 16:55:08 -07:00
Mark 8d520eabc2 Finished De Bruijn sections 2024-03-21 12:03:37 -07:00
Mark 046c6f9ce4 Added \remark{} 2024-03-20 19:38:51 -07:00
Mark ddaeaa4741 Minor edit 2024-03-20 19:38:42 -07:00
Mark 597f32cd69 Added initial De Bruijn sections 2024-03-20 19:38:35 -07:00
Mark 426d95595f Minor edits 2024-03-11 10:09:44 -07:00
Mark b6ae87b971 Minor edit 2024-03-08 10:17:26 -08:00
Mark d39fac10c6 Typo 2024-03-08 09:38:36 -08:00
Mark 9371db7af3 Removed conway warmup 2024-03-07 09:58:28 -08:00
Mark be1e01240b Warmup edits 2024-03-07 09:58:10 -08:00
Mark 8391161b93 Estimathon edits 2024-03-07 09:53:35 -08:00
Mark 71b9c70511 Hack for auto-builder 2024-02-26 08:57:23 -08:00
Mark afd98956b0 One handout 2024-02-26 07:47:45 -08:00
Mark 2025b89618 Minor edits 2024-02-26 07:46:59 -08:00
Mark 2dafcb026c Minor edits 2024-02-22 12:53:20 -08:00
Mark 579e05e2c3 Minor edits 2024-02-21 16:54:42 -08:00
Mark 70c3680506 Minor tweaks 2024-02-21 16:18:09 -08:00
Mark a2dca28480 Added hxh, superdense, and teleport 2024-02-21 16:17:54 -08:00
Mark 321238b542 Minor edits 2024-02-19 13:54:53 -08:00
Mark 89b75de9b0 Fix note and hint for long input 2024-02-18 19:48:37 -08:00
Mark acfb95831e Edits 2024-02-18 19:48:17 -08:00
Mark 39fafb4869 Paths 2024-02-17 08:58:23 -08:00
Mark f590e0f252 Added Tectonic.toml 2024-02-17 08:57:20 -08:00
Mark 7d4a27d57f Minor edit 2024-02-17 08:56:29 -08:00
Mark ec3cf3b27f Typo 2024-02-16 08:33:54 -08:00
Mark e8eb1a783e Reworked quantum handout 2024-02-15 16:23:25 -08:00
Mark 42a5626d97 Minor errors 2024-02-15 07:28:17 -08:00
Mark 8c2e4e132f Minor edits 2024-02-11 13:10:08 -08:00
Mark 1f213d9673 Quantum edits 2024-02-11 10:09:30 -08:00
Mark 858be3dcb4 Minor edit 2024-02-11 10:07:47 -08:00
Mark 5362154b4b Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2024-02-10 21:05:40 -08:00
Mark f15e81ac86 Minor edit 2024-02-10 21:05:38 -08:00
Mark d661051b0f Numbering tweak 2024-02-10 21:03:16 -08:00
Mark 33e69a13d4 Edits & renames 2024-02-10 20:57:14 -08:00
Mark bd33aeb739 Edits 2024-02-08 09:21:22 -08:00
Mark 56b72a0531 Edits 2024-02-07 11:26:40 -08:00
Mark 689d085e6f Quantum edits 2024-02-06 16:49:40 -08:00
Mark 2303155cd5 Added WIP section 2024-02-06 10:17:58 -08:00
Mark 87dfc9ae4f Added gate section 2024-02-06 10:15:51 -08:00
Mark 6f67a702b6 Edits 2024-02-05 08:55:55 -08:00
Mark d1388c43d5 Minor error 2024-02-05 08:44:45 -08:00
Mark 81667db1c0 Edits 2024-01-31 18:21:28 -08:00
Mark e3b507a78f Minor edits 2024-01-31 17:55:04 -08:00
Mark 77816e58e6 Minor edits 2024-01-31 11:31:42 -08:00
Mark 36a5556804 ORMCbox fix 2024-01-31 09:28:49 -08:00
Mark 4dd9645738 Quantum edits 2024-01-31 09:23:08 -08:00
Mark 82064f890c Minor edits 2024-01-30 22:10:59 -08:00
Mark b122a150ff Minor edits 2024-01-29 17:28:41 -08:00
Mark 22275cf450 Added nonstandard analysis handout 2024-01-29 17:25:19 -08:00
Mark a097f53b0f Typo 2024-01-27 13:25:01 -08:00
Mark 9b7582115a Updated gitignore 2024-01-27 13:17:09 -08:00
Mark afadc8bf6c Added quantum handout 2024-01-27 13:16:52 -08:00
Mark c7afd20437 comments 2024-01-27 13:03:33 -08:00
Mark 49265c27a3 License 2024-01-27 13:03:27 -08:00
Mark c2672e135b Added adder handout 2024-01-27 13:02:53 -08:00
Mark 372c52376d Added gallery warm-up 2024-01-26 10:48:31 -08:00
Mark 770bd2c2c4 Minor edits 2024-01-23 10:23:59 -08:00
Mark d50a6ca6d9 Minor edit 2024-01-22 09:52:42 -08:00
Mark 7ec80b79eb Added a warm-up 2024-01-14 19:08:51 -08:00
Mark ba4f971110 Edits 2024-01-14 19:08:44 -08:00
Mark 3a4e9615f8 Removed bad warm-up 2024-01-14 19:01:32 -08:00
Mark c294a0d4f9 Minor edits 2024-01-11 07:56:32 -08:00
Mark 7fe06e1aca Added estimathon 2024-01-10 21:00:20 -08:00
Mark 6211984bf0 Minor edits 2024-01-10 21:00:09 -08:00
Mark 5cfba49bf0 Whitespace 2024-01-10 21:00:01 -08:00
Mark 49a2ffed91 Added parking warm-up 2024-01-10 15:47:56 -08:00
Mark 8bcdb09ee0 Minor edit 2024-01-09 08:42:32 -08:00
Mark 4104326899 Added grid 2024-01-08 11:59:38 -08:00
Mark 5def402314 Added a warmup 2024-01-08 11:55:00 -08:00
Mark df71c8676f Added warmups 2024-01-08 11:26:44 -08:00
Mark cec0cb5dc5 Typo fixes 2024-01-08 10:56:22 -08:00
Mark cc42a42b01 Edits 2024-01-04 11:34:55 -08:00
Mark a2caac7e95 Symmetric edits 2024-01-03 22:25:15 -08:00
Mark d285b4efe9 Finished symmetric group handout 2024-01-03 11:44:34 -08:00
Mark bd88b894a1 Added cycle notation 2023-12-18 10:55:08 -08:00
Mark 0319c52248 Minor edit 2023-12-18 08:59:10 -08:00
Mark a5e6aca0a9 Added a warm-up 2023-12-18 08:58:19 -08:00
Mark ec57939416 Started symmetric group handout 2023-12-17 12:10:22 -08:00
Mark 91d99239d6 Updated build script 2023-12-11 15:03:48 -08:00
Mark 512cf90fc4 Removed chess game 2023-12-10 19:41:24 -08:00
Mark 774e75aa58 Removed unfinished handout 2023-12-09 18:21:06 -08:00
Mark c354412127 Typos 2023-12-09 18:20:39 -08:00
Mark b4d314b8c0 Updated link 2023-12-09 18:20:32 -08:00
Mark 179d06fd1e Moved Proof techniques 2023-12-09 18:19:12 -08:00
Mark f84ff69bdf Removed Options handout 2023-12-09 18:18:21 -08:00
Mark f5fe2c3f96 Removed linear handout 2023-12-09 18:17:57 -08:00
Mark 23f9d100ef Removed Euler's handout 2023-12-09 18:17:42 -08:00
Mark 6a5e02a8ac Typos 2023-12-09 18:17:22 -08:00
Mark a5362a2eb9 Added "extras" mode 2023-12-06 21:52:05 -08:00
Mark 361f9e694f Minor edits 2023-12-06 20:02:32 -08:00
Mark e4ebdac31a Minor cleanup 2023-12-06 14:03:22 -08:00
Mark a48e6f5d15 Reworked scoring 2023-12-06 13:57:19 -08:00
Mark f33be5fab2 Minor cleanup 2023-12-06 12:10:37 -08:00
Mark fbc7d87577 Minor edits 2023-12-05 17:32:03 -08:00
Mark 84b40a2ff0 Typo 2023-12-05 17:31:36 -08:00
Mark 11bd085595 Refactor retrograde 2023-12-05 17:31:19 -08:00
Mark e3baa4f86e Started QG handout 2023-11-18 19:17:23 -08:00
Mark 751b5f8292 Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-11-16 17:45:08 -08:00
Mark e3ef90a02d Minor cleanup 2023-11-16 13:07:28 -08:00
Mark 834f79a8e5 Updated bundle location 2023-11-09 21:59:59 -08:00
Mark 04c1678c15 Moved macros 2023-11-08 15:10:44 -08:00
Mark 4c75130c91 Finished proof techniques handout 2023-11-08 15:09:41 -08:00
Mark 749cc9fa27 Added a few macros 2023-11-08 15:09:22 -08:00
Mark 59f8cc3657 Added proof techniques draft 2023-11-07 20:36:59 -08:00
Mark 2de7e7536b Fixed a small bug 2023-11-07 20:36:21 -08:00
Mark ee968badae Allow missing subtitle 2023-11-07 20:36:12 -08:00
Mark eec6519fa0 Fixed broken box titles 2023-11-05 20:42:53 -08:00
Mark e5b47cd56b Added a solution 2023-11-05 20:09:04 -08:00
Mark 23869b64af Added a warmup 2023-11-02 19:51:48 -07:00
Mark b6946b3b2b Cleanup 2023-11-01 10:31:29 -07:00
Mark b1015a227b Added a warmup 2023-10-31 09:09:59 -07:00
Mark e21201631b Minor typos 2023-10-29 19:00:59 -07:00
Mark a1dec5ecdc Minor color edits 2023-10-27 19:55:24 -07:00
Mark 83ff16dc88 Upgraded colors and boxes 2023-10-27 19:41:46 -07:00
Mark 3cf84ca7b3 Color tweaks 2023-10-27 19:41:00 -07:00
Mark fcef70dc61 Formatting 2023-10-26 09:43:16 -07:00
Mark 1c5addd931 Minor errors 2023-10-26 09:42:02 -07:00
Mark a460f4f376 Added TTT warmup 2023-10-26 09:02:51 -07:00
Mark 9fe9a1aa25 Added a warm-up 2023-10-26 08:31:48 -07:00
Mark c9d2e8672c Moved a few macros 2023-10-26 08:14:55 -07:00
Mark 044e7aa0a3 Added continued fractions handout 2023-10-26 07:54:15 -07:00
Mark f78461b196 Added unfinished flag 2023-10-26 07:53:39 -07:00
Mark 8f661f15c2 Fixed a minor bug 2023-10-26 07:53:24 -07:00
Mark f8b1b01d3e Added "incomplete" warning 2023-10-25 09:08:45 -07:00
Mark 7301f7c8c3 Added finance sections 2023-10-24 17:15:47 -07:00
Mark a1df6a6327 Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-10-24 11:23:38 -07:00
Mark 543b0182d2 Minor edits 2023-10-24 11:23:24 -07:00
Mark ea3ef136fa Added first section of option handout 2023-10-24 10:21:56 -07:00
Mark 1f237f6b2a Added custom bundle to tectonic 2023-10-23 19:27:08 -07:00
Mark 7db600d714 Added tectonic args variable 2023-10-23 10:58:48 -07:00
Mark d79e6bbb9d Added historical note 2023-10-22 21:33:42 -07:00
Mark 279b4711cb Minor title cleanup 2023-10-22 21:14:24 -07:00
Mark 20b0bf3e7d Minor fix 2023-10-22 20:55:21 -07:00
Mark e4706d41e7 Fixed a few errors 2023-10-22 20:19:24 -07:00
Mark 27637d7e63 Fixed minor error 2023-10-21 19:51:40 -07:00
Mark 2cd4b4e548 Fixed Kestrel problems 2023-10-18 09:16:29 -07:00
Mark b0bb202225 Improved currying section 2023-10-18 09:16:22 -07:00
Mark 021daa588a Cleaned up quote 2023-10-18 09:16:08 -07:00
Mark 7f0aa4b311 Fixed hyperref style 2023-10-18 08:15:06 -07:00
Mark 07f5ad404c Added clickable link to subtitle 2023-10-17 18:32:10 -07:00
Mark 8567415c38 Added macro file 2023-10-17 18:31:29 -07:00
Mark 104c41347f Added hyperref 2023-10-17 18:29:52 -07:00
Mark e59572a04f Fixed sample solution 2023-10-17 18:22:34 -07:00
Mark 8ffa0b644a More edits 2023-10-17 18:22:07 -07:00
Mark 887b6de1d6 Minor edits 2023-10-17 11:45:33 -07:00
Mark 5ddd354b4a Typos 2023-10-17 09:19:14 -07:00
Mark a7dfe2728a Improved intro 2023-10-17 09:15:31 -07:00
Mark 59498a9bc6 Final lambda edits 2023-10-16 18:54:37 -07:00
Mark 22535a8183 Reworked introduction 2023-10-16 16:06:39 -07:00
Mark b093e368e5 Lambda edits 2023-10-16 15:06:51 -07:00
Mark 790cd77e87 Minor fixes 2023-10-16 15:06:02 -07:00
Mark 204ee9068e Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-10-12 08:44:22 -07:00
Mark 713d96a707 Minor fixes 2023-10-12 08:44:21 -07:00
Mark 30a0c7a782 Updated build script 2023-10-11 09:44:32 -07:00
Mark 7468dce444 Build solutions too 2023-10-10 22:21:42 -07:00
Mark 307dc407a4 Updated build links 2023-10-10 22:20:22 -07:00
Mark 2af36f942f Fixed zip command 2023-10-10 22:11:31 -07:00
Mark 0fb5c3a118 Minor cleanup 2023-10-10 22:00:32 -07:00
Mark 5b0f22c917 Fixed path 2023-10-10 21:39:54 -07:00
Mark e96c02531c Updated build script 2023-10-10 21:02:04 -07:00
Mark e716e48fa2 Added build.sh 2023-10-10 20:46:36 -07:00
Mark 910cf34262 Updated gitignore 2023-10-10 17:34:55 -07:00
Mark ce68014eec Bugfixes 2023-10-10 17:34:45 -07:00
Mark a536a31f2a Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-10-08 20:55:07 -07:00
Mark 09dbcb32a4 Post-class edits 2023-10-08 20:50:15 -07:00
Mark f8d66bdc22 Added a problem 2023-10-06 14:17:34 -07:00
Mark d39fb5e0be Merged changes 2023-10-06 14:16:12 -07:00
Mark 7c2398bcf5 Added a problem 2023-10-06 14:12:42 -07:00
Mark e6802de157 Added nontransitive warm up 2023-10-06 09:07:27 -07:00
Mark 611595b197 Minor cleanup 2023-10-06 08:40:50 -07:00
Mark a073931145 Added proof problems 2023-10-06 08:40:37 -07:00
Mark dfadd23e63 Cleanup 2023-10-05 11:23:03 -07:00
Mark 18a6856380 Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-10-05 10:46:44 -07:00
Mark 45949321e9 Started proofs handout 2023-10-05 10:46:42 -07:00
Mark 6e38a4939b Minor edits 2023-10-05 10:45:57 -07:00
Mark 713cf5e6e6 Minor edits 2023-10-05 09:41:22 -07:00
Mark ab410dbe74 Minor cleanup 2023-10-04 09:42:09 -07:00
Mark 0744a88c00 Minor cleanup 2023-10-04 09:29:46 -07:00
Mark 10177fa934 Added effective resistance 2023-10-04 09:28:12 -07:00
Mark bcb1843306 Minor edits 2023-10-04 09:28:02 -07:00
Mark fdf7ba8e4c Typo 2023-10-03 18:17:39 -07:00
Mark 3c84c908d2 Added num labels 2023-10-03 11:28:56 -07:00
Mark 6bac696ff3 Fixed date 2023-10-03 11:28:38 -07:00
Mark 3ea1865334 Edited build settings 2023-10-03 11:28:29 -07:00
Mark 3d19b143cb Updated gitignore 2023-10-03 11:28:13 -07:00
Mark a6a2158ef5 Added main sections of random walk handout 2023-10-03 11:23:07 -07:00
Mark d0060cfcd5 Added retrograde handout 2023-09-28 12:12:05 -07:00
Mark b40e0d1993 Added jump chess warm-up 2023-09-26 08:05:23 -07:00
Mark 683680b20f Updated .gitignore 2023-09-20 09:55:10 -07:00
Mark 9a5c214725 Removed group theory handout (crypto handout is better) 2023-09-20 09:54:44 -07:00
Mark a896f5ee7e Minor cleanup 2023-09-20 09:54:02 -07:00
Mark f44a1ffbab Euler edits 2023-09-20 09:49:44 -07:00
Mark 366f79f3d4 Cryptography edits 2023-08-30 15:27:07 -07:00
Mark bc43a4ecce Finished cryptography handout 2023-08-18 11:12:20 -07:00
Mark 760872a815 Rewrote first section of crypto handout 2023-08-16 11:36:49 -07:00
Mark 7b43bafe04 Added solutions 2023-08-07 09:34:24 -07:00
Mark 6a4645b72a Newline fixes 2023-08-07 08:54:22 -07:00
Mark 24fadf347a Minor edits 2023-08-07 08:53:27 -07:00
Mark 26c26b17bf Handout edits 2023-08-02 13:11:14 -07:00
Mark 3c45ad0e95 Typos 2023-07-27 18:58:45 -07:00
Mark 35087b061f Cleanup 2023-07-26 18:03:43 -07:00
Mark 2e380a3f3b Cleanup 2023-07-26 17:55:07 -07:00
Mark 44d7577e2f Set edits 2023-07-20 21:19:17 -07:00
Mark 0afeaa8c6d Edits 2023-07-19 09:55:30 -07:00
Mark d238f12f69 Fixed hyperref support 2023-07-19 09:54:30 -07:00
Mark 82d2f13f0f Added starred sections 2023-07-19 09:54:11 -07:00
Mark 0851a3b0de Cleanup 2023-07-18 10:11:59 -07:00
Mark f3ec59ffd5 Cleanup 2023-07-18 10:11:35 -07:00
Mark 2eef680752 Added set size draft 2023-07-18 10:11:04 -07:00
Mark c9dd7f4f99 Graph theory partial cleanup 2023-07-09 21:37:57 -07:00
Mark 90bea68cb5 Cleaned up combinatorics handout 2023-07-09 21:35:00 -07:00
Mark 6e2766ec02 Improved graph theory handout 2023-06-29 14:51:58 -07:00
Mark 864e34436a Improved combinatorics handout 2023-06-29 14:51:46 -07:00
Mark 60bd77d7d4 Cleanup 2023-06-28 15:12:14 -07:00
Mark da4c56b8f8 Cleanup 2023-06-27 21:23:44 -07:00
Mark 3bc44ed867 Cleanup 2023-06-27 21:23:37 -07:00
Mark a87e4417ce Fixed errors 2023-06-25 18:28:08 -07:00
Mark 2e18427669 Fixed another error 2023-06-22 20:42:14 -07:00
Mark 5b93151030 Fixed an error 2023-06-22 15:26:56 -07:00
Mark aca4f68001 Cleanup 2023-06-20 14:47:17 -07:00
Mark f961b6d3c8 Title edit 2023-06-20 10:09:41 -07:00
Mark 7ffb976b6e Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-06-20 10:07:59 -07:00
Mark da57a6a8ea ECC edits 2023-06-20 10:07:35 -07:00
Mark cb80d5be96 Added equivalence problems 2023-06-19 20:24:33 -07:00
Mark 20c0a84a0c Improved ECC handout 2023-06-19 15:42:33 -07:00
Mark e2c1e72e3a Updated README 2023-05-29 21:52:54 -07:00
Mark 8ddfc5b346 Removed files that don't belong 2023-05-29 21:49:04 -07:00
Mark a5b8655434 Adjusted spacing 2023-05-29 21:27:30 -07:00
Mark 65d3529848 Added emotes 2023-05-29 19:04:07 -07:00
Mark fdb93599c3 Minor edits 2023-05-29 19:01:26 -07:00
Mark eb42cd9435 Cleanup and documentation 2023-05-29 18:57:01 -07:00
Mark 0f7796a0fd Minor fixes 2023-05-26 09:05:11 -07:00
Mark 6c0508f286 Class no longer depends on article.cls 2023-05-25 23:00:15 -07:00
Mark 34cda713a0 Minor cleanup 2023-05-25 22:59:40 -07:00
Mark 423176564e Fixed typo 2023-05-25 22:58:47 -07:00
Mark 80d04af967 Updated README 2023-05-25 21:45:49 -07:00
Mark 39572e264d Cleanup 2023-05-25 21:44:17 -07:00
Mark 83b273fbd3 Transition to new format 2023-05-25 21:44:07 -07:00
Mark 3d73626bc4 Improved handout class 2023-05-25 21:43:21 -07:00
Mark ef55dd37db Adjust enumerate numbering 2023-05-19 17:03:40 -07:00
Mark 9406121c62 Cleaned up DFA handout 2023-05-19 17:03:20 -07:00
Mark 95965cde82 Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-05-19 16:08:02 -07:00
Mark b4571c84fd Added problems 2023-05-19 10:00:24 -07:00
Mark 115e981cef Minor edit 2023-05-19 09:13:19 -07:00
Mark b2cb173ae7 Minor edits 2023-05-19 09:11:11 -07:00
Mark 7d16a2f27c Added Reidemeister moves and easier unknots 2023-05-19 09:11:02 -07:00
Mark a81f3789eb Added a note 2023-05-18 21:13:25 -07:00
Mark 0209df9e00 Added problems 2023-05-18 09:56:29 -07:00
Mark 1c3df3c182 Added problems 2023-05-17 22:14:06 -07:00
Mark 2d902645cc Minor edit 2023-05-17 22:13:56 -07:00
Mark 019ede191a Cleaned up problem library 2023-05-17 14:14:37 -07:00
Mark 0a6fefce9f Knot edits 2023-05-17 13:22:32 -07:00
Mark e5235f4fe4 Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-05-17 13:04:34 -07:00
Mark a798ffd539 Added problem library prototype 2023-05-17 13:00:54 -07:00
Mark df158c26b9 Added median warm-up 2023-05-17 12:51:41 -07:00
Mark e9bd5b5631 Minor edit 2023-05-15 10:33:09 -07:00
Mark a9a4057573 Minor edits 2023-05-15 10:33:03 -07:00
Mark fbc77eea1b Minor edits 2023-05-14 20:15:46 -07:00
Mark bb5c3bfb76 Documentclass edits 2023-05-14 19:50:30 -07:00
Mark 47de89c2c4 Post-class edits 2023-05-14 19:49:13 -07:00
Mark e3fd62c791 Added first part of DFA handout 2023-05-14 09:42:14 -07:00
Mark 36a70306d1 Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-05-13 17:15:22 -07:00
Mark dd84baee0a Made solutions breakable 2023-05-13 17:11:33 -07:00
Mark 8692eaa14a Edits 2023-05-11 21:34:11 -07:00
Mark b0c9969072 Edits 2023-05-11 20:05:02 -07:00
Mark 6ea7e9df97 Edits 2023-05-11 14:54:18 -07:00
Mark 90fd1e6ee1 Edits 2023-05-09 21:23:09 -07:00
Mark 3b197b0759 Added 2023-05-06 21:30:18 -07:00
Mark 62fc066e69 Started definable sets handout 2023-05-06 17:05:30 -07:00
Mark 88845c29eb Edited knot handout 2023-05-06 10:43:28 -07:00
Mark 7b2c8e395b Started DFA cleanup 2023-05-06 10:19:14 -07:00
Mark 04e5dcec97 Minor edit 2023-05-06 10:18:55 -07:00
Mark 51041aa804 Renamed folder 2023-05-05 15:06:56 -07:00
Mark fad0f5b896 Cleanup 2023-05-05 15:06:30 -07:00
Mark 19335875e4 Improved knot table 2023-05-05 14:53:42 -07:00
Mark 3e16019521 Added braids 2023-05-05 14:29:21 -07:00
Mark 3712e6becc Renamed files 2023-05-05 11:44:27 -07:00
Mark 1fc38cfe94 Added stick section 2023-05-04 21:34:36 -07:00
Mark 4a67ad5c81 Added link section 2023-05-04 11:48:07 -07:00
Mark 0b2f3efe1b Cleanup 2023-05-04 11:24:40 -07:00
Mark e96e529a3c Finished knot composition 2023-05-04 10:50:36 -07:00
Mark 2e3e1b3c56 Removed linear map handout 2023-05-03 22:40:03 -07:00
Mark f357725f5b Cleanup 2023-05-03 22:39:18 -07:00
Mark ecb259b229 Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-05-03 22:23:29 -07:00
Mark cc04825871 Added knot draft 2023-05-03 22:23:28 -07:00
Mark 46e463d420 Cleanup 2023-05-03 11:15:35 -07:00
Mark 8e131d3c31 Added tikz orchard 2023-04-30 21:08:34 -07:00
Mark a9eb8e75a3 Edits 2023-04-30 20:27:45 -07:00
Mark ea24c69100 Typos 2023-04-28 15:33:41 -07:00
Mark 8774a3ba59 Added lattice handout 2023-04-28 15:09:42 -07:00
Mark fbce34cf82 Minor fix 2023-04-28 15:09:22 -07:00
Mark a28eba5702 Applied edits 2023-04-20 21:11:28 -07:00
Mark 08add061e2 Cleanup 2023-04-19 08:58:26 -07:00
Mark 74a24c50ce Typo 2023-04-19 08:43:52 -07:00
Mark 5b08e1d224 Rearranged Linear Maps 2023-04-17 11:34:36 -07:00
Mark 81328c02e2 Finished LA 101 handout 2023-04-17 09:26:08 -07:00
Mark 4e33edf6e7 Added content 2023-04-16 17:29:46 -07:00
Mark 9c3b88827f Edited Linear Algebra 101 2023-04-10 11:48:29 -07:00
Mark 60f74eb9b6 Linear Algebra edits 2023-04-09 10:58:49 -07:00
Mark eaa5978dc9 Started basic LA handout 2023-04-05 15:31:36 -07:00
Mark 00a42b7765 Added Nikita notes 2023-04-05 09:08:43 -07:00
Mark a74f04f27a Rewrote Vectors, added Norms 2023-04-04 15:03:15 -07:00
Mark c18af4f5b8 Minor edits 2023-04-04 12:55:38 -07:00
Mark 78be03872d Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-04-03 13:20:17 -07:00
Mark 11e299c876 Minor edits 2023-04-03 13:19:23 -07:00
Mark 1c7ff4c6b3 Path fix 2023-04-03 11:40:14 -07:00
Mark 597e61fb8e Typo 2023-04-03 11:40:01 -07:00
Mark ef0abb5f17 Rearranged handout 2023-04-03 11:13:33 -07:00
Mark ef6fa1da2b Spelling 2023-04-03 11:09:02 -07:00
Mark d20ddd26b1 Minor edits 2023-04-02 09:20:18 -07:00
Mark 6236cebaed Updated README 2023-04-02 08:07:57 -07:00
Mark 1761619d66 Mockingbird edits 2023-03-30 20:55:05 -07:00
Mark 48ac646ee4 Mockingbird edits 2023-03-28 22:16:39 -07:00
Mark 9927c8ff43 Edits 2023-03-26 22:09:51 -07:00
Mark 55bbc39666 Added linear maps handout 2023-03-26 20:00:14 -07:00
Mark 0d340f2285 Updated README 2023-03-26 20:00:06 -07:00
Mark 7359ece19e Added a warm-up 2023-03-26 15:48:11 -07:00
Mark b640ef2bc4 Fixed date 2023-03-26 15:30:31 -07:00
Mark 54348b77dc Minor cleanup 2023-03-23 10:30:20 -07:00
Mark 8673634024 Added AST warm-up 2023-03-23 10:23:44 -07:00
Mark c0d9f64948 added nowarning option 2023-03-23 09:51:10 -07:00
Mark 36ee2e72ea Changed TeX engine 2023-03-16 19:36:26 -07:00
Mark 8d27bf87ce Finished TMAM hanout 2023-03-16 19:36:13 -07:00
Mark 9b55f682ce Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-03-16 13:45:19 -07:00
Mark 91a88caa7c Minor cleanup 2023-03-16 13:45:18 -07:00
Mark 1c92a3f0b4 Minor edits 2023-03-16 13:41:41 -07:00
Mark 596151b251 Cleanup 2023-03-07 22:00:47 -08:00
Mark 946752ef1b Started Mockingbird handout 2023-03-07 21:57:37 -08:00
Mark a0cf7cf2b5 Added origami handout 2023-03-04 21:22:31 -08:00
Mark afb465f89c Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-03-01 09:04:59 -08:00
Mark 3ed40abc11 Added short warning 2023-03-01 09:04:12 -08:00
Mark c4ff36ac27 Cleaned up pidgeonhole handout 2023-02-26 12:31:27 -08:00
Mark b7115e124d Added CI link, cleanup 2023-02-25 23:32:02 -08:00
Mark 7e528e4de7 Fixed bugs 2023-02-25 23:13:13 -08:00
Mark bc8fedb54a Squashed commit of jenkins changes 2023-02-25 22:59:00 -08:00
Mark 494e91dc98 Cleanup 2023-02-05 21:02:05 -08:00
Mark e3e09c9c95 Typo 2023-02-03 17:15:24 -08:00
Mark 1e50ad503d Typos 2023-02-03 15:59:10 -08:00
Mark 9653f103dc Typos 2023-02-03 13:19:19 -08:00
Mark 4bb7cd7c5d Edits to regex warmup 2023-01-31 14:45:34 -08:00
Mark 7c9b6b0d95 Fixed typo 2023-01-29 22:10:26 -08:00
Mark 850928f9a9 Added regex handout 2023-01-29 22:10:13 -08:00
Mark 6761863358 Fixed a few errors 2023-01-23 16:11:45 -08:00
Mark a632bf0029 Removed extra information 2023-01-19 20:38:04 -08:00
Mark e506eb926d Edits to group theory handout 2023-01-19 20:37:46 -08:00
Mark 7bad77dcd9 Added group theory parts 2023-01-19 11:58:53 -08:00
Mark 284107ab48 Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-01-16 08:30:46 -08:00
Mark 2235bdfaac Removed hard problems from warmup 2023-01-16 08:30:39 -08:00
Mark 8f05e8753f Edited group handout 2023-01-13 22:46:10 -08:00
Mark 01d167db1c Merge branch 'master' of ssh://git.betalupi.com:33/Mark/ormc-handouts 2023-01-13 18:51:18 -08:00
Mark f0b0a200bf Added initial parts of group theory handout 2023-01-13 18:50:57 -08:00
Mark 0b2c39ad63 Merged changes 2023-01-13 10:17:11 -08:00
Mark 513bac6f54 Cleaned up RAID handout 2023-01-12 18:56:54 -08:00
Mark 7e2ebc4fc7 Updated .gitignore 2023-01-12 10:50:24 -08:00
Mark 5ef1d0f461 Moved tex packages into this repo 2023-01-12 10:30:53 -08:00
Mark 3ff9ea3c50 Metafile cleanup 2023-01-12 10:23:48 -08:00
Mark b8711ffb6a Fixed old boxlinehack command 2023-01-12 09:41:51 -08:00
Mark 9e99560b38 Added ECC handout 2023-01-12 08:31:10 -08:00
Mark 46d7d99cc6 Warm-Up cleanup 2023-01-10 08:09:57 -08:00
Mark 7324adf7c1 Added RAID warm-up 2023-01-09 22:00:41 -08:00
Mark 2342ef994d Typo 2023-01-08 19:29:05 -08:00
Mark 81ba94739c Added electrician's warm-up 2023-01-08 10:34:53 -08:00
Mark 3ca7393759 Applied edits to network flow handout 2023-01-08 09:10:54 -08:00
Mark bc3ed650f7 Minor edits 2022-11-23 10:04:10 -08:00
Mark 9cec9430b8 Finished last two sections 2022-11-22 22:17:01 -08:00
Mark 61b137e389 Added "applications" section 2022-11-21 22:01:21 -08:00
Mark d8a2f8af98 Fixed build config 2022-11-21 20:48:33 -08:00
Mark 382cb1eec4 Updated VSCode settings 2022-11-15 11:45:40 -08:00
Mark fc2161a7f7 Minor fix 2022-11-15 11:41:02 -08:00
Mark dd4f474fc5 Added README 2022-11-15 11:40:53 -08:00
Mark 676a2324d6 Added meta files 2022-11-13 13:38:23 -08:00
Mark bfc3177c97 Added Euler's handout 2022-11-13 13:31:54 -08:00
Mark e425f97321 Added Moscow Puzzles 2022-11-13 13:31:00 -08:00
Mark 9bd46bea80 Added Pidgeonhole handout 2022-11-13 13:22:09 -08:00
Mark 0ae312c8f0 Spelling 2022-11-13 13:19:56 -08:00
Mark 22cbe0dbb5 Added vector handouts 2022-11-13 13:17:43 -08:00
Mark 0266e8d90d Added combinatorics and probability handouts 2022-11-13 13:15:53 -08:00
Mark 4f3afd7b96 Added Graph Theory handout 2022-11-13 13:14:04 -08:00
Mark bc0d4d9493 Added Slide Rule & Instant Insanity handouts 2022-11-13 13:11:57 -08:00
Mark b93b574c3f Added Graph Algorithms handout 2022-11-13 13:03:14 -08:00
Mark 12c677f2da Added Crypto & Lambda handouts 2022-11-13 13:02:25 -08:00
18 changed files with 1708 additions and 42 deletions
+2 -4
View File
@@ -2,8 +2,6 @@ name: CI
on: on:
push: push:
branches:
- main
pull_request: pull_request:
workflow_dispatch: workflow_dispatch:
@@ -91,7 +89,7 @@ jobs:
retention-days: 7 retention-days: 7
- name: "Publish package (hash)" - name: "Publish package (hash)"
if: ${{ github.event_name == 'push' && github.ref == 'refs/heads/main' }} if: ${{ github.event_name == 'push' && github.ref == 'refs/heads/master' }}
run: | run: |
PUBLISH_USER="${{ secrets.PUBLISH_USER }}" \ PUBLISH_USER="${{ secrets.PUBLISH_USER }}" \
PUBLISH_KEY="${{ secrets.PUBLISH_KEY }}" \ PUBLISH_KEY="${{ secrets.PUBLISH_KEY }}" \
@@ -100,7 +98,7 @@ jobs:
python tools/scripts/publish.py python tools/scripts/publish.py
- name: "Publish package (latest)" - name: "Publish package (latest)"
if: ${{ github.event_name == 'push' && github.ref == 'refs/heads/main' }} if: ${{ github.event_name == 'push' && github.ref == 'refs/heads/master' }}
run: | run: |
PUBLISH_USER="${{ secrets.PUBLISH_USER }}" \ PUBLISH_USER="${{ secrets.PUBLISH_USER }}" \
PUBLISH_KEY="${{ secrets.PUBLISH_KEY }}" \ PUBLISH_KEY="${{ secrets.PUBLISH_KEY }}" \
+1 -2
View File
@@ -1,5 +1,4 @@
{ {
"latex-workshop.latex.recipe.default": "latexmk (xelatex)", "latex-workshop.latex.recipe.default": "latexmk (xelatex)",
"tinymist.formatterPrintWidth": 80, "tinymist.formatterPrintWidth": 80
"tinymist.typstExtraArgs": ["--package-path=./lib/typst"]
} }
+674
View File
@@ -0,0 +1,674 @@
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<https://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
<https://www.gnu.org/licenses/why-not-lgpl.html>.
+156
View File
@@ -0,0 +1,156 @@
# ORMC Handouts
This repository contains all the handouts I've written for the [ORMC](https://circles.math.ucla.edu/circles/). \
You can find the latest PDFs [here](https://static.betalupi.com/ormc).
**For my students:** Handouts will appear here a few days before class. Please don't look at them (or their solutions) beforehand, that spoils all the fun!
**For everyone else:** If you are not affiliated with the ORMC, ask for permission before using these.
## 📦 Contents
Handouts are sorted by the class they're for:
- [`./Intermediate`](./Intermediate/): Grades 5 - 9
- [`./Advanced`](./Advanced): Grades 9 - 12
Grade levels are estimates.
## 🛠️ Building these Handouts
Automatic builds are [here](https://static.betalupi.com/ormc), if you just want the PDFs.
If you want to edit these files, you'll need to download a custom document class. \
To compile one handout, do the following:
1. Download the handout's directory (i.e, download the whole repo as a zip and extract the folder you want.)
1. Download [`./resources/ormc_handout.cls`](./resources/ormc_handout.cls)
2. Put this class in the same directory as the handout.
3. Fix the include path at the top of the handout.
Usually, you'll need to replace
```latex
\documentclass[
...
]{../../../lib/tex/ormc_handout}
```
with
```latex
\documentclass[
...
]{ormc_handout}
```
These documents should work with any LaTeX engine. \
However, try changing your engine to LuaLaTeX if something breaks.
---------------------------------------------------------------------------
# 📜 Class Documentation
The class `ormc_handout` is based on `article.cls`, and should work with most LaTeX packages. It has everything you need and nothing you don't; it looks pretty and it is optimized for greyscale printing.
If you find something broken, please tell me so I may try to fix it.
## 🎏 Arguments
These are passed to `\documentclass`, as follows:
```latex
% Documentclass argument example
\documentclass[
nosolutions,
shortwarning
]{ormc_handout}
```
- `10pt`, `11pt`, `12pt`:\
Default: `10pt`. Sets font size.
- `pagenumber`, `nopagenumber`:\
Default: `pagenumber`. Shows or hides page numbers.
- `solutions`, `nosolutions`:\
Default: `solutions`\
If `nosolutions` is passed, `solution` and `instructornote` environments are hidden.
- `showwarning`, `hidewarning`:\
Default: `showwarning`. Shows or hides instructor handout warning.
- `shortwarning`, `longwarning`:\
Default: `longwarning`. Sets instructor handout warning type.
- `multinumbering`, `singlenumbering`:\
Default: `multinumbering`\
How problems, theorems, etc should be numbered. If `mulitnumbering` is passed, problems, theorems, etc will be numbered independently. If `singlenumbering` is passed, one global counter will be used. (I think `singlenumering` is better, it makes the handout easier to navigate.)
Use `geometry` to change page lengths. Letter paper is the default.
## 🪖 Commands & More:
`ormc_handout` automatically includes `tcolorbox`, `xcolor`, `tikz`, `amsmath`, `amssymb`. \
It also includes a few other packages that are used internally and shouldn't have an effect on most workflows.
### **Basics:**
- `\say{text}`: Puts text in quotes, handling details like period spacing. Courtesy of `dirtytalk`.
- `\tab`: Typewriter-style tabs every `1cm`. Courtesy of `tabto`.
- `\maketitle`: Makes a title. This is never placed on a separate page.
- Set title data with the following commands:\
`\title{text}`, `\subtitle{text}`, `\uptitlel{text}`, `\uptitler{text}`\
`\uptitlel` and `\uptitler` are optional, but usually come together.
- `\note[Type]{text}`: Makes a note.
- `\hint{text}`: Shorthand for `\note[Hint]{text}`
### **Sectioning:**
The usual LaTeX title-customization techniques *WILL NOT WORK* with this class.\
Don't even try to load `titlesec`.
- `\section{title}<label>`: Creates a section with an optional label.\
You do not need to include the angle brackets.\
If you do, you can reference this section with `\ref{label}`.
- `\definition{title}<label>`: Makes a definition. Works just like `\section`.
- `\proposition{title}<label>`: Makes a proposition. Works just like `\section`.
- `\theorem{title}<label>`: Makes a theorem. Works just like `\section`.
- `\example{title}<label>`: Makes an example. Works just like `\section`.
- `\problem{title}<label>`: Makes a problem. Works just like `\section`.
- `\problempart{title}<label>`: Makes a problem part. Works just like `\section`.\
As the name implies, this command should only be used to make subparts of `\problems`.\
This command may be removed in the future.
- `\generic{title}<label>`: Makes a generic section. Works just like `\section`.\
Avoid using this if you can. \
Generic sections have no counter, and are usually used to get text to look the same as a section title. \
This command may be removed in the future.
### **Environments:**
- `\begin{solution}`: A fancy `tcolorbox` for solutions to problems. \
This is hidden if the `nosolutions` flag is passed.
- `\begin{instrutornote}`: A fancy `tcolorbox` for instructor notes. \
This is hidden if the `nosolutions` flag is passed.
- `\begin{examplesolution}`: A fancy `tcolorbox` for sample solutions. \
This is never hidden.
All the above environments break across pages and may be safely nested.
Each also has a special command `\linehack`, which draws a line across the box.\
Use `\linehack` instead of `tcolorbox` sections. `tcolorbox` only lets you have two, while `\linehack` gives you as many as you want.
-3
View File
@@ -1,3 +0,0 @@
[authors."mark"]
email = "mark@betalupi.com"
webpage = "betalupi.com"
-6
View File
@@ -1,6 +0,0 @@
[package]
name = "handout"
version = "0.1.0"
entrypoint = "handout.typ"
authors = []
license = "GPL"
@@ -1,5 +1,3 @@
/// Typst handout library, used for all documents in this repository.
/// If false, hide instructor info. /// If false, hide instructor info.
/// ///
@@ -240,8 +238,8 @@
set page( set page(
margin: 20mm, margin: 20mm,
width: 8in, width: 8.5in,
height: 11.5in, height: 11in,
footer: align( footer: align(
center, center,
context counter(page).display(), context counter(page).display(),
+1 -1
View File
@@ -1,4 +1,4 @@
#import "@local/handout:0.1.0": * #import "./handout.typ": *
#import "@preview/cetz:0.3.1" #import "@preview/cetz:0.3.1"
+1 -1
View File
@@ -1,4 +1,4 @@
#import "@local/handout:0.1.0": * #import "./handout.typ": *
#show: doc => handout( #show: doc => handout(
doc, doc,
@@ -1,4 +1,4 @@
#import "@local/handout:0.1.0": * #import "../handout.typ": *
#import "../macros.typ": * #import "../macros.typ": *
= Tropical Arithmetic = Tropical Arithmetic
@@ -62,7 +62,8 @@ Let's expand $#sym.RR$ to include a tropical additive identity.
#problem() #problem()
Do tropical additive inverses exist? \ Do tropical additive inverses exist? \
#note([ #note([
Is there an inverse $y$ for every $x$ so that $x #tp y = #sym.infinity$? Is there an inverse $y$ for every $x$ so that $x #tp y = #sym.infinity$? \
Remember that $#sym.infinity$ is the additive identity.
]) ])
#solution([ #solution([
@@ -277,7 +278,7 @@ Fill the following tropical addition and multiplication tables
#problem() #problem()
Expand and simplify $f(x) = (x #tp 2)(x #tp 3)$, then evaluate $f(1)$ and $f(4)$ \ Expand and simplify $f(x) = (x #tp 2)(x #tp 3)$, then evaluate $f(1)$ and $f(4)$ \
Adjacent parenthesis imply tropical multiplication #hint([Adjacent parenthesis imply tropical multiplication])
#solution([ #solution([
$ $
@@ -1,4 +1,4 @@
#import "@local/handout:0.1.0": * #import "../handout.typ": *
#import "../macros.typ": * #import "../macros.typ": *
#import "@preview/cetz:0.3.1" #import "@preview/cetz:0.3.1"
@@ -20,7 +20,7 @@ for some nonnegative integer $n$ and coefficients $c_0, c_1, ..., c_n$. \
The _degree_ of a polynomial is the largest $n$ for which $c_n$ is nonzero. The _degree_ of a polynomial is the largest $n$ for which $c_n$ is nonzero.
#theorem() #theorem()
The _fundamental theorem of algebra_ implies that any non-constant polynomial with real coefficients The _fundamental theorem of algebra_ states that any non-constant polynomial with real coefficients
can be written as a product of polynomials of degree 1 or 2 with real coefficients. can be written as a product of polynomials of degree 1 or 2 with real coefficients.
#v(2mm) #v(2mm)
@@ -30,8 +30,8 @@ can be written as $(x^2 + 2x+5)(x-2)(x+4)(x+4)$
#v(2mm) #v(2mm)
A similar theorem exists for polynomials with complex coefficients. \ A similar theorem exists for polynomials with complex coefficients. \
These coefficients may be found using the roots of this polynomial. \ These coefficients may be found using the _roots_ of this polynomial. \
As it turns out, there are formulas that determine the roots of quadratic, cubic, and quartic #note([(degree 2, 3, and 4)]) polynomials. There are no formulas for the roots of polynomials with larger degrees---in this case, we usually rely on approximate roots found by computers. As you already know, there are formulas that determine the roots of quadratic, cubic, and quartic #note([(degree 2, 3, and 4)]) polynomials. There are no formulas for the roots of polynomials with larger degrees---in this case, we usually rely on appropriate roots found by computers.
#v(2mm) #v(2mm)
In this section, we will analyze tropical polynomials: In this section, we will analyze tropical polynomials:
@@ -100,7 +100,7 @@ In other words, find $r$ and $s$ so that
), ),
) )
we will call $r$ and $s$ the _roots_ of $f$. #note([Naturally, we will call $r$ and $s$ the _roots_ of $f$.])
#solution([ #solution([
Because $(x #tp r)(x #tp s) = x^2 #tp (r #tp s)x #tp s r$, we must have $r #tp s = 1$ and $r #tm s = 4$. \ Because $(x #tp r)(x #tp s) = x^2 #tp (r #tp s)x #tp s r$, we must have $r #tp s = 1$ and $r #tm s = 4$. \
@@ -116,7 +116,8 @@ we will call $r$ and $s$ the _roots_ of $f$.
#v(1fr) #v(1fr)
#problem() #problem()
How can we use the graph to determine these roots? Can you see the roots of this polynomial in the graph? \
#hint([Yes, you can. What "features" do the roots correspond to?])
#solution([The roots are the corners of the graph.]) #solution([The roots are the corners of the graph.])
@@ -316,7 +317,7 @@ into linear factors.
#v(2mm) #v(2mm)
Whenever we say "the roots of $f$", we really mean "the roots of $accent(f, macron)$." \ Whenever we say "the roots of $f$", we really mean "the roots of $accent(f, macron)$." \
$f$ and $accent(f, macron)$ might be the same polynomial. Also, $f$ and $accent(f, macron)$ might be the same polynomial.
#problem() #problem()
If $f(x) = a x^2 #tp b x #tp c$, then $accent(f, macron)(x) = a x^2 #tp B x #tp c$ for some $B$. \ If $f(x) = a x^2 #tp b x #tp c$, then $accent(f, macron)(x) = a x^2 #tp B x #tp c$ for some $B$. \
@@ -1,4 +1,4 @@
#import "@local/handout:0.1.0": * #import "../handout.typ": *
#import "../macros.typ": * #import "../macros.typ": *
#import "@preview/cetz:0.3.1" #import "@preview/cetz:0.3.1"
-5
View File
@@ -4,8 +4,3 @@ title = "Odd Dice"
[publish] [publish]
handout = true handout = true
solutions = true solutions = true
[[attribution]]
who = "mark"
when = 2024-02-13
what = "Initial version of handout"
File diff suppressed because one or more lines are too long

After

Width:  |  Height:  |  Size: 53 KiB

+37
View File
@@ -0,0 +1,37 @@
\documentclass[
solutions,
singlenumbering,
nopagenumber
]{../../../lib/tex/ormc_handout}
\usepackage{../../../lib/tex/macros}
\title{Warm-Up: Exact answers}
\uptitler{\smallurl{}}
\subtitle{Prepared by Mark on \today}
\begin{document}
\maketitle
Compute the exact value of $\sin(x^\circ)$ for as many integers $x \in [0, 90]$ as you can.
\generic{Helpful identities:}
This is not a complete list. In many cases, geometry is more helpful than algebra. \\
Note that the first identity is only valid if $\alpha \in [0, 90]$.
\vspace{2mm}
$\sin(\frac{\alpha}{2}) = \sqrt{\frac{1 - \cos(\alpha)}{2}}$ \\
$\sin(\alpha + \beta) = \sin(\alpha)\cos(\beta) + \cos(\alpha)\sin(\beta)$ \\
$\sin(3\alpha) = 3\sin(\alpha) - 4\sin(\alpha)^3$
\begin{solution}
The solutions to these get ugly quickly.
\vspace{5mm}
A good order to go in is 45, 30, 60, 15, 75, 36, 18, 3, 6, 72, 9, 1. \\
You should be able to get all of these using only geometry and the identities above.
\end{solution}
\end{document}
+233
View File
@@ -0,0 +1,233 @@
\documentclass[
solutions,
singlenumbering,
nopagenumber
]{../../../lib/tex/ormc_handout}
\usepackage{../../../lib/tex/macros}
\usepackage{ifthen}
\usetikzlibrary{arrows.meta}
\usetikzlibrary{shapes.geometric}
\usetikzlibrary{patterns}
% We put nodes in a separate layer, so we can
% slightly overlap with paths for a perfect fit
\pgfdeclarelayer{nodes}
\pgfdeclarelayer{path}
\pgfsetlayers{main,nodes}
% Layer settings
\tikzset{
% Layer hack, lets us write
% later = * in scopes.
layer/.style = {
execute at begin scope={\pgfonlayer{#1}},
execute at end scope={\endpgfonlayer}
},
%
% Arrowhead tweak
>={Latex[ width=2mm, length=2mm ]},
%
% Labels inside edges
label/.style = {
rectangle,
% For automatic red background in solutions
fill = \ORMCbgcolor,
draw = none,
rounded corners = 0mm
},
%
% Nodes
main/.style = {
draw,
circle,
fill = white,
line width = 0.4mm,
text width = 5mm,
align = center
},
accept/.style = {
draw,
circle,
fill = white,
double,
double distance = 0.5mm,
line width = 0.4mm,
text width = 5mm,
align = center
},
}
\title{Warm-Up: Snakes}
\uptitler{\smallurl{}}
\subtitle{Prepared by Mark on \today}
\begin{document}
\maketitle
\newcounter{mycounter}
\setcounter{mycounter}{0}
\newif\iftmp
\begin{center}
\begin{tikzpicture}[scale = 0.6]
\begin{scope}[layer = nodes]
\foreach \r in {1,3,5,7,9} {
\foreach \i in {1,...,10} {
\pgfmathparse{Mod(\i-1,10)}
\let\x\pgfmathresult
\pgfmathparse{div(\i-1,10) + \r}
\let\y\pgfmathresult
\pgfmathparse{(\r-1)*10+\i}
\let\z\pgfmathresult
\tmpfalse
\pgfmathapproxequalto{\z}{4}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{5}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{19}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{21}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{28}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{31}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{35}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{44}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{47}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{52}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{53}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{59}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{70}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{76}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{81}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{88}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{98}
\ifpgfmathcomparison\tmptrue
\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi
\stepcounter{mycounter}
\iftmp
\node[accept] (\arabic{mycounter}) at (2*\x, 2*\y) {
$\pgfmathprintnumber{\z}$
};
\else
\node[main] (\arabic{mycounter}) at (2*\x, 2*\y) {
$\pgfmathprintnumber{\z}$
};
\fi
}
\foreach \i in {1,...,10} {
\pgfmathparse{9 - Mod(\i-1,10)}
\let\x\pgfmathresult
\pgfmathparse{div(\i-1,10) + \r + 1}
\let\y\pgfmathresult
\pgfmathparse{\r*10+\i}
\let\z\pgfmathresult
\tmpfalse
\pgfmathapproxequalto{\z}{4}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{5}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{19}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{21}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{28}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{31}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{35}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{44}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{47}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{52}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{53}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{59}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{70}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{76}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{81}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{88}
\ifpgfmathcomparison\tmptrue
\else\pgfmathapproxequalto{\z}{98}
\ifpgfmathcomparison\tmptrue
\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi
\stepcounter{mycounter}
\iftmp
\node[accept] (\arabic{mycounter}) at (2*\x, 2*\y) {
$\pgfmathprintnumber{\z}$
};
\else
\node[main] (\arabic{mycounter}) at (2*\x, 2*\y) {
$\pgfmathprintnumber{\z}$
};
\fi
}
}
\end{scope}
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(4) -- +(1,0) -- +(1, 13) -- +(3, 13) -> (75);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(5) -- +(0,-1) -- +(1,-1) -- +(1,1) -- (15);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(19) -- +(1, 0) -- +(1, 5) -- + (-1, 5) -- (41);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(21) -- +(1, 0) -- +(1,-5) -- +(3, -5) -- (3);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(28) -- +(1,0) -- +(1,3) -- +(3,3) -- (50);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(31) -- +(1,0) -- +(1,-7) -- +(-3, -7) -- (8);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(35) -- +(-1,0) -- +(-1,11) -- (96);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(44) -- +(-1,0) -- +(-1,7) -- +(-3,7) -- (82);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(47) -- +(1,0) -- +(1,-3) -- +(5,-3) -- (30);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(52) -- +(-1, 0) -- +(-1, -1) -- +(-5,-1) -- +(-5,-5) -- +(-11,-5) -- (23);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(53) -- +(-1,0) -- +(-1,7) -- (94);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(59) -- +(-1, 0) -- +(-1,1) -- +(-3,1) -- +(-3,9) -- +(7, 9) -- (95);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(70) -- +(-1, 0) -- +(-1, 5) -- (91);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(76) -- +(-1, 0) -- +(-1,-1) -- +(-5,-1) -- +(-5,-5) -- +(-7,-5) -- (41);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(81) -- +(0, -1) -- +(3, -1) -- +(3, -3) -- (62);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(88) -- +(1, 0) -- +(1, -3) -- +(-1,-3) -- (67);
\draw[->, line width = 0.6mm, rounded corners = 2mm]
(98) -- +(0, 1.5) -- +(15.5, 1.5) -- +(15.5,-15) -- +(13, -15) -- (12);
\end{tikzpicture}
\end{center}
\end{document}
+96
View File
@@ -0,0 +1,96 @@
\documentclass[
solutions,
hidewarning,
singlenumbering,
nopagenumber
]{../../../lib/tex/ormc_handout}
\usepackage{../../../lib/tex/macros}
\title{Warm-Up: Turing Machine}
\uptitler{\smallurl{}}
\subtitle{Prepared by Mark on \today.}
\begin{document}
\maketitle
Consider a turing machine that understands the following instructions:
\begin{itemize}[itemsep=2mm]
\item \texttt{>}: Move the tape right
\item \texttt{<}: Move the tape left
\item \texttt{+}: Increment the value in the current cell by 1. \par
If the resulting value exceeds 255, wrap to 0.
\item \texttt{-}: Decrement the value in the current cell by 1. \par
If the resulting value is smaller than 0, wrap to 255.
\item \texttt{[}: If the the value of the current cell is 0, jump to the matching \texttt{]}. \par
Otherwise, jump to the next instruction.
\item \texttt{]}: If the value of the current cell is 0, jump to the next instruction. \par
Otherwise, jump back to the matching \texttt{[}.
\end{itemize}
For example, the program \texttt{+>++>+++>++++>-} will set the first five cells to $[1, 2, 3, 4, 255]$. \par
All other cells will be zero, since they were not modified.
\problem{}
What does the snippet \texttt{[-]} do? \par
Is this different from \texttt{[+]}?
\vfill
\problem{}
What does \texttt{[->+<]} do?
\begin{solution}
Move the value of this cell into the next cell
\end{solution}
\vfill
\problem{}
Write a program that adds the value of the current cell to the next cell. \par
You do not need to preserve the value of the current cell.
\vfill
\pagebreak
\problem{}
What does \texttt{[>]} do?
\begin{solution}
Finds the first zero cell to the right
\end{solution}
\vfill
\problem{}
Write a program that copies the value of the current cell into the next cell,
preserving its initial value. \par
\hint{You may use as many "scratch" cells as you want.}
\vfill
\problem{}
Write a program that computes the product of the current cell and the next cell.
\vfill
\problem{Bonus}
Write a program that computes the square of the current cell. \par
(If your program starts at a cell with value \texttt{7}, it should end at a cell with value \texttt{49}.)
\vfill
\problem{Bonus}
What does \texttt{+[>[<-]<[->+<]>]>} do?
\begin{solution}
Finds the first non-zero cell to the right
\end{solution}
\end{document}
+1 -5
View File
@@ -143,12 +143,10 @@ def build_typst(source_dir: Path, out_subdir: Path) -> IndexEntry | None:
[ [
TYPST_PATH, TYPST_PATH,
"compile", "compile",
"--package-path",
f"{ROOT}/lib/typst",
"--ignore-system-fonts", "--ignore-system-fonts",
"main.typ",
"--input", "--input",
"show_solutions=false", "show_solutions=false",
"main.typ",
f"{out}/{handout_file}", f"{out}/{handout_file}",
], ],
cwd=source_dir, cwd=source_dir,
@@ -166,8 +164,6 @@ def build_typst(source_dir: Path, out_subdir: Path) -> IndexEntry | None:
[ [
TYPST_PATH, TYPST_PATH,
"compile", "compile",
"--package-path",
f"{ROOT}/lib/typst",
"--ignore-system-fonts", "--ignore-system-fonts",
"main.typ", "main.typ",
f"{out}/{solutions_file}", f"{out}/{solutions_file}",