Why Does a Prime p Divide a Fermat Number?
Zafer Selçuk Aygin, Kenneth S. Williams
Abstract
Zafer Selçuk Aygin, Kenneth S. Williams
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.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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