Diophantine Equations (Problem 3, Version 2)

Number Theory Level pending

x n y n = 1001 x^n - y^n = 1001

Are there are solutions for n = 1 , n = 2 n = 1, n = 2 where x , y x,y are integers?

Yes No

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.

1 solution

When n = 1 , x y = 1001 : x 1001 , y 0 n = 1, x - y = 1001: x \geq 1001, y \geq 0

When n = 2 , x 2 y 2 = 1001 : x 32 : x = 32 , y = 45 n = 2, x^2 - y^2 = 1001: x \geq 32 : x = 32, y = 45

Therefore, the answer is Yes

n = 3 n = 3 is also true

x 3 y 3 { ( 10 ) 3 ( 1 ) 3 = 1001 ( 1 ) 3 ( 10 ) 3 = 1001 x^3 - y^3 \implies \begin{cases}(10)^3 - (-1)^3 = 1001 \\ (1)^3 - (-10)^3= 1001 \end{cases}

Mahdi Raza - 1 year ago

Log in to reply

Oh, thanks - the guy who gave me the idea said he couldn't solve it for n = 3 n = 3

1 pending report

Vote up reports you agree with

×

Problem Loading...

Note Loading...

Set Loading...