Determine all pairs (a,b)(a, b) of positive integers for which there exist positive integers gg and NN such that gcd(an+b,bn+a)=g\gcd(a^n + b, b^n + a) = g holds for all integers nNn \geq N. (Note that gcd(x,y)\gcd(x, y) denotes the greatest common divisor of integers xx and yy.)