A new characterization of prime Fermat's numbers
Ahmed Bouzalmat, Ahmed Sani
Abstract
Open-access reader
Ahmed Bouzalmat, Ahmed Sani
Abstract
Open-access reader
We give a new sufficient condition which allows to test primality of Fermat's numbers. This characterization uses uniquely values at most equal to tested Fermat number. The robustness of this result is due to a strict use of elementary arithmetic technical tools and it will be susceptible to open gates for revolutionary statement that all Fermat's numbers are all decomposable.
A significance statement is not available in the OpenAlex record.
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.
We give a new sufficient condition which allows to test primality of Fermat's numbers. This characterization uses uniquely values at most equal to tested Fermat number. The robustness of this result is due to a strict use of elementary arithmetic technical tools and it will be susceptible to open gates for revolutionary statement that all Fermat's numbers are all decomposable.
Key concepts: Primality test, Fermat's Last Theorem, Fermat number, Mathematics, Characterization (materials science), Arithmetic, Discrete mathematics, Fermat's little theorem