- Jul 6, 2004

- 4,860

- 1

- 81

For those wondering:

This is true for ANY set of 90 25-digit numbers by the Pigeonhole principle--there are 2^90 (around 1.something * 10^27) possible subsets and less than 90*10^25 values (.9 * 10^27).

Here's the list of the numbers:

http://theory.lcs.mit.edu/clas...2/fall04/counting1.pdf

Anyone have any good ideas of going about it? Brute forcing is not an option as storing 10^27 values is not possible