We solve problems

Problems Geometry Solid geometry Spheres Circle on a sphere Visual geometry in space

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).

Problem #PRU-103825

Problems Algebra and arithmetic Arithmetics. Mental maths Methods Examples and counterexamples. Constructive proofs Set theory and logic Theory of algotithms Theory of algorithms (other)

10–12 2.0

Three hedgehogs divided three pieces of cheese of mass of 5g, 8g and 11g. The fox began to help them. It can cut off and eat 1 gram of cheese from any two pieces at the same time. Can the fox leave the hedgehogs equal pieces of cheese?

Problem #PRU-103843

Problems Combinatorics Dissections, partitions, covers and tilings

12–12 2.0

Cut the figure (on the boundaries of cells) into three equal parts (the same in shape and size).

Problem #PRU-103848

Problems Set theory and logic Mathematical logic Puzzles

12–13 2.0

In the line of numbers and signs \({}* 1 * 2 * 4 * 8 * 16 * 32 * 64 = 27\) position the signs “\(+\)” or “\(-\)” instead of the signs “\(*\)”, so that the equality becomes true.

Problem #PRU-103850

Problems Set theory and logic Mathematical logic Puzzles

12–13 2.0

The code of lock is a two-digit number. Ben forgot the code, but he remembers that the sum of the digits of this number, combined with their product, is equal to the number itself. Write all possible code options so that Ben could open the lock quickly.

Problem #PRU-103858

Problems Algebra and arithmetic Number theory. Divisibility The fundamental theorm of arithmetic. Prime factorisation.

12–13 2.0

Solve the rebus: \(AX \times UX = 2001\).

Problem #PRU-103869

Problems Set theory and logic Order relations Methods Pigeonhole principle Pigeonhole principle (other)

11–13 2.0

Solve the puzzle: \(BAO \times BA \times B = 2002\).

Problem #PRU-103882

Problems Methods Algebraic methods Proof by exhaustion Set theory and logic Mathematical logic Puzzles

11–12 2.0

Find the smallest four-digit number \(CEEM\) for which there exists a solution to the rebus \(MN + PORG = CEEM\). (The same letters correspond to the same numbers, different – different.)

Problem #PRU-103883

Problems Set theory and logic Mathematical logic Mathematical logic (other)

11–12 2.0

A space traveller decided to visit the planet and upon arrival he met three inhabitants. The traveller asked each of the inhabitants: “How many truth tellers are there among your companions?”. The first one answered: “None.” The second one said: “One”. What did the third alien say?

Problem #PRU-103884

Problems Combinatorics Dissections, partitions, covers and tilings Dissections with certain properties Methods Examples and counterexamples. Constructive proofs Algebra and arithmetic Fractions Simple fractions

11–12 2.0

A rectangle is cut into several smaller rectangles, the perimeter of each of which is an integer number of meters. Is it true that the perimeter of the original rectangle is also an integer number of meters?