Abstract. Let / = 2 or 3 and let D be a positive /-power-free integer. Also, let R be the product of all the rational primes which completely ramify in K = S(Z) '/'). The integer d is a principal factor of the discriminant of K if d = N(a), where a is an algebraic integer of K and d | R'~l. In this paper algorithms for finding these principal factors are described. Special attention is given to the case of / = 3, where it is shown that Voronoi's continued fraction algorithm can be used to find principal factors. Some results of a computer search for principal factors for all S(Vz> ) with 2 < D < 15000 are also presented.