You are Here: Home >< Maths

# BMO question from 1980

Announcements Posted on
TSR's new app is coming! Sign up here to try it first >> 17-10-2016
1. Prove that the equation x^n + y^n = z^n, where n is an integer > 1, has no solution in integers x, y, and z, with 0 < x <= n, 0 < y <= n.

Find the shortest solution you can; I have one that only takes 4 lines of working.
2. (Original post by HapaxOromenon2)
Prove that the equation x^n + y^n = z^n, where n is an integer > 1, has no solution in integers x, y, and z, with 0 < x <= n, 0 < y <= n.

Find the shortest solution you can; I have one that only takes 4 lines of working.
One can get this pretty snappily with the contrapositive. Took me quite a while to notice this.
Spoiler:
Show
Suppose the equation has a solution, and w.l.o.g. .

But . The result follows.
3. (Original post by joostan)
One can get this pretty snappily with the contrapositive. Took me quite a while to notice this.
Spoiler:
Show
Suppose the equation has a solution, and w.l.o.g. .

But . The result follows.
What I did: By Fermat's Last Theorem there are no solutions for n>2, so since we are given n>1, we need only consider n = 2. Thus we have that x^2 + y^2 = z^2 and 0<x<=2, 0<y<=2, so x and y can each only be 1 or 2.
Thus we check 1^2 + 1^2 = 2, 1^2 + 2^2 = 2^2 + 1^2 = 5, 2^2 + 2^2 = 8, none of which are square numbers. Thus the result follows.

4. (Original post by HapaxOromenon2)
What I did: By Fermat's Last Theorem there are no solutions for n>2, so since we are given n>1, we need only consider n = 2. Thus we have that x^2 + y^2 = z^2 and 0<x<=2, 0<y<=2, so x and y can each only be 1 or 2.
Thus we check 1^2 + 1^2 = 2, 1^2 + 2^2 = 2^2 + 1^2 = 5, 2^2 + 2^2 = 8, none of which are square numbers. Thus the result follows.

I disagree, assuming Fermat's Last Theorem is gigantic, the proof of it - monumental.
Moreover this question was initially set before the theorem was proved.
5. (Original post by joostan)
I disagree, assuming Fermat's Last Theorem is gigantic, the proof of it - monumental.
Moreover this question was initially set before the theorem was proved.
True. But it's still easier to understand than the thing you did, because you don't have to understand the proof of a theorem in order to understand it's statement and to use it to solve problems.
6. (Original post by joostan)
I disagree, assuming Fermat's Last Theorem is gigantic, the proof of it - monumental.
Moreover this question was initially set before the theorem was proved.
He's a well known troll, this is his ~10/11th account. I wouldn't bother replying to him.
7. (Original post by Zacken)
He's a well known troll, this is his ~10/11th account. I wouldn't bother replying to him.
I demand that you cease and desist from defamation of me at once.

## Register

Thanks for posting! You just need to create an account in order to submit the post
1. this can't be left blank
2. this can't be left blank
3. this can't be left blank

6 characters or longer with both numbers and letters is safer

4. this can't be left empty
1. Oops, you need to agree to our Ts&Cs to register

Updated: April 2, 2016
TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Today on TSR

### How does exam reform affect you?

From GCSE to A level, it's all changing

Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read here first

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams