Find the number of ordered quadruples of non-zero integers ( a , b , c , d ) which satisfy the following equation: b c d a 3 + c a d b 3 + a b d c 3 + a b c d 3 = 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.
Sorry, the proof is wrong... At the last part I solved for f b , c , d ( a ) = 5 instead of 5 a b c d . :p
Here's another approach... The given expression simplifies to... a 4 + b 4 + c 4 + d 4 = 5 a b c d 5 has 2 quartic residues: 0 , 1 . The right side is divisible by 5 , hence so should be the left side. So this is obvious that each of a , b , c , d is divisible by 5 . Let's write them as 5 w , 5 x , 5 y , 5 z 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 ⟹ 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
Let's assume that ( a 1 , b 1 , c 1 , d 1 ) are the values of ( a , b , c , d ) respectively such that the minimum of a + b + c + d is attained. Now since a , b , c , d are non-zero, ( w , x , y , z ) < ( a , b , c , d ) , implying w + x + y + z < a + b + c + d , which is a contradiction since ( w , x , y , z ) is also a solution to the original equation.
Hence, no solutions exist to the given equation. Answer: 0 :)
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 ) are positive. That can easily be fixed though, by noting that 5 a b c d > 0 , so the negative values come in pairs, which essentially means ( a , b , c , d ) satisfies the equation if and only if so does ( ∣ a ∣ , ∣ b ∣ , ∣ c ∣ , ∣ d ∣ ) .
This reduces to a 4 + b 4 + c 4 + d 4 = 5 a b c d . For any integer n , n 4 ≡ 0 , 1 ( m o d 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 ⋯ 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 ⋯ 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 , as n tends to infinity this becomes impossible for some non-zero integer.]
Problem Loading...
Note Loading...
Set Loading...
The given expression simplifies to... a 4 + b 4 + c 4 + d 4 = 5 a b c d
Let f b , c , d ( a ) = a 4 + b 4 + c 4 + d 4 . Note that, f b , c , d ( a ) is always positive and ( a , b , c , d ) ∈ Z − { 0 } .
f 1 , 1 , 1 ( 1 ) = 4 < 5 < f 1 , 1 , 1 ( 2 ) = 1 9
Hence, f b , c , d ( a ) = 5 for any ( a , b , c , d ) ∈ Z − { 0 } .
The answer is 0 . :p