Divisibilityhard
0:00.0

Let a,n,ma, n, m be positive integers with a>1a > 1. The greatest common divisor gcd(an+1,am+1)\gcd(a^n+1, a^m+1) is equal to agcd(n,m)+1a^{\gcd(n, m)} + 1 if and only if: