An Extension to Fermat's Factorisation and a simple primality test

2002/02/26 by Satyabrata Adhikari, Abhijit Sen, Adhikari, Satyabrata +1
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #FOS: Mathematics #General Mathematics (math.GM) #math.GM

paper · pdf · doi:10.48550/arxiv.math/0202269

4 pages LaTeX

arxiv created 2002/02/26 · openalex publication_date 2002/02/26 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

An extension to the factorisation principle as suggested by Fermat is presented.We start from a symmetry of natural numbers and obtain the factorisation principle therefrom.Later it is extended further to test the primality of any natural number and finally used to factorise any given number.

Related

• The new Fermat-type factorization algorithm
• A new characterization of prime Fermat's numbers
• The use of the invariant's properties in the primality test and prime search
• A LLT-like test for proving the primality of Fermat numbers
• Integer Factorisation, Fermat & Machine Learning on a Classical Computer