Integers satisfying 1 + x2 y = x2 + 2xy + 2x + y


This question comes from the 2001 British Maths Olympiad second round competition.
By Peter Conlon (P2714) on Wednesday, February 28, 2001 - 06:36 pm :

Find all pairs of integers (x, y) satisfying
1 + x2 y = x2 + 2xy + 2x + y

Peter


By James Lingard (Jchl2) on Wednesday, February 28, 2001 - 08:45 pm :

I get

x = -1, y = -1
x = 0, y = 1
x = 1, y = -1,
x = 2, y = -7
x = 3, y = 7

as the only solutions. Does this agree with what you had?

For question 3, I get the horrible expression

(2.4n-1 + 2.4n-2 + ... + 2.4 + 3) / (4n - 2.4n-1 - 2.4n-2 - ... - 2.4 - 2)

for p/q, which is either wrong, or must surely be able to be simplified, though I don't immediately see how.

James.


By Michael Doré (Md285) on Wednesday, February 28, 2001 - 10:19 pm :


x is an integer solution of the quadratic
x2 (1 - y) + x(2y + 2) + (y - 1) = 0

So the discriminant must be a square, i.e.

(2y + 2)2 + 4(y - 1)2

is a square.

From there, you can mess around with prime factorisation, and I get the same answer as James.


By James Lingard (Jchl2) on Wednesday, February 28, 2001 - 10:44 pm :

Interestingly, I did this in a different way:

Rearrange to get 4x = (y - 1)(x2 - 2x - 1). But x and x2 - 2x - 1 are coprime, so x divides y - 1. So y = ax + 1 for some integer a.

Then 4 = a(x2 - 2x - 1), so solve x2 - 2x - 1 = b for all b dividing 4, and you're done.

James.


By Peter Conlon (P2714) on Thursday, March 1, 2001 - 11:40 am :

Yep thats what I got. I did it in a slightly different way.

Rearrange to get y = 1 + (4x)/(x2 - 2x + 1)

For integer solutions, |4x| must be > = |x2 - 2x + 1|.

This only occurs for -2 =< x < = 6.

Just test these values, and the solutions follow.

Peter


By Olof Sisask (P3033) on Saturday, March 10, 2001 - 12:56 pm :

Hi,

Michael - how did you work it out using prime factorisation?

Thanks,
Olof.


By Michael Doré (Md285) on Saturday, March 10, 2001 - 08:29 pm :

I can't remember, and I am having difficulty in finding how to make that approach work now. Perhaps I made a mistake first time round - strange because I definitely got James' answer. If I see how to do it I'll write back...


By Olof Sisask (P3033) on Saturday, March 10, 2001 - 11:08 pm :

Thanks Michael. I had a go at doing it by prime factorisation but just couldn't see how. It sounds like a very interesting method!

Cheers,
Olof.


By Michael Doré (Md285) on Sunday, March 11, 2001 - 05:09 pm :

I'm pretty sure I made a mistake. It looks kind of promising setting the discriminant to a square, but unfortunately I can't see where to go from here. We know:

2y2 + 2 = r2

for some integer r. Now defining a = y + 1 and b = y - 1 we have:

a2 + b2 = r2

So (a,b,r) are Pythagorean. This means we can write:

a = k(p2 - q2
b = 2kpq
c = k(p2 + q2 )

for some k,p,q

Now a - b = 2, so k(p2 - 2pq - q2 ) = 2

But y is odd so we know k = +-1. If k = 1 this gives us (p - q)2 + 2q2 = 2 which is quite interesting as we have generated a new (smaller) solution to a very similar equation. If k = -1 then the sign is reversed.

Anyway, all of this really isn't going to lead to a quick solution - James or Peter's methods are definitely the way to tackle the problem. I'll see if I can find the place I wrote down my original solution, so I can pinpoint the error.