A new characterization of prime Fermat's numbers

Abstract: 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.