This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1

1954 Moscow Mathematical Olympiad, 286
Tags: number theory , combinatorics , sum , 10-digit , subset
Consider the set of all $10$-digit numbers expressible with the help of figures $1$ and $2$ only. Divide it into two subsets so that the sum of any two numbers of the same subset is a number which is written with not less than two $3$’s.