Let's determine the greatest common divisor of the numbers and , as well as and .
Problem 839
Official solution
Noticing that , and introducing the short notations , our numbers are
Accordingly, results from by swapping and . This swap maps onto itself, so it suffices to examine the question of and .
can be transformed as follows:
Based on this, we will separately consider the question of the greatest common divisor with for each of the two factors.
A natural question is whether there exist , coefficients independent of and , such that the polynomial
of and , when multiplied by the first factor of , gives . This is satisfied if the coefficients of the like terms in and the product are respectively equal (which we have already ensured for the coefficients of and by choosing the coefficients of and ), that is,
It is easy to see that there is a solution: , so is divisible by , the quotient being ; further, we seek the common divisor of this and the second factor of .
According to a known identity, the quotient
Accordingly, if there exists the common divisor mentioned now, it is also a divisor of the last term on the right side, . The divisors of this (since in our problem and are relatively prime, as is prime and not a divisor of ) are the divisors of and . However, has no common divisor greater than 1 with , because is a divisor of and , but is not divisible by any divisor of greater than 1, and has no common divisor greater than 1 with , because the sum of the last two terms is , where is prime and is relatively prime to , to , and thus to .
Accordingly, the greatest common divisor of and is , and this is also the greatest common divisor of the pair based on the aforementioned (swap) relationship between and , since swapping and does not change , and the reasoning applied to can essentially be repeated for .