|
REFERENCES
|
Baillie, R., Cormack, G., Williams, H. C.; The Problem of Sierpinski Concerning k 2^n+1, Mathematics of Computation, Vol. 37, No. 155. (July 1981), pp. 229-231. Corrigenda; Mathematics of Computation, Vol. 39, No. 159. (July 1982), p. 308.
Keller, Wilfred; Factors of Fermat Numbers and Large Primes of the Form, Mathematics of Computation, Vol. 41, No. 164. (October 1983), pp. 661-673.
Sierpinski, W.; Sur un probleme concernant les nombres k 2^n+1, Elem. d. Math. 15, pp. 73-74, 1960.
|