2020Mathematics MagazineRequires access

Why Does a Prime p Divide a Fermat Number?

Zafer Selçuk Aygin, Kenneth S. Williams

Open publisher page 1 citations

Abstract

SummaryA prime dividing a composite Fermat number is called a Fermat prime divisor. Such a prime p must be congruent to 1 modulo 4, and so, by the Fermat–Girard theorem, there exists integers R and S such that p = R2 + S2. We derive a necessary and sufficient condition for p to be a Fermat prime divisor in terms of the integers R and S.

About this research paper

What this paper is about

SummaryA prime dividing a composite Fermat number is called a Fermat prime divisor. Such a prime p must be congruent to 1 modulo 4, and so, by the Fermat–Girard theorem, there exists integers R and S such that p = R2 + S2. We derive a necessary and sufficient condition for p to be a Fermat prime divisor in terms of the integers R and S.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

SummaryA prime dividing a composite Fermat number is called a Fermat prime divisor. Such a prime p must be congruent to 1 modulo 4, and so, by the Fermat–Girard theorem, there exists integers R and S such that p = R2 + S2. We derive a necessary and sufficient condition for p to be a Fermat prime divisor in terms of the integers R and S.

Key concepts: Mathematics, Fermat number, Fermat's Last Theorem, Regular prime, Fermat's theorem on sums of two squares, Prime (order theory), Wieferich prime, Modulo

Related papers

Back to paper searchBrowse research topicsOriginal source
Why Does a Prime p Divide a Fermat Number? — Research Paper | ScholarLens