Homework:
- Each next line is obtained from the previous one using a simple rule. Find it! Add 2-3 more lines using that rule:
1
1 1
2 1
1 2 1 1
1 1 1 2 2 1
3 1 2 2 1 1
.....
- Out of 1000 numbers, starting with 0 and ending with 999, how many do not have digit 3 in them?
- Find midpoints of the intervals:
- Could chess knight jump over all squares of the $5\times 5$ board, visiting each just once?
Answer - Yes!
- Could it do so and return to its starting point?
Answer - No!
- A standard die is rolled to the right, towards you, to the left, away from you, returning to the original site; each time around an edge, without sliding.
What will be the number on the top?
How many times one will need to repeat this operation to return to the original orientation?
- How many different routes are there from A to F (moving always eastwards)?
