Compare commits
2 Commits
quantum
...
e9a8441a7b
| Author | SHA1 | Date | |
|---|---|---|---|
| e9a8441a7b | |||
| 629a03944b |
@@ -230,7 +230,7 @@ The \textit{tensor product} of two vectors is defined as follows:
|
|||||||
That is, we take our first vector, multiply the second
|
That is, we take our first vector, multiply the second
|
||||||
vector by each of its components, and stack the result.
|
vector by each of its components, and stack the result.
|
||||||
You could think of this as a generalization of scalar
|
You could think of this as a generalization of scalar
|
||||||
mulitiplication, where scalar mulitiplication is a
|
multiplication, where scalar multiplication is a
|
||||||
tensor product with a vector in $\mathbb{R}^1$:
|
tensor product with a vector in $\mathbb{R}^1$:
|
||||||
\begin{equation*}
|
\begin{equation*}
|
||||||
a
|
a
|
||||||
|
|||||||
@@ -251,7 +251,7 @@ What is it, and what is its color? \par
|
|||||||
\textbf{Part 4:}
|
\textbf{Part 4:}
|
||||||
|
|
||||||
The promoted black bishop on H2 must have been promoted on G1. The pawn which was promoted must have come from G7,
|
The promoted black bishop on H2 must have been promoted on G1. The pawn which was promoted must have come from G7,
|
||||||
since neither of the pawns from F6 or H6 could make a capture to get to the G-file (all six missing white pieces have been accouted for).
|
since neither of the pawns from F6 or H6 could make a capture to get to the G-file (all six missing white pieces have been accounted for).
|
||||||
The Pawn from E7 has promoted to the bishop on A2.
|
The Pawn from E7 has promoted to the bishop on A2.
|
||||||
|
|
||||||
What happened was this: the white pawn from G2 made its capture on H3 while the pawn on G3 was still on H2. This allowed the black pawn
|
What happened was this: the white pawn from G2 made its capture on H3 while the pawn on G3 was still on H2. This allowed the black pawn
|
||||||
|
|||||||
@@ -331,7 +331,7 @@
|
|||||||
representing all four cubes. \\
|
representing all four cubes. \\
|
||||||
|
|
||||||
\begin{center} \begin{small}
|
\begin{center} \begin{small}
|
||||||
\begin{tikzpicture} \label{pic:II_comfiguration}
|
\begin{tikzpicture} \label{pic:II_configuration}
|
||||||
\filldraw [blue] (0,5) -- (1,5) -- (1,6) --
|
\filldraw [blue] (0,5) -- (1,5) -- (1,6) --
|
||||||
(0,6) -- (0,5);
|
(0,6) -- (0,5);
|
||||||
\draw [line width = 1.5pt] (0,5) --
|
\draw [line width = 1.5pt] (0,5) --
|
||||||
|
|||||||
11
src/Warm-Ups/Bugs/main.typ
Normal file
11
src/Warm-Ups/Bugs/main.typ
Normal file
@@ -0,0 +1,11 @@
|
|||||||
|
#import "@local/handout:0.1.0": *
|
||||||
|
|
||||||
|
#show: handout.with(
|
||||||
|
title: [Warm-Up: Bugs on a Log],
|
||||||
|
by: "Mark",
|
||||||
|
)
|
||||||
|
|
||||||
|
#problem()
|
||||||
|
2013 bugs are on a meter-long line. Each walks to the left or right at a constant speed. \
|
||||||
|
If two bugs meet, both turn around and continue walking in opposite directions. \
|
||||||
|
What is the longest time it could take for all the bugs to walk off the end of the log?
|
||||||
6
src/Warm-Ups/Bugs/meta.toml
Normal file
6
src/Warm-Ups/Bugs/meta.toml
Normal file
@@ -0,0 +1,6 @@
|
|||||||
|
[metadata]
|
||||||
|
title = "Bugs on a Log"
|
||||||
|
|
||||||
|
[publish]
|
||||||
|
handout = true
|
||||||
|
solutions = true
|
||||||
Reference in New Issue
Block a user