References: [ Home | Author index | Key index | Search ]

All items with keys beginning with the letter(s): d

DD85

H. Dubner and R. Dubner, "The development of a powerful, low-cost computer for number theory applications," J. Recreational Math., 18:2 (1985-86) 81--86. [Describes their Dubner Cruncher--a coprocessor for use in IBM compatibles and announces a few of their record (for that date) primes such as 1477!+1.]

Dear1988

P. Dear, Mersenne and the learning of the schools, Cornell University Press, Ithaca New York, 1988.

Deleglise98

M. Deléglise, "Bounds for the density of abundant integers," Experimental Math., 7:2 (1998) 137--143.  MR 2000a:11137 (Abstract available)

DERZ97

J. M. Deshouillers, G. Effinger, H. te Riele and D. Zinoviev, "A complete Vinogradov 3-primes theorem under the Riemann hypothesis," ERA Amer. Math. Soc., 3 (1997) 94--104.  MR 98g:11112 (Abstract available)

DF1979

P. Diaconis and D. Freedman, "On rounding percentages," J. Amer. Stat. Assoc., 74 (1979) 359--364.  MR 81d:62014

DF2000

H. Dubner and T. Forbes, "Prime Pythagorean triangles," (March 2000) Complete text: PDF. (Abstract available)

DFLMNZ1998

H. Dubner, T. Forbes, N. Lygeros, M. Mizony, H. Nelson and P. Zimmermann, "Ten consecutive primes in arithmetic progression," Math. Comp., 71:239 (2002) 1323--1328 (electronic).  MR 1 898 760 (Abstract available)

DG2000

H. Dubner and Y. Gallot, "Distribution of generalized Fermat prime numbers," Math. Comp., 71 (2002) 825--832.  MR 2002j:11156 (Abstract available)

Dickson04

L. E. Dickson, "A new extention of Dirichlet's theorem on prime numbers," Messenger Math., 33 (1904) 155--161.

Dickson19

L. E. Dickson, History of the theory of numbers, Carnegie Institute of Washington, 1919.  Reprinted by Chelsea Publishing, New York, 1971.

DK1999

H. Dubner and W. Keller, "New Fibonacci and Lucas primes," Math. Comp., 68 (1999) 417--427.  MR 99c:11008 [A supplement gives the complete factorization of F_n and L_n for n>1000 whenever it is known.]

DK95

H. Dubner and W. Keller, "Factors of generalized Fermat numbers," Math. Comp., 64 (1995) 397--405.  MR 95c:11010

DK99

H. Dubner and W. Keller, "New Fibonacci and Lucas primes," Math. Comp., 68:225 (1999) 417--427, S1--S12.  MR 99c:11008 [Probable primality of F, L, F* and L* tested for n up to 50000, 50000, 20000, and 15000, respectively. Many new primes and algebraic factorizations found.]

DLP1993

I. Damgård, P. Landrock and C. Pomerance, "Average case error estimates for the strong probable prime test," Math. Comp., 61:203 (1993) 177--194.  MR 94b:11124

DLS1983

Dobrowolski, E., Lawton, W. and Schinzel, A., On a problem of Lehmer.  In "Studies in pure mathematics," Birkhäuser Boston, 1983.  Basel, pp. 135--144, MR 87e:11120

DN97

H. Dubner and H. Nelson, "Seven consecutive primes in arithmetic progression," Math. Comp., 66 (1997) 1743--1749.  MR 98a:11122 (Abstract available)

DO94

H. Dubner and R. Ondrejka, "A PRIMEr on palindromes," J. Recreational Math., 26:4 (1994) 256--267.

DR96

M. Deléglise and J. Rivat, "Computing π(x): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method," Math. Comp., 65:213 (1996) 235--245.  MR 96d:11139

DR98

M. Deléglise and J. Rivat, "Computing ψ(x)," Math. Comp., 67:224 (1998) 1691--1696.  MR 99a:11147 (Abstract available)

DRS98

J. M. Deshouillers, H. J. J. te Riele and Y. Saouter, New experimental results concerning the Goldbach conjecture.  In "Proc. 3rd Int. Symp. on Algorithmic Number Theory," Lecture Notes in Computer Science Vol, 1423, 1998.  pp. 204--215, MR 2000j:11143

Dubner2002

Dubner, Harvey, "Repunit R₄₉₀₈₁ is a probable prime," Math. Comp., 71:238 (2002) 833--835 (electronic).  (http://dx.doi.org/10.1090/S0025-5718-01-01319-9) MR 1885632 (Abstract available)

Dubner85

H. Dubner, "The development of a powerful low-cost computer for number theory applications," J. Recreational Math., 18 (1985-86) 81--86.

Dubner86

H. Dubner, "Generalized Fermat primes," J. Recreational Math., 18 (1985-86) 279--280.  MR 2002j:11156

Dubner87

H. Dubner, "Factorial and primorial primes," J. Recreational Math., 19:3 (1987) 197--203.

Dubner89a

H. Dubner, "A new primorial prime," J. Recreational Math., 21:4 (1989) 276.

Dubner89b

H. Dubner, "A new method for producing large Carmichael numbers," Math. Comp., 53 (1989) 411--414.  MR 89m:11013

Dubner93

H. Dubner, "Generalized repunit primes," Math. Comp., 61 (1993) 927--930.  MR 94a:11009

Dubner96

H. Dubner, "Large Sophie Germain primes," Math. Comp., 65:213 (1996) 393--396.  MR 96d:11008 (Abstract available)

Dudley69

U. Dudley, "History of a formula for primes," Amer. Math. Monthly, 76 (1969) 23--28.  MR 38:4270 (Annotation available)

Durst1959

Durst, L. K., "Exceptional real Lehmer sequences," Pacific J. Math., 9 (1959) 437--441.  MR 21:7181

Dusart2002

Dusart, Pierre, "Sur la conjecture π(x+y)≤π(x)+π(y)," Acta Arith., 102:4 (2002) 295--308.  (http://dx.doi.org/10.4064/aa102-4-1) MR 1889398

Dusart99

P. Dusart, "The k^th prime is greater than k(ln k+ln ln k-1) for k> 2," Math. Comp., 68:225 (January 1999) 411--415.  MR 99d:11133 (Abstract available)