Distribution of generalized Fermat prime numbers

Numbers of the form are called Generalized Fermat Numbers (GFN). A computational method for testing the probable primality of a GFN is described which is as fast as testing a number of the form . The theoretical distributions of GFN primes, for fixed , are derived and compared to the actual distributions. The predictions are surprisingly accurate and can be used to support Bateman and Horn's quantitative form of ``Hypothesis H" of Schinzel and Sierpinski. A list of the current largest known GFN primes is included.

     

Repunit R49081 is a probable prime

The Repunit R is a probable prime. In order to prove primality R49080 must be approximately 33.3% factored. The status of this factorization is included.

     

The number of primes is finite

For a positive integer let and let . The number of primes of the form is finite, because if , then is divisible by . The heuristic argument is given by which there exists a prime such that for all large ; a computer check however shows that this prime has to be greater than . The conjecture that the numbers are squarefree is not true because .

     

Explicit primality criteria for

Deterministic polynomial time primality criteria for have been known since the work of Lucas in 1876-1878. Little is known, however, about the existence of deterministic polynomial time primality tests for numbers of the more general form , where is any fixed prime. When (p-1)/2$"> we show that it is always possible to produce a Lucas-like deterministic test for the primality of which requires that only modular multiplications be performed modulo , as long as we can find a prime of the form such that is not divisible by . We also show that for all with such a can be found very readily, and that the most difficult case in which to find a appears, somewhat surprisingly, to be that for . Some explanation is provided as to why this case is so difficult.

     

搜寻广义Fermat素数

设ｂ为偶数，本文讨论了广义Ｆｅｒｍａｔ数Ｆ（ｂ，ｍ）＝ｂ＾２＋１为素数的必要条件和充分条件，提出了搜寻广义Ｆｅｒｍａｔ素数的一种效率很高的算法并在微机上实现，得出了ｂ≤２５６，ｍ≤１０的全部广义Ｆａｒｍａｔ素数，其中最大的是４６＾２１２＋１。     

On the effectiveness of a generalization of Miller’s primality theorem

Berrizbeitia and Olivieri showed in a recent paper that, for any integer r$r$, the notion of ω$\omega$-prime to base a$a$ leads to a primality test for numbers n≡1$n\equiv 1$ mod r$r$, that under the Extended Riemann Hypothesis (ERH) runs in polynomial time. They showed that the complexity of their test is at most the complexity of the Miller primality test (MPT), which is O((logn)^4+o(1))$O\left({(logn)}^{4+o\left(1\right)}\right)$. They conjectured that their test is more effective than the MPT if r$r$ is large.     

b≤2000,m≤10的广义Fermat素数

设b为偶数，本文基于作者的原有结果，进一步改进了算法，对于b≤2000,m≤10给出了所有广义Fermat素数F(b,m)=b^2m 1，其中最大的是1632^1024 1,有3290位。     

Checking the odd Goldbach conjecture up to

Vinogradov's theorem states that any sufficiently large odd integer is the sum of three prime numbers. This theorem allows us to suppose the conjecture that this is true for all odd integers. In this paper, we describe the implementation of an algorithm which allowed us to check this conjecture up to .

     

Deterministic primality test for numbers of the form odd

We use a result of E. Lehmer in cubic residuacity to find an algorithm to determine primality of numbers of the form , odd, . The algorithm represents an improvement over the more general algorithm that determines primality of numbers of the form , , presented by Berrizbeitia and Berry (1999).

     

Primes of the form in short intervals

In this note, we prove that for every and , the short interval contains at least one prime number of the form with . This improves a similar result due to Huxley and Iwaniec, which requires .

     

The

ROSSER and SCHOENFELD have used the fact that the first 3,500,000 zeros of the RIEMANN zeta function lie on the critical line to give estimates on and . With an improvement of the above result by BRENTet al., we are able to improve these estimates and to show that the prime is greater than for . We give further results without proof.

     

On the number of partitions into primes

There is, apparently, a persistent belief that in the current state of knowledge it is not possible to obtain an asymptotic formula for the number of partitions of a number n into primes when n is large. In this paper such a formula is obtained. Since the distribution of primes can only be described accurately by the use of the logarithmic integral and a sum over zeros of the Riemann zeta-function one cannot expect the main term to involve only elementary functions. However the formula obtained, when n is replaced by a real variable, is in and is readily seen to be monotonic. Research supported by NSA grant, no. MDA904-03-1-0082.     

Finding prime pairs with particular gaps

By a prime gap of size , we mean that there are primes and such that the numbers between and are all composite. It is widely believed that infinitely many prime gaps of size exist for all even integers . However, it had not previously been known whether a prime gap of size existed. The objective of this article was to be the first to find a prime gap of size , by using a systematic method that would also apply to finding prime gaps of any size. By this method, we find prime gaps for all even integers from to , and some beyond. What we find are not necessarily the first occurrences of these gaps, but, being examples, they give an upper bound on the first such occurrences. The prime gaps of size listed in this article were first announced on the Number Theory Listing to the World Wide Web on Tuesday, April 8, 1997. Since then, others, including Sol Weintraub and A.O.L. Atkin, have found prime gaps of size with smaller integers, using more ad hoc methods. At the end of the article, related computations to find prime triples of the form , , and their application to divisibility of binomial coefficients by a square will also be discussed.

     

New Fibonacci and Lucas primes

Extending previous searches for prime Fibonacci and Lucas numbers, all probable prime Fibonacci numbers have been determined for and all probable prime Lucas numbers have been determined for . A rigorous proof of primality is given for and for numbers with , , , , , , , , the prime having 3020 digits. Primitive parts and of composite numbers and have also been tested for probable primality. Actual primality has been established for many of them, including 22 with more than 1000 digits. In a Supplement to the paper, factorizations of numbers and are given for as far as they have been completed, adding information to existing factor tables covering .

     

Polynomial factorization over

We describe algorithms for polynomial factorization over the binary field , and their implementation. They allow polynomials of degree up to to be factored in about one day of CPU time, distributing the work on two processors.

     

On contractible

We present a very short proof of a well-known result, that for each there exists a contractible -dimensional compactum, non-embeddable into .

     

On simple double zeros and badly conditioned zeros of analytic functions of variables

We give a numerical criterion for a badly conditioned zero of a system of analytic equations to be part of a cluster of two zeros.

     

On the structure of

We show that for with its geometrically induced structure maps is not an Hopf algebroid because neither the augmentation nor the coproduct are multiplicative. As a consequence the algebra structure of is slightly different from what was supposed to be the case. We give formulas for and and show that the inversion of the formal group of is induced by an antimultiplicative involution . Some consequences for multiplicative and antimultiplicative automorphisms of for are also discussed.

     

On the Diophantine equation

Let be an odd prime. In this paper, using some theorems of Adachi and the author, we prove that if and , then the equation , and the equation , have no integral solutions respectively. Here is th Bernoulli number.

     

On the diophantine equation

In this note, we find all positive integer solutions of the diophantine equation from the title with a prime power.