The edges of a cube are assigned with integer values. For each vertex we look at the numbers corresponding to the three edges coming from this vertex and add them up. In case we get 8 equal results we call such cube “cute”. Are there any “cute” cubes with the following numbers corresponding to the edges:
(a) \(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12\);
(b) \(-6, -5, -4, -3, -2, -1, 1, 2, 3, 4, 5, 6\)?
Propose a method for measuring the diagonal of a conventional brick, which is easily realied in practice (without the Pythagorean theorem).
A globe has 17 parallels and 24 meridians. How many parts is the globe’s surface divided into? The meridian is an arc connecting the North Pole with the South Pole. A parallel is a circle parallel to the equator (the equator is also a parallel).
A square napkin was folded in half, the resulting rectangle was then folded in half again (see the figure). The resulting square was then cut with scissors (in a straight line). Could the napkin have been broken up a) into 2 parts? b) into 3 parts? c) into 4 parts? d) into 5 parts? If yes – illustrate such a cut, if not – write the word “no”.
a) A 1 or a 0 is placed on each vertex of a cube. The sum of the 4 adjacent vertices is written on each face of the cube. Is it possible for each of the numbers written on the faces to be different?
b) The same question, but if 1 and \(-1\) are used instead.
In a burrow there is a family of 24 mice. Every night exactly four of them are sent to the warehouse for cheese.
Could it occur that at some point in time each mouse went to the warehouse with every other mouse exactly one time?
The grasshopper jumps on the interval \([0,1]\). On one jump, he can get from the point \(x\) either to the point \(x/3^{1/2}\), or to the point \(x/3^{1/2} + (1- (1/3^{1/2}))\). On the interval \([0,1]\) the point \(a\) is chosen.
Prove that starting from any point, the grasshopper can be, after a few jumps, at a distance less than \(1/100\) from point \(a\).
All of the sweets of different sorts in stock are arranged in \(n\) boxes, for which prices are set at \(1, 2, \dots , n\), respectively. It is required to buy such \(k\) of these boxes of the least total value, which contain at least \(k/n\) of the mass of all of the sweets. It is known that the mass of sweets in each box does not exceed the mass of sweets in any more expensive box.
a) What boxes should I buy when \(n = 10\) and \(k = 3\)?
b) The same question for arbitrary natural numbers \(n \geq k\).
The surface of a \(3\times 3\times 3\) Rubik’s Cube contains 54 squares. What is the maximum number of squares we can mark, so that no marked squares share a vertex or are directly adjacent to another marked square?
Prove that for all \(x \in (0;\pi /2)\) for \(n > m\), where \(n, m\) are natural, we have the inequality \(2 | \sin^n x-\cos^n x | \leq 3 | \sin^m x-\cos^m x |\);