Can you find
a) in the 100th line of Pascal’s triangle, the number \(1 + 2 + 3 + \dots + 98 + 99\)?
b) in the 200th line the sum of the squares of the numbers in the 100th line?
A road of length 1 km is lit with streetlights. Each streetlight illuminates a stretch of road of length 1 m. What is the maximum number of streetlights that there could be along the road, if it is known that when any single streetlight is extinguished the street will no longer be fully illuminated?
15 MPs take part in a debate. During the debate, each one criticises exactly \(k\) of the 14 other contributors. For what minimum value of \(k\) is it possible to definitively state that there will be two MPs who have criticised one another?
On an infinitely long strip of paper, we write an endless row of digits.
We start by writing \(1,2,3,4\). After that, each new digit is chosen like this: add the previous four digits and write down only the last digit of that sum.
So the beginning looks like \(1234096\dots\).
Will the four digits \(8123\) ever appear next to each other somewhere in this endless row?
During the election for the government of the planet of Liars and
Truth-Tellers, \(12\) candidates each
gave a short speech about themselves.
After everyone had spoken, one alien said: “So far, only one lie has
been told today.”
Then another said: “And now two have been said so far.”
The third said: “And now three lies have been told so far,” and so on —
until the twelfth alien said: “And now twelve lies have been told so
far.”
It turned out that at least one candidate had correctly counted how many
lies had been told before their own statement.
How many lies were said that day in total?
There are 30 ministers in a parliament. Each two of them are either friends or enemies, and each is friends with exactly six others. Every three ministers form a committee. Find the total number of committees in which all three members are friends or all three are enemies.
Two people play the following game. Each player in turn rubs out 9 numbers (at his choice) from the sequence \(1, 2, \dots , 100, 101\). After eleven such deletions, 2 numbers will remain. The first player is awarded so many points, as is the difference between these remaining numbers. Prove that the first player can always score at least 55 points, no matter how played the second.
A six-digit phone number is given. How many seven-digit numbers are there from which one can obtain this six-digit number by deleting one digit?
7 natural numbers are written around the edges of a circle. It is known that in each pair of adjacent numbers one is divisible by the other. Prove that there will be another pair of numbers that are not adjacent that share this property.
On a function \(f (x)\), defined on the entire real line, it is known that for any \(a>1\) the function \(f (x) + f (ax)\) is continuous on the whole line. Prove that \(f (x)\) is also continuous on the whole line.