# Question: let n gt m be positive integers use problem let...

###### Question details

Let n > m be positive integers. Use problem (Let n>m be positive integers, and suppose that n=qm+r,0 ≤ r <m, as in the Division Algorithm) to compute gcd(2^2^n + 1, 2^2^m + 1).Numbers of the form 2^2^n + 1 are called Fermat numbers.