40 lines
642 B
Typst
40 lines
642 B
Typst
|
#import "@local/handout:0.1.0": *
|
||
|
|
||
|
#show: doc => handout(
|
||
|
doc,
|
||
|
quarter: link(
|
||
|
"https://betalupi.com/handouts",
|
||
|
"betalupi.com/handouts",
|
||
|
),
|
||
|
|
||
|
title: [Warm-Up: A Familiar Concept],
|
||
|
by: "Mark",
|
||
|
)
|
||
|
|
||
|
#problem()
|
||
|
Let $v = [-5, -2, 0, 1, 4, 1000]$. Find all $x$ that minimize the following metric:
|
||
|
|
||
|
#align(
|
||
|
center,
|
||
|
box(
|
||
|
inset: 3mm,
|
||
|
$
|
||
|
sum_(#sym.forall i) |v_i - x| = |v_1 - x| + |v_2 - x| + ... + |v_6 - x|
|
||
|
$,
|
||
|
),
|
||
|
)
|
||
|
|
||
|
#v(1fr)
|
||
|
|
||
|
#problem()
|
||
|
Let $v = [-5, -2, 0, 1, 4, 1000, 1001]$. Find all $x$ that minimize the metric in the previous problem.
|
||
|
|
||
|
#v(1fr)
|
||
|
|
||
|
|
||
|
#problem()
|
||
|
What is this metric usually called?
|
||
|
|
||
|
|
||
|
#v(0.25fr)
|