We solve problems

A pedestrian walked along six streets of one city, passing each street exactly twice, but could not get around them, having passed each one only once. Could this be?

Problem #PRU-103784

Problems Set theory and logic Mathematical logic Puzzles

11–11 2.0

When Harvey was asked to come up with a problem for the mathematical Olympiad in Sunny City, he wrote a rebus (see the drawing). Can it be solved? (Different letters must match different numbers).

Problem #PRU-103787

Problems Methods Algebraic methods Counting in two ways Extremal principle Extremal principle (other) Pigeonhole principle Pigeonhole principle (other)

12–14 3.0

One term a school ran 20 sessions of an after-school Astronomy Club. Exactly five pupils attended each session and no two students encountered one another over all of the sessions more than once. Prove that no fewer than 20 pupils attended the Astronomy Club at some point during the term.

Problem #PRU-103791

Problems Algebra Number systems Decimal number system Set theory and logic Mathematical logic Puzzles

12–12 3.0

In the rebus below, replace the letters with numbers such that the same numbers are represented with the same letter. The asterisks can be replaced with any numbers such that the equations hold.

An explanation of the notation used: the unknown numbers in the third and fourth rows are the results of multiplying 1995 by each digit of the number in the second row, respectively. These third and fourth rows are added together to get the total result of the multiplication \(1995 \times ***\), which is the number in the fifth row. This is an example of a “long multiplication table”.

Problem #PRU-103800

Problems Set theory and logic Joke Problems

10–12 2.0

In two purses lie two coins, and one purse has twice as many coins as the other. How can this be?

Problem #PRU-103802

Problems Algebra Number systems Decimal number system Number theory. Divisibility Divisibility of a number. General properties Set theory and logic Set theory Set cardinality. One-to-one correspondence

12–13 2.0

Which five-digit numbers are there more of: ones that are not divisible by 5 or those with neither the first nor the second digit on the left being a five?

Problem #PRU-103803

Problems Set theory and logic Algorithm Theory Algorithm Theory

10–12 2.0

Three people A, B, C counted a bunch of balls of four colors (see table).

Each of them correctly distinguished some two colors, and confused the numbers of the other two colours: one mixed up the red and orange, another – orange and yellow, and the third – yellow and green. The results of their calculations are given in the table.

How many balls of each colour actually were there?

Problem #PRU-103812

Problems Algebra Arithmetic operations. Number identities Set theory and logic Mathematical logic Puzzles

11–11 2.0

Alex laid out an example of an addition of numbers from cards with numbers on them and then swapped two cards. As you can see, the equality has been violated. Which cards did Alex rearrange?

Problem #PRU-103815

Problems Combinatorics Dissections, partitions, covers and tilings Dissections with certain properties Algebra Word Problems Tables and tournaments Tables and tournaments (other)

11–11 2.0

Cut the board shown in the figure into four congruent parts so that each of them contains three shaded cells. Where the shaded cells are placed in each part need not be the same.

Problem #PRU-103817

Problems Set theory and logic Algorithm Theory Algorithm Theory

10–12 2.0

A family went to the bridge at night. The dad can cross over it in 1 minute, the mom can cross it in 2, the child takes 5 minutes, and grandmother in 10 minutes. They have one flashlight. The bridge can only withstands two people at a time. How can they all cross the bridge in 17 minutes? (If two people pass, then they go at the lower of their speeds.) You can not move along a bridge without a flashlight. You can not shine it from a distance.