1. [1] R. P. Brent, An improved Monte-Carlo factorization algorithm, BIT 20 (1980), no. 2, 176-184. 10.1007/BF01933190
2. [2] J. Brillhart, D. H. Lehmer, J. L. Selfridge, B. Tuckerman and S. S. Wagstaff, Jr., Factorizations of bn ± 1. b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers, (2nd ed.), Contemp. Math., vol. 22, Amer. Math. Soc., Providence, RI, 1988. 10.1090/conm/022
3. [3] D. Davis, Computing the number of totally positive circular units which are squares, J. Number Theory, 10 (1978), no. 1, 1-9. 10.1016/0022-314X(78)90002-1
4. [4] S. S. Eddin, An explicit bound for |L(1,χ)| when χ(2) = 1 and χ is even, Int. J. Number Theory, 12 (2016), no. 8, 2299-2315. 10.1142/S1793042116501372
5. [5] A. Fröhlich and M. J. Taylor, Algebraic Number Theory, Cambridge Univ. Press, Cambridge, 1993. 10.1017/CBO9781139172165