Table errata 2 to "Factors of generalized Fermat numbers"

نویسندگان

  • Anders Björn
  • Hans Riesel
چکیده

We note that three factors are missing from Table 1 in Factors of generalized Fermat numbers by A. Björn and H. Riesel published in Math. Comp. 67 (1998), 441–446. In Table 1 in Björn–Riesel [2] there are unfortunately three factors missing. Fougeron [3] discovered that 31246291 · 2 + 1 ∣ ∣ 11 51 + 1 and 33797295 · 2 + 1 ∣ ∣ 10 62 + 3 62 . He also verified that no other factors are missing for 30 ≤ n ≤ 703, given the search ranges mentioned in [2]. M. Schroeder [4] and later N. S. de Araújo Melo [1] discovered that 3 · 2 +1 is a prime. This number is missing in the list of primes given in Young [5], a list which had kindly been made available to us when we wrote [2] and which we used without checking. This number is therefore also missing in Table 1 in [2]. The number 3 · 2 + 1 is a factor in 3 54787 + 1, 5 54786 + 1, 5 54787 + 3 54787 , 7 54790 + 1, 7 54790 + 3 54790 , 7 54790 + 5 54790 , 4 54790 − 2254790 + 1, 8254790 + 3254790 , 8 54790 + 5 54790 , 8 54787 + 7 54787 , 9 54785 + 5 54785 , 9 54790 + 7 54790 , 9 54790 + 8 54790 , 11 54791 + 2 54791 , 11 54791 + 6 54791 and 11 54791 + 10 54791 .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notes on Generalized Fermat Numbers

There are two different definitions of generalized Fermat numbers (GFN), one of which is more general than the other. In [5], Ribenboim defines a generalized Fermat number as a number of the form Fa,n = a n + 1 with a > 2, while Riesel ([6]) further generalizes, defining it to be a number of the form a n + b n . Both definitions generalize the usual Fermat numbers Fn = 2 n + 1. The only known F...

متن کامل

Factors of generalized Fermat numbers

A search for prime factors of the generalized Fermat numbers Fn(a, b) = a2 n + b2 n has been carried out for all pairs (a, b) with a, b ≤ 12 and GCD(a, b) = 1. The search limit k on the factors, which all have the form p = k · 2m + 1, was k = 109 for m ≤ 100 and k = 3 · 106 for 101 ≤ m ≤ 1000. Many larger primes of this form have also been tried as factors of Fn(a, b). Several thousand new fact...

متن کامل

On the Fermat Periods of Natural Numbers

Let b > 1 be a natural number and n ∈ N0. Then the numbers Fb,n := b 2 +1 form the sequence of generalized Fermat numbers in base b. It is well-known that for any natural number N , the congruential sequence (Fb,n (mod N)) is ultimately periodic. We give criteria to determine the length of this Fermat period and show that for any natural number L and any b > 1 the number of primes having a peri...

متن کامل

A role for generalized Fermat numbers

We define a Gauss factorial Nn! to be the product of all positive integers up to N that are relatively prime to n ∈ N. In this paper we study particular aspects of the Gauss factorials bn−1 M cn! for M = 3 and 6, where the case of n having exactly one prime factor of the form p ≡ 1 (mod 6) is of particular interest. A fundamental role is played by those primes p ≡ 1 (mod 3) with the property th...

متن کامل

A Problem on the Conjecture concerning the Distribution of Generalized Fermat Prime Numbers (a New Method for the Search for Large Primes)

Is it possible to improve the convergence properties of the series for the computation of the Cn involved in the distribution of the generalized Fermat prime numbers? If the answer to this question is yes, then the search for a large prime number P will be C · log(P ) times faster than today, where C ≈ 0.01.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 74  شماره 

صفحات  -

تاریخ انتشار 2005