Two ants crawled along their own closed route on a \(7\times7\) board. Each ant crawled only on the sides of the cells of the board and visited each of the 64 vertices of the cells exactly once. What is the smallest possible number of cell edges, along which both the first and second ants crawled?
We are given a polynomial \(P(x)\) and numbers \(a_1\), \(a_2\), \(a_3\), \(b_1\), \(b_2\), \(b_3\) such that \(a_1a_2a_3 \ne 0\). It turned out that \(P (a_1x + b_1) + P (a_2x + b_2) = P (a_3x + b_3)\) for any real \(x\). Prove that \(P (x)\) has at least one real root.
Is it possible to draw five lines from one point on a plane so that there are exactly four acute angles among the angles formed by them? Angles between not only neighboring rays, but between any two rays, can be considered.
It is known that a certain polynomial at rational points takes rational values. Prove that all its coefficients are rational.
A country is called a Fiver if, in it, each city is connected by airlines with exactly with five other cities (there are no international flights).
a) Draw a scheme of airlines for a country that is made up of 10 cities.
b) How many airlines are there in a country of 50 cities?
c) Can there be a Fiver country, in which there are exactly 46 airlines?
100 fare evaders want to take a train, consisting of 12 coaches, from the first to the 76th station. They know that at the first station two ticket inspectors will board two coaches. After the 4th station, in the time between each station, one of the ticket inspectors will cross to a neighbouring coach. The ticket inspectors take turns to do this. A fare evader can see a ticket inspector only if the ticket inspector is in the next coach or the next but one coach. At each station each fare evader has time to run along the platform the length of no more than three coaches – for example at a station a fare evader in the 7th coach can run to any coach between the 4th and 10th inclusive and board it. What is the largest number of fare evaders that can travel their entire journey without ever ending up in the same coach as one of the ticket inspectors, no matter how the ticket inspectors choose to move? The fare evaders have no information about the ticket inspectors beyond that which is given here, and they agree their strategy before boarding.
Prove that multiplying the polynomial \((x + 1)^{n-1}\) by any polynomial different from zero, we obtain a polynomial having at least \(n\) nonzero coefficients.
What weights can three weights have so that they can weigh any integer number of kilograms from 1 to 10 on weighing scales (weights can be put on both cups)? Give an example.
Does a continuous function that takes every real value exactly 3 times exist?
Prove that there are infinitely many composite numbers among the numbers \(\lfloor 2^k \sqrt{2}\rfloor\) (\(k = 0, 1, \dots\)).