IMO 2007 Shortlist

For natural numbers x x and y y , let gcd ( x , y ) \gcd(x, y) denote the greatest common divisor of x x and y y . How many pairs of natural numbers x x and y y such that they satisfy the equation below?

x y = x + y + gcd ( x , y ) xy = x + y + \gcd (x, y)


The answer is 5.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

3 solutions

Liftmeup Nguyen
Jan 4, 2015

Given that x >= y

Then gcd(x,y) =< y

So xy =< x + y +y = x + 2y

=> x*(y-1) - 2y + 2 =< 2

=> (x-2)(y-1) =<2 (1)

If x and y are both greater than or equal to 5

Hence (1) is incorrect. So x and y is less than 5

If x = 1, we have no solution

If x = 2, then y =3 or y = 4

If x = 3, then y = 3 or y =2

If x = 4, then y = 2

If we count (a,b) and (b,a) as 1, we have 3 solutions (4,2), (3,3), (3,2)

@Priyanshu Mishra Nice problem. Would it be possible for you to indicate more clearly the relationship between x x and y y . At present the question just reads "natural numbers x x and y y with x x y y ", so we have to guess at whether you mean x y , x > y x \ge y, x \gt y or some other inequality.

Brian Charlesworth - 6 years, 5 months ago

But why x>=y? The question did not say that

Dawson Tan - 6 years, 5 months ago

I liked your solution but was unable to understand your first part. Can you explain me clearly?

Priyanshu Mishra - 6 years, 5 months ago

Log in to reply

I'm sorry for making my solution hard to understand. First, I see that x,y are symmetric so without loss of generality, I assume that x >=y.

Liftmeup Nguyen - 6 years, 5 months ago

Can you please explain me the 3rd step i.e. xy =<x+2y

Ankit Kumar Jain - 6 years ago

It is a nice solution!

Thanh Viet - 5 years, 2 months ago

there is 5 solutions ;you forgot(2.3) and (2,4)

Omar El Mokhtar - 6 years, 2 months ago
Souryajit Roy
Apr 5, 2015

Let g c d ( x , y ) = d gcd(x,y)=d .

Hence, x y + x y = d -x-y+xy=d which implies 1 x y + x y = d + 1 1-x-y+xy=d+1 or ( x 1 ) ( y 1 ) = d + 1 (x-1)(y-1)=d+1 .

So, ( x 1 ) d (x-1)|d and ( y 1 ) d (y-1)|d

Hence, x 1 d x-1≤d and y 1 d y-1≤d .

Again, d x d≤x and d y d≤y

So, d x d + 2 d≤x≤d+2 and d y d + 2 d≤y≤d+2

So x = d , d + 1 x=d,d+1 or d + 2 d+2 and y = d , d + 1 y=d,d+1 or d + 2 d+2 .

First,suppose x = y x=y

Hence, d = x d=x

So, x 2 = 2 x + x = 3 x x^{2}=2x+x=3x .So, x = 3 x=3 .Hence, ( x , y ) = ( 3 , 3 ) (x,y)=(3,3) is a solution.

The function x y x y g c d ( x , y ) xy-x-y-gcd(x,y) is symmetric in x , y x,y .

From now on,we can assume x < y x<y

If x = d x=d and y = d + 1 y=d+1 ,then d = g c d ( x , y ) = g c d ( d , d + 1 ) = 1 d=gcd(x,y)=gcd(d,d+1)=1

Hence, x = 1 x=1 and y = 2 y=2 .But this pair does not satisfy the given equation.

If x = d x=d and y = d + 2 y=d+2 ,then d ( d + 2 ) = d + ( d + 2 ) + d d(d+2)=d+(d+2)+d or d 2 d 2 = 0 d^{2}-d-2=0

Therefore, ( d + 1 ) ( d 2 ) = 0 (d+1)(d-2)=0 .So, d = 2 d=2 .

Hence, ( x , y ) = ( 2 , 4 ) (x,y)=(2,4)

Finally,if x = d + 1 x=d+1 and y = d + 2 y=d+2 ,then d = 1 d=1 .

Hence, x = 2 x=2 and y = 3 y=3 .See that this pair satisfies the given equation.

So, ( x , y ) = ( 2 , 3 ) (x,y)=(2,3) is another pair.

Không Ai Cả
Feb 18, 2015

The equation is the same with the formula of the number of integer-coordinates point on the edges of a square triangle with edges x and y.

On the other hand, S = a + b/2 -1 (a and b is the number of the points inside and on the edges of the triangle, S is the area of the triangle.)

We have:

xy = x + y + gcd( x ; y )

S = xy/2

b = x + y +gcd( x ; y )

So xy/2 = a + ( x + y +gcd( x ; y ) ) / 2 - 1

Therefore a = 1, which means there's only 1 integer-coordinates point inside the triangle/

We can easily see that there are 3 solutions: (2;4) (2;3) and (3;3) Sorry for my poor English :P.

pls elaborate the first line of the problem.

rajdeep brahma - 3 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...