Binary Greatest Common Divisor Finder Algorithm

In other words, every prime of the form 2k + 1 (other than 2 = 20   +   1) is a Fermat number, and such primes are named Fermat primes. In mathematics, a Fermat number-named after Pierre de Fermat who first study them-is a positive integer of the form

Binary Greatest Common Divisor Finder source code, pseudocode and analysis

COMING SOON!