Problem 1
Fridolin the frog jumps on the number line: He starts at $0$, then jumps in some order on each of the numbers $1,2,\dots,9$ exactly once and finally returns with his last jump to $0$. Can the total distance he travelled with these $10$ jumps be a) $20$, b) $25$?
Fridolin the frog jumps on the number line: He starts at $0$, then jumps in some order on each of the numbers $1,2,\dots,9$ exactly once and finally returns with his last jump to $0$. Can the total distance he travelled with these $10$ jumps be a) $20$, b) $25$?
Problem 2
For each integer $n \ge 2$ we consider the last digit different from zero in the decimal expansion of $n!$. The infinite sequence of these digits starts with $2,6,4,2,2$. Determine all digits which occur at least once in this sequence, and show that each of those digits occurs in fact infinitely often.
For each integer $n \ge 2$ we consider the last digit different from zero in the decimal expansion of $n!$. The infinite sequence of these digits starts with $2,6,4,2,2$. Determine all digits which occur at least once in this sequence, and show that each of those digits occurs in fact infinitely often.
Problem 3
Let $k$ be a semicircle with diameter $AB$ and midpoint $M$. Let $P$ be a point on $k$ different from $A$ and $B$.
The circle $k_A$ touches $k$ in a point $C$, the segment $MA$ in a point $D$, and additionally the segment $MP$. The circle $k_B$ touches $k$ in a point $E$ and additionally the segments $MB$ and $MP$.
Show that the lines $AE$ and $CD$ are perpendicular.
Problem 4
Let $k$ be a semicircle with diameter $AB$ and midpoint $M$. Let $P$ be a point on $k$ different from $A$ and $B$.
The circle $k_A$ touches $k$ in a point $C$, the segment $MA$ in a point $D$, and additionally the segment $MP$. The circle $k_B$ touches $k$ in a point $E$ and additionally the segments $MB$ and $MP$.
Show that the lines $AE$ and $CD$ are perpendicular.
Problem 4
For integers $m,n \ge 3$ we consider a $m \times n$ rectangular frame, consisting of the $2m+2n-4$ boundary squares of a $m \times n$ rectangle.
Renate and Erhard play the following game on this frame, with Renate to start the game. In a move, a player colours a rectangular area consisting of a single or several white squares. If there are any more white squares, they have to form a connected region. The player who moves last wins the game.
Determine all pairs $(m,n)$ for which Renate has a winning strategy.
Renate and Erhard play the following game on this frame, with Renate to start the game. In a move, a player colours a rectangular area consisting of a single or several white squares. If there are any more white squares, they have to form a connected region. The player who moves last wins the game.
Determine all pairs $(m,n)$ for which Renate has a winning strategy.
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου