We solve problems

Problem #PRU-102964

Problems Set theory and logic Theory of algotithms Game theory Game theory (other) Algebra and arithmetic Number theory. Divisibility Odd and even numbers

10–12 2.0

Petya and Misha play such a game. Petya takes in each hand a coin: one – 10 pence, and the other – 15. After that, the contents of the left hand are multiplied by 4, 10, 12 or 26, and the contents of the right hand – by 7, 13, 21 or 35. Then Petya adds the two results and tells Misha the result. Can Misha, knowing this result, determine which hand – the right or left – contains the 10 pence coin?

Problem #PRU-102998

Problems Algebra and arithmetic Number theory. Divisibility Divisibility of a number. General properties Set theory and logic Joke problem

10–12 2.0

Can the equality \(K \times O \times T = U \times W \times E \times N \times H \times Y\) be true if the numbers from 1 to 9 are substituted for the letters? Different letters correspond to different numbers.

Problem #PRU-103729

Problems Algebra and arithmetic Number theory. Divisibility Odd and even numbers

10–12 2.0

The parliament of a certain country has two houses with an equal number of members. In order to make a decision on an important issue all the members voted and there were no abstentions. When the chairman announced that the decision had been taken with a 23-vote advantage, the opposition leader declared that the results had been rigged. How did he know it?

Problem #PRU-103802

Problems Algebra and arithmetic 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-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-103964

Problems Algebra and arithmetic Number theory. Divisibility Division with remainders. Arithmetic of remainders Arithmetic of remainders Methods Pigeonhole principle Pigeonhole principle (other)

12–14 3.0

There are \(n\) integers. Prove that among them either there are several numbers whose sum is divisible by \(n\) or there is one number divisible by \(n\) itself.

Problem #PRU-104021

Problems Geometry Solid geometry Parallelepipeds Special cases of parallelepipeds Cube Algebra and arithmetic Number theory. Divisibility Odd and even numbers Methods Pigeonhole principle Pigeonhole principle (other)

12–13 2.0

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.

Problem #PRU-107845

Problems Algebra and arithmetic Number theory. Divisibility Equations in integer numbers

11–14 3.0

Is it possible to find natural numbers \(x\), \(y\) and \(z\) which satisfy the equation \(28x+30y+31z=365\)?

Problem #PRU-109423

Problems Set theory and logic Mathematical logic Puzzles Algebra and arithmetic Number theory. Divisibility The fundamental theorm of arithmetic. Prime factorisation.

11–12 2.0

At the end of the term, Billy wrote out his current singing marks in a row and put a multiplication sign between some of them. The product of the resulting numbers turned out to be equal to 2007. What is Billy’s term mark for singing? (The marks that he can get are between 2 and 5, where 5 is the highest mark).

Problem #PRU-109603

Problems Algebra and arithmetic Number theory. Divisibility Divisibility of a number. General properties Methods Examples and counterexamples. Constructive proofs Calculus Number sequences Number sequences (other)

14–16 5.0

Is there a sequence of natural numbers in which every natural number occurs exactly once, and for any \(k = 1, 2, 3, \dots\) the sum of the first \(k\) terms of the sequence is divisible by \(k\)?