# Thousand monkeys - math puzzle

A very big building in which thousand monkeys are living is lighted by
thousand lamps. Every lamp is connected to a unique on/off switch, which are numbered from 1 to 1000. At some moment, all lamps are switched off. But because it is becoming darker, the monkeys would like to switch on the lights. They will do this in the following way.

Monkey 1 presses all switches that are a multiple of 1.

Monkey 2 presses all switches that are a multiple of 2.

Monkey 3 presses all switches that are a multiple of 3.

Monkey 4 presses all switches that are a multiple of 4.

Etc., etc.

How many lamps are switched on after monkey 1000 pressed his switches? And which lamps are switched on?

Monkey 1 presses all switches that are a multiple of 1.

Monkey 2 presses all switches that are a multiple of 2.

Monkey 3 presses all switches that are a multiple of 3.

Monkey 4 presses all switches that are a multiple of 4.

Etc., etc.

How many lamps are switched on after monkey 1000 pressed his switches? And which lamps are switched on?

# Horse friends - math puzzle

Three horses are standing in a triangular field, which is exactly 100
yards on each side. One horse stands at each corner; and simultaneously
all three set off running. Each horse runs after the horse in the
adjacent corner on his left, thus following a curved course, which
terminates in the middle of the field, all three horses arriving there
together.
The horses obviously ran at the same speed, but just how far did they
run?

# Divisible from 1 to 9 - math puzzle

Find a number consisting of 9 digits in which each of the digits from 1 to 9 appears only once. This number should satisfy the following requirements:

a. The number should be divisible by 9.

b. If the most right digit is removed, the remaining number should be divisible by 8.

c. If then again the most right digit is removed, the remaining number should be divisible by 7.

d. etc. until the last remaining number of one digit which should be divisible by 1.

a. The number should be divisible by 9.

b. If the most right digit is removed, the remaining number should be divisible by 8.

c. If then again the most right digit is removed, the remaining number should be divisible by 7.

d. etc. until the last remaining number of one digit which should be divisible by 1.