A note on factors of generalized Fermat numbers
type: Item
instance of: scholarly article
title: A note on factors of generalized Fermat numbers
zbMATH Open document ID: 0962.11008
DOI: 10.1016/S0893-9659(00)00045-8
author: I. Jiménez Calvo
published in: Applied Mathematics Letters
publication date: 2000-11-16T00:00:00Z
review text: A generalized Fermat number (GFN) is \(F_m(a,b)= a^{2^m}+ b^{2^m}\) \(((a,b)=1)\). It is shown how knowledge of a factor of one GFN can be used to find factors of other GFNs. There is a discussion of the phenomenon that, in factors \(k2^n+1\) of standard Fermat numbers \(F_m(2,1)\), \(n\) is found to be odd more often than even.
Mathematics Subject Classification ID: 11A51
zbMATH DE Number: 1531205
zbMATH Keywords: generalized Fermat number
zbMATH Keywords: factors
reviewed by: H. J. Godwin
MaRDI profile type: Publication
cites work: Prime numbers and computer methods for factorization.
cites work: Q4001553
cites work: Q4003085
cites work: Q4854092
cites work: Factorization of the tenth Fermat number
cites work: New Factors of Fermat Numbers
cites work: Six New Factors of Fermat Numbers
cites work: Large primes and Fermat factors
cites work: Factors of generalized Fermat numbers
cites work: Factors of Generalized Fermat Numbers
cites work: Discrete Weighted Transforms and Large-Integer Arithmetic
cites work: Common prime factors of the numbers $$A_n = a^{2^n } + 1$$
cites work: Some Very Large Primes of the Form k ⋅2 m + 1
cites work: A Report on Primes of the Form k⋅2 n + 1 and On Factors of Fermat Numbers
description: scientific article; zbMATH DE number 1531205