On numbers of the form $n^{4}+1$
HTML articles powered by AMS MathViewer
- by Daniel Shanks PDF
- Math. Comp. 15 (1961), 186-189 Request permission
Corrigendum: Math. Comp. 16 (1962), 513-513.
References
- Daniel Shanks, On the conjecture of Hardy & Littlewood concerning the number of primes of the form $n^{2}+a$, Math. Comp. 14 (1960), 320β332. MR 120203, DOI 10.1090/S0025-5718-1960-0120203-6
- Daniel Shanks, A note on Gaussian twin primes, Math. Comput. 14 (1960), 201β203. MR 0111724, DOI 10.1090/S0025-5718-1960-0111724-0
- A. Gloden, A note on factors of $n^{4}+1$, Math. Comp. 14 (1960), 278β279. MR 121332, DOI 10.1090/S0025-5718-1960-0121332-3 L. E. Dickson, History of the Theory of Numbers, Stechert, New York, 1934, v. 1, p. 381. According to Dickson, Euler (1752) gave ${P_1}(1500) = 161$, which is correct, and ${Q_1}(34) = 8$, which is incorrectβhe omits the prime ${28^4} + 1$.
- Daniel Shanks, A sieve method for factoring numbers of the form $n^{2}+1$, Math. Tables Aids Comput. 13 (1959), 78β86. MR 105784, DOI 10.1090/S0025-5718-1959-0105784-2
Additional Information
- © Copyright 1961 American Mathematical Society
- Journal: Math. Comp. 15 (1961), 186-189
- MSC: Primary 10.00
- DOI: https://doi.org/10.1090/S0025-5718-1961-0120184-6
- MathSciNet review: 0120184