Search found 2 matches
- Fri Jan 10, 2020 11:52 am
- Forum: National Math Olympiad (BdMO)
- Topic: National Junior Problem 7
- Replies: 1
- Views: 1612
National Junior Problem 7
A chess rook can only travel horizontally or vertically, but not diagonally. We color the bottom of a chess rook red. So, when it makes a move it paints all the squares it travels over red. Prove that, a rook will need at least 2n − 1 moves to every square of an n × n chess board red. how to prove i...
- Fri Jan 10, 2020 11:50 am
- Forum: National Math Olympiad (BdMO)
- Topic: National Junior Problem 9
- Replies: 0
- Views: 5772
National Junior Problem 9
In the cartesian coordinate system, four points (0; 0); (20; 0); (20; 19) and (0; 19) are used as vertices to draw a rectangle. At first, a ball with negligible size is at the (0; 0) point. It then started to move towards the point (2; 1). Every second, the ball passes the amount of distance between...