[RC5] Beal's Problem A DN challenge?
Isaac
zarkon at concentric.net
Sat Jul 3 22:53:56 EDT 1999
If you find any case where Beal's conjecture is false, then it is proven
false. At least, that was according to my discrete mathematics professor
when I was in college. I'm not really interested in the problem, but I
think if it's false, then we would be able to find the case.
At 12:03 AM 7/3/99 +0000, you wrote:
>It does indeed look interesting. However, d.net can't prove Beal's
>conjecture true, we can only prove it false by trying lots of different
>numbers. This sort of open-ended problem is, I think, far less likely
>to attract new recruits than something thoroughly useful like OGR.
--
To unsubscribe, send 'unsubscribe rc5' to majordomo at lists.distributed.net
rc5-digest subscribers replace rc5 with rc5-digest
More information about the rc5
mailing list