| Publication | Date of Publication | Type |
|---|
Prime numbers and computer methods for factorization
Modern Birkhäuser Classics | 2011-09-19 | Paper |
Table errata 2 to ``Factors of generalized Fermat numbers
Mathematics of Computation | 2011-07-08 | Paper |
Factors of generalized Fermat numbers
Mathematics of Computation | 1997-12-16 | Paper |
Summation of double series using the Euler-Maclaurin sum formula
BIT | 1997-03-11 | Paper |
Prime numbers and computer methods for factorization.
Progress in Mathematics | 1995-09-07 | Paper |
| scientific article; zbMATH DE number 733572 (Why is no real title available?) | 1995-05-29 | Paper |
| scientific article; zbMATH DE number 38184 (Why is no real title available?) | 1992-06-28 | Paper |
Some soluble cases of the discrete logarithm problem
BIT | 1988-01-01 | Paper |
Errata: On the metric theory of nearest integer continued fractions
BIT | 1988-01-01 | Paper |
On admissible constellations of consecutive primes
BIT | 1988-01-01 | Paper |
On the metric theory of nearest integer continued fractions
BIT | 1987-01-01 | Paper |
Prime numbers and computer methods for factorization
Progress in Mathematics | 1985-01-01 | Paper |
Modern factorization methods
BIT | 1985-01-01 | Paper |
On sums of primes
Arkiv för Matematik | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3739644 (Why is no real title available?) | 1982-01-01 | Paper |
Partitions in squares
BIT | 1979-01-01 | Paper |
An "exact" formula for the 2n-th Bernoulli number
Acta Arithmetica | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3492747 (Why is no real title available?) | 1975-01-01 | Paper |
A randomly generated program for automatic identity checking
BIT | 1975-01-01 | Paper |
A consequence of the von Staudt-Clausen theorem
BIT | 1974-01-01 | Paper |
Some series related to infinite series given by Ramanujan
BIT | 1973-01-01 | Paper |
Some Calculations Related to Riemann's Prime Number Formula
Mathematics of Computation | 1970-01-01 | Paper |
Primes forming arithmetic series and clusters of large primes
BIT | 1970-01-01 | Paper |
Lucasian Criteria for the Primality of = h ⋅2 n - 1
Mathematics of Computation | 1969-01-01 | Paper |
Common prime factors of the numbers $$A_n = a^{2^n } + 1$$
BIT | 1969-01-01 | Paper |
Some Factors of the Numbers G n = 6 2 n + 1 and H n = 10 2 n + 1
Mathematics of Computation | 1969-01-01 | Paper |
| scientific article; zbMATH DE number 3448644 (Why is no real title available?) | 1968-01-01 | Paper |
A continued fraction algorithm
BIT | 1967-01-01 | Paper |
Note on the Congruence a p-1 ≡1 (mod p 2 )
Mathematics of Computation | 1964-01-01 | Paper |
In which order are different conditions to be examined?
BIT | 1963-01-01 | Paper |
A Factor of the Fermat Number F 19
Mathematics of Computation | 1963-01-01 | Paper |
| scientific article; zbMATH DE number 3182276 (Why is no real title available?) | 1963-01-01 | Paper |
All Factors q < 10 8 in All Mersenne Numbers 2 p - 1, p Prime < 10 4
Mathematics of Computation | 1962-01-01 | Paper |
On a property of the minimal universal exponent, \(\lambda(x)\)
Arkiv för Matematik | 1962-01-01 | Paper |
A case of numerical divergence
BIT | 1961-01-01 | Paper |
| scientific article; zbMATH DE number 3189439 (Why is no real title available?) | 1961-01-01 | Paper |
| scientific article; zbMATH DE number 3202185 (Why is no real title available?) | 1960-01-01 | Paper |
| scientific article; zbMATH DE number 3182333 (Why is no real title available?) | 1960-01-01 | Paper |
Mersenne Numbers
Mathematical Tables and Other Aids to Computation | 1958-01-01 | Paper |
Mersenne Numbers
Mathematical Tables and Other Aids to Computation | 1958-01-01 | Paper |
A note on the prime numbers of the forms \(N =(6a+1) 2^{2n-1}-1\) and \(M = (6a-1) 2^{2n}-1\)
Arkiv för Matematik | 1956-01-01 | Paper |
| scientific article; zbMATH DE number 3119601 (Why is no real title available?) | 1956-01-01 | Paper |
| scientific article; zbMATH DE number 3056948 (Why is no real title available?) | 1948-01-01 | Paper |
