MathDB
gcd (d_1, n/d_2)=gcd (d_2, n/d_1) => d_1=d_2 , where d_1,d_2 pos. divisors of n

Source: 1998 Estonia National Olympiad Final Round grade 11 p1

March 11, 2020
number theorygreatest common divisorDivisors

Problem Statement

Let d1d_1 and d2d_2 be divisors of a positive integer nn. Suppose that the greatest common divisor of d1d_1 and n/d2n/d_2 and the greatest common divisor of d2d_2 and n/d1n/d_1 are equal. Show that d1=d2d_1 = d_2.