2 ms·
Proving that would be quite hard ;)
by speeder 14y ago
Proving that would be quite hard ;)
- mkl 14y agoNot necessarily - proving there are infinite primes is easy. It could be hard or impossible, or it could be easy or moderately hard but either way no one's figured it out yet. (And yes it's sometimes possible to prove that something can't be proved.)
- gejjaxxita 14y ago1. It's a major unsolved problem in mathematics - definitely not "easy"! 2. In this case it hasn't been proved that it can't be proved.