We solve problems

Problems Discrete Mathematics Set theory and logic Mathematical logic Puzzles

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 Discrete Mathematics 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 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 Discrete Mathematics 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-103873

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

11–12 3.0

Jessica, Nicole and Alex received 6 coins between them: 3 gold coins and 3 silver coins. Each of them received 2 coins. Jessica doesn’t know which coins the others received but only which coins she has. Think of a question which Jessica can answer with either “yes”, “no” or “I don’t know” such that from the answer you can know which coins Jessica has.

Problem #PRU-103882

Problems Methods Algebraic methods Proof by exhaustion Discrete Mathematics 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 Discrete Mathematics 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 Discrete Mathematics Combinatorics Dissections, partitions, covers and tilings Dissections with certain properties Methods Examples and counterexamples. Constructive proofs Algebra 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?

Problem #PRU-103885

Problems Discrete Mathematics Combinatorics Dissections, partitions, covers and tilings Tilings with ordinary and domino tiles

11–12 2.0

At the disposal of a tile layer there are 10 identical tiles, each of which consists of 4 squares and has the shape of the letter L (all tiles are oriented the same way). Can he make a rectangle with a size of \(5 \times 8\)? (The tiles can be rotated, but you cannot turn them over). For example, the figure shows the wrong solution: the shaded tile is incorrectly oriented.

Problem #PRU-103887

Problems Discrete Mathematics Set theory and logic Mathematical logic Puzzles Algebra Fractions Simple fractions

12–12 2.0

Arrange brackets and arithmetic signs around these numbers so that the correct equality is obtained: \[\frac{1}{2}\quad \frac{1}{6}\quad \frac{1}{6009} \ = \ 2003.\]