by zefuri » Wed Apr 25, 2007 5:40 pm
Prove that for every nonnegative integer [unparseable or potentially dangerous latex formula], the number [unparseable or potentially dangerous latex formula] is the product of at least [unparseable or potentially dangerous latex formula] (not necessarily distinct) primes.