Problem #PRU-32787

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

Problem

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