Problem #PRU-32787

Problems Number Theory Numeral systems Decimal number system Methods Algebraic methods Partitions into pairs and groups; bijections Pigeonhole principle Pigeonhole principle (other)

Problem

Is it possible to find 57 different two digit numbers, such that no sum of any two of them was equal to 100?