What is the entropic efficiency of our calculations? Is it possible to say how much "work" must be performed in order to verify whether a number is prime? If it is, then how efficient are our methods in comparison? For instance, can it be shown that there is theoretically a better method, but one that no-one has discovered? -- ======= Gareth Randall ======= _________________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
