MOC
2002
13 years 4 months ago
2002
Erdos conjectured that there are x1-o(1) Carmichael numbers up to x, whereas Shanks was skeptical as to whether one might even find an x up to which there are more than x Carmicha...
MOC
2000
13 years 4 months ago
2000
Abstract. I describe a modification to Shanks' baby-step giant-step algorithm for computing the order n of an element g of a group G, assuming n is finite. My method has the a...