There are ten islands in the Fantasia Archipelago. There used to be cruises connecting each island to each other island, each cruise served by a different ship. One day eight of those ships were taken over by pirates and do not serve cruises any more. Show that despite the efforts of pirates, it is still possible to get from each island to every other island, possibly changing ships on the way.
In Rabbitland you can get from any city to any other city. Bugs Bunny decided to find out what is the largest number of cities he can visit, while never visiting any city twice. He can start from any city and finish at any other. He realised that there are two longest paths he can take and they both involve the same number of cities. Show that those two paths have at least one city in common.
There are \(n\) people at a royal ball. Every time three of them meet and talk, it turns out some two of them didn’t know each other before. Show that the maximum number of connections between the guests is \(\frac14 n^2\). If any guest \(A\) knows guest \(B\), then \(B\) knows \(A\), and this counts as one connection.
An animal with \(n\) cells is a connected figure consisting of \(n\) equal-sized adjacent square cells. A dinosaur is an animal with at least 2007 cells. It is said to be primitive if its cells cannot be partitioned into two or more dinosaurs. Find with proof the maximum number of cells in a primitive dinosaur.
Remainder is the number that is “left over" from division. Even if a number is not divisible by another number fully, we can still divide, but leaving a remainder. The remainder is less than the number we’re dividing by. For example, a remainder of \(44\) in division by \(7\) is \(2\), because \(44 = 6 \times 7 + 2\). More generally, we can write \(n=qk+r\), where \(0\leq r<k\). We say that \(k\) goes into \(n\) \(q\) times, and a little bit (\(r\)) is left. If that little bit was larger than \(k\), it could “go into" \(n\) once more.
The general rule is that a remainder of a sum, difference or a product of two remainders is equal to the remainder of a sum, difference or a product of the original numbers. What that means is if we want to find a remainder of a product of two numbers, we need to look at the individual remainders, multiply them, and then take a remainder.
For example, \(10\) has remainder \(3\) when dividing by \(7\) and \(11\) has remainder \(4\) when dividing by \(7\). The product \(10\times11=110\) will have the same remainder as the product of the individual remainders. We first multiply \(3\times4=12\) and then take a remainder upon division by \(7\), which is \(5\) because \(12=7+5\). That means that \(110\) gives a remainder \(5\) in division by \(7\) - and it does, because \(110=15\times7+5\). If a number is divisible by a number we are dividing it, nothing remains and we say the remainder is \(0\).
Let’s have a look on some examples:
What time is it going to be in \(2025\) hours from now?
Prove that the product of five consecutive integers is divisible by \(30\).
Prove that if \(n\) is a composite number, then \(n\) is divisible by some natural number \(x\) such that \(1 < x\leq \sqrt{n}\).
The natural numbers \(a,b,c,d\) are such that \(ab=cd\). Prove that the number \(a^{2025} + b^{2025} + c^{2025} + d^{2025}\) is composite.
Prove that for an arbitrary odd \(n = 2m - 1\) the sum \(S = 1^n + 2^n + ... + n^n\) is divisible by \(1 + 2 + ... + n = nm\).