ScholarLens Back to search
2022•INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCHOpen access

Polynomial Factorization and Primality Criterion for Fermat Numbers

Oumar Fall

Open full text 0 citations

Abstract

Abstract Let p be a prime integer and let k ∈N. We purpose a factorization of X2k +1 (mod p) allowing ti give a primality criterion for Fermat numbers. Mathematics Subject Classification 2010 11A07 11 A 51

Open-access reader

About this research paper

What this paper is about

Abstract Let p be a prime integer and let k ∈N. We purpose a factorization of X2k +1 (mod p) allowing ti give a primality criterion for Fermat numbers. Mathematics Subject Classification 2010 11A07 11 A 51

Why it matters

A significance statement is not available in the OpenAlex record.

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

Abstract Let p be a prime integer and let k ∈N. We purpose a factorization of X2k +1 (mod p) allowing ti give a primality criterion for Fermat numbers. Mathematics Subject Classification 2010 11A07 11 A 51

Key concepts: Primality test, Fermat's Last Theorem, Mathematics, Fermat number, Factorization, Prime (order theory), Unique factorization domain, Integer (computer science)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Polynomial Factorization and Primality Criterion for Fermat Numbers — Research Paper | ScholarLens