MathDB

7

Part of 2000 Tournament Of Towns

Problems(1)

TOT 2000 Autumn AJ7 100 cards with integers 1 to 100, +, =

Source:

5/10/2020
A student has 100100 cards on which the integers 11 to 100100 are printed, as well as a sufficiently large number of cards on which the symbols ++ and == are printed. What is the maximal number of correct equalities the student can construct, if each card is used at most once?
(R Zhenodarov)
combinatorics