Trailing Bit-pattern Analysis for Integers with an Application to Fermat Numbers

The aim of this paper is to propose a simple framework
to analyze the bit-patterns of the factors of Fermat numbers.
A concise representation of positive integers
is introduced, and theorems are proved regarding the
changes in trailing bit-pattern after multiplication by other integers.
These results are then applied to the analysis of Fermat numbers.

Chiba University of Commerce review