Problems

Let \(n\) be an integer such that \(n^2\) is divisible by \(2\). Prove that \(n\) is divisible by \(2\).

Let \(n\) be an integer. Prove that if \(n^3\) is divisible by \(3\), then \(n\) is divisible by \(3\).

The numbers \(x\) and \(y\) satisfy \(x+3 = y+5\). Prove that \(x>y\).

The numbers \(x\) and \(y\) satisfy \(x+7 \geq y+8\). Prove that \(x>y\).

Can three points with integer coordinates be the vertices of an equilateral triangle?

Prove that there are infinitely many natural numbers \(\{1,2,3,4,...\}\).

Prove that there are infinitely many prime numbers \(\{2,3,5,7,11,13...\}\).

Is it possible to colour the cells of a \(3\times 3\) board red and yellow such that there are the same number of red cells and yellow cells?

Prove the divisibility rule for \(25\): a number is divisible by \(25\) if and only if the number made by the last two digits of the original number is divisible by \(25\);
Can you come up with a divisibility rule for \(125\)?

A group of \(15\) elves decided to pay a visit to their relatives in a distant village. They have a horse carriage that fits only \(5\) elves. In how many ways can they assemble the ambassador team, if at least one person in the team needs to be able to operate the carriage, and only \(5\) elves in the group can do that?