Solutions to a diophantine equation

Level pending

Find the number of ordered quadruples of non-zero integers ( a , b , c , d ) (a, b, c, d) which satisfy the following equation: a 3 b c d + b 3 c a d + c 3 a b d + d 3 a b c = 5 \frac{a^3}{bcd} + \frac{b^3}{cad} + \frac{c^3}{abd} + \frac{d^3}{abc}= 5


The answer is 0.

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.

2 solutions

Jubayer Nirjhor
Dec 15, 2013

The given expression simplifies to... a 4 + b 4 + c 4 + d 4 = 5 a b c d a^4+b^4+c^4+d^4=5abcd

Let f b , c , d ( a ) = a 4 + b 4 + c 4 + d 4 f_{b,c,d} (a)=a^4+b^4+c^4+d^4 . Note that, f b , c , d ( a ) f_{b,c,d}(a) is always positive and ( a , b , c , d ) Z { 0 } (a,b,c,d)\in \mathbb{Z}-\left\{0\right\} .

f 1 , 1 , 1 ( 1 ) = 4 < 5 < f 1 , 1 , 1 ( 2 ) = 19 f_{1,1,1}(1)=4<5<f_{1,1,1}(2)=19

Hence, f b , c , d ( a ) 5 f_{b,c,d}(a)\neq 5 for any ( a , b , c , d ) Z { 0 } (a,b,c,d)\in \mathbb{Z}-\left\{0\right\} .

The answer is 0 \fbox{0} . :p

Sorry, the proof is wrong... At the last part I solved for f b , c , d ( a ) = 5 f_{b,c,d}(a)=5 instead of 5 a b c d 5abcd . :p

Here's another approach... The given expression simplifies to... a 4 + b 4 + c 4 + d 4 = 5 a b c d a^4+b^4+c^4+d^4=5abcd 5 5 has 2 2 quartic residues: 0 , 1 0,1 . The right side is divisible by 5 5 , hence so should be the left side. So this is obvious that each of a , b , c , d a,b,c,d is divisible by 5 5 . Let's write them as 5 w , 5 x , 5 y , 5 z 5w,5x,5y,5z respectively. Thus we have... ( 5 w ) 4 + ( 5 x ) 4 + ( 5 y ) 4 + ( 5 z ) 4 = 5 5 w 5 x 5 y 5 z (5w)^4+(5x)^4+(5y)^4+(5z)^4=5\cdot 5w\cdot 5x \cdot 5y\cdot 5z 5 4 ( w 4 + x 4 + y 4 + z 4 ) = 5 5 w x y z w 4 + x 4 + y 4 + z 4 = 5 w x y z \Longrightarrow ~~~ 5^4(w^4+x^4+y^4+z^4)=5^5 wxyz ~~~~\Longrightarrow ~~~w^4+x^4+y^4+z^4=5wxyz

Let's assume that ( a 1 , b 1 , c 1 , d 1 ) (a_1, b_1, c_1, d_1) are the values of ( a , b , c , d ) (a,b,c,d) respectively such that the minimum of a + b + c + d a+b+c+d is attained. Now since a , b , c , d a,b,c,d are non-zero, ( w , x , y , z ) < ( a , b , c , d ) (w,x,y,z)<(a,b,c,d) , implying w + x + y + z < a + b + c + d w+x+y+z<a+b+c+d , which is a contradiction since ( w , x , y , z ) (w,x,y,z) is also a solution to the original equation.

Hence, no solutions exist to the given equation. Answer: 0 \fbox{0} :)

Jubayer Nirjhor - 7 years, 5 months ago

Log in to reply

Nice! This is moreorless my intended solution. The trick you used is also known as Infinite Descent. However, you are missing a small detail. You are taking it for granted that ( a , b , c , d ) (a, b, c, d) are positive. That can easily be fixed though, by noting that 5 a b c d > 0 5abcd>0 , so the negative values come in pairs, which essentially means ( a , b , c , d ) (a, b, c, d) satisfies the equation if and only if so does ( a , b , c , d ) (|a|, |b|, |c|, |d|) .

Sreejato Bhattacharya - 7 years, 5 months ago

Log in to reply

Yes, I missed that. Thanks! :D

Jubayer Nirjhor - 7 years, 5 months ago

This reduces to a 4 + b 4 + c 4 + d 4 = 5 a b c d a^4+b^4+c^4+d^4 = 5abcd . For any integer n n , n 4 0 , 1 ( m o d 5 ) n^4 \equiv 0,1 \pmod{5} . There are four numbers in LHS, & any combination of four 0s or 1s doesn't make 5. So each a b c d 0 ( m o d 5 ) a = 5 a 1 a \equiv b \equiv c \equiv d \equiv 0 \pmod{5} \Rightarrow a=5a_1 \cdots same for others.

We again arrive at a 1 4 + b 1 4 + c 1 4 + d 1 4 = 5 a 1 b 1 c 1 d 1 a 1 = 5 a 2 a_1^4 + b_1^4+c_1^4+d_1^4=5a_1b_1c_1d_1 \Rightarrow a_1=5a_2 \cdots etc. Thus, by infinite descent it follows there are no non-zero solutions. [Concept of infinite descent: a = 5 a 1 = 5 2 a 2 = 5 3 a 3 = = 5 n a n a=5a_1 =5^2a_2=5^3 a_3= \cdots = 5^na_n , as n n tends to infinity this becomes impossible for some non-zero integer.]

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...