4 – We Solve Problems

4

Problems:

1.

Theory of algorithms (other) 11-13

A cat tries to catch a mouse in labyrinths A, B, and C. The cat walks first, beginning with the node marked with the letter “K”. Then the mouse $($ from the node “M”$)$ moves, then again the cat moves, etc. From any node the cat and mouse go to any adjacent node. If at some point the cat and mouse are in the same node, then the cat eats the mouse.
Can the cat catch the mouse in each of the cases A, B, C?
$\\$

$\\$
A                                                       B                                                          C

 

 

2.

Boundedness, monotonicity , Quadratic inequaities and systems of inequalities 14-17

For which natural K does the number reach its maximum value?

3.

Examples and counterexamples. Constructive proofs , Pigeonhole principle (other) , Theory of algorithms (other) 14-17

The function F is given on the whole real axis, and for each x the equality holds: F $(x + 1)$ F $(x)$ + F $(x + 1)$ + 1 = 0.
Prove that the function F can not be continuous.

4.

Dissections (other) 11-13

Two play a game on a chessboard 8 × 8. The player who makes the first move puts a knight on the board. Then they take turns moving it $($ according to the usual rules $)$, whilst you can not put the knight on a cell which he already visited. The loser is one who has nowhere to go. Who wins with the right strategy – the first player or his partner?

Print
My Problem Set reset
No Problems selected
Print Collection