Mark/handouts
1
1
Fork 0
Code Pull Requests 2 Actions Packages Releases Activity

Compare commits

base: Mark:ca8426284a3096e0a4e2392e639c743fe26e7246
Branches Tags
Mark:main Mark:quantum Mark:typst-quantum Mark:attribution Mark:master-old
..
compare: Mark:1e6a533ca4590894e6ca0db3fde2321965ac83b8
Branches Tags
Mark:quantum Mark:typst-quantum Mark:main Mark:attribution Mark:master-old

2 Commits
ca8426284a ... 1e6a533ca4

Author SHA1 Message Date
Mark
1e6a533ca4 Warm-Up: Georgian
All checks were successful
CI / Typos (pull_request) Successful in 11s
Details
CI / Typst formatting (pull_request) Successful in 6s
Details
CI / Build (pull_request) Successful in 6m22s
Details
2025-11-01 17:33:17 -07:00
Mark
35771206e0 Warm-Up: Pairs 2025-11-01 17:33:13 -07:00
1 changed files with 1 additions and 1 deletions
Expand all files Collapse all files

2
src/Warm-Ups/Pairs/main.typ
View File

@@ -8,7 +8,7 @@
#problem() #problem()
$n$ black and $n$ white points are randomly distributed on a plane. No three points are collinear.\ $n$ black and $n$ white points are randomly distributed on a plane. No three points are collinear.\
Show that it is always possible to draw $n$ nonintersecting lines between pairs of points of different colors. Show that it is always possible to draw $n$ nonintersecting line segments between pairs of points of different colors.
#solution([ #solution([
Consider the total length of all lines on the plane. Consider the total length of all lines on the plane.