⎩ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎧ x + y + z = a , x 2 + y 2 + z 2 = b , x 3 + y 3 + z 3 = c , x 4 + y 4 + z 4 = d ,
Given that a , b , c and d are integers and they are four consecutive terms in an arithmetic progression, where 0 ≤ a < b < c < d . If the above system of equations has solutions (ie the system is consistent), how many such ( a , b , c , d ) ?
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.
Partial solution:
It can be shown that the system is consistent if ( a , b , c , d ) = ( 0 , 6 , 1 2 , 1 8 ) , ( 3 , 5 , 7 , 9 ) , ( 6 , 1 0 , 1 4 , 1 8 ) , ( 7 , 1 3 , 1 9 , 2 5 ) .
How can the numbers 7,13,20,27 be in A.P.?
Log in to reply
It was a typo. It should be ( a , b , c , d ) = ( 7 , 1 3 , 1 9 , 2 5 ) .
I don't get it, b+d-2c=0, since b,c,d are in AP. That means sum(x⁴-2x³+x²)=0 => sum(x²(x-1)²)=0. Since x,y,z are all reals, and sum of square of real numbers is 0, it means the numbers itself ard 0, that means x,y,z €{0,1}. Now we can just check cases and see that none satisfy.
Log in to reply
you wrote sum(x⁴-2x³+x²)=0. I think that means b + d − 2 c = x 4 − 2 x 3 + x 2 + y 4 − 2 y 3 + y 2 + z 4 − 2 z 3 + z 2 = 0 ⇒ x 2 ( x − 1 ) 2 + y 2 ( y − 1 ) 2 + z 2 ( z − 1 ) 2 = 0 That seems true to me, but why do x, y and z have to be real?
Log in to reply
@K T – Yes, I exactly meant that and x,y,z in my opinion should be real because we were only asked to confirm the consistency of the system of equations and nothing else was mentioned in the question, in that case we usually don't assume complex values.
( a , b , c , d ) = ( 6 , 3 6 , 6 6 , 9 6 ) is another valid solution, so there are (at least?) 5 such consistent systems (not that this changes the answer).
My workings were pretty messy - lots of Vieta, a bit too much reliance on Wolfram|Alpha...would you be able to post a full solution?
Log in to reply
From the given equations, xy+yz+zx= 2 a 2 − b , xyz= 6 1 (2c-3ab+ a 3 ). Therefore x, y, z are the roots of the equation X 3 -a X 2 + 2 1 ( a 2 -b) X- 6 1 ( a 3 -3ab+2c)=0. Therefore d= x 4 + y 4 + z 4 =a( x 3 + y 3 + z 3 )- 2 1 ( a 2 -b) ( x 2 + y 2 + z 2 )+ 6 1 ( a 3 -3ab+2c)(x+y+z). Substituting the values, we get the equation I have written.
Log in to reply
Yep, I agree with your equation, but the question is about the number of solutions it has in integers with a , b , c , d in A.P. Of course, we can just substitute in the five integer AP solutions that have been listed so far and show that they solve the equation, and that's enough to answer the question; but I'd be interested in showing that these are the only solutions.
Log in to reply
@Chris Lewis – Piggybacking on both the author's work and your work, the quadratic discriminant (in w ) of the equation a 4 − 6 a 3 − 6 a 2 w + 1 1 a 2 + 2 2 a w − 6 a + 3 w 2 − 1 8 w = 0 must be a perfect square. This essentially tells us that we want to solve the Diophantine equation, 6 a 4 − 4 8 a 3 + 1 4 2 a 2 − 1 8 0 a + 8 1 = E 2 .
I checked WolframAlpha for a < 1 0 1 0 and it only displays the 5 solutions already presented:
( a , b , c , d ) = ( 0 , 6 , 1 2 , 1 8 ) , ( 3 , 5 , 7 , 9 ) , ( 6 , 1 0 , 1 4 , 1 8 ) , ( 6 , 3 6 , 6 6 , 9 6 ) , ( 7 , 1 3 , 1 9 , 2 5 ) .
I doubt there's a "clean" solution to this problem.
Log in to reply
@Pi Han Goh – Yeah... I'm a bit out of my depth with these, but it's very enticing (especially since all the solutions have a < 1 0 , which suggests it's manageable).
Of course, the next question is, what about generalising? How many consistent systems of the form
∑ i = 1 n x i j = a j where j = 1 , … , n + 1 and the a j are distinct non-negative integers in arithmetic progression are there? (It looks like the answer is 5 when n = 3 )
I got the point. Thanks. May be there are more than five solutions. I'm checking it now.
From the given equations, it can be shown that a 4 − 6 a 2 b + 8 a c + 3 b 2 − 6 d = 0 . Then using the arithmetic progression condition, this reduces to a 4 − 6 a 2 b − 8 a 2 + 1 6 a b + 3 b 2 + 1 2 a − 1 8 b = 0 .
Log in to reply
Any ideas how to find the integer solutions from this? If you treat it as a quadratic in b , you get the same discriminant as @Pi Han Goh derived above (where the two parameters considered were the initial term and the common difference of the arithmetic progression). But there might be something in this formulation (or another one) that comes out more clearly.
Log in to reply
@Chris Lewis , @Pi Han Goh , I am just curious why I cant view mention[54224:Pi Han Goh]'s comments?
Log in to reply
@Chan Lye Lee – The comment I was referring to is partway through the replies to my comment about the fifth solution
Looking again, it starts with an "at" symbol - does that make it private? If you can't see a reply to a comment starting with "Piggybacking" let me know and I can post it here (or else try to summarise findings in a solution if easier).
Nope, no idea where to go from here.
I have no proof, only an idea to make the search a bit more efficient and avoid huge numbers evaluating the discriminant. By using modular arithmetic modulo a prime p, you can exclude all values of a for which the discriminant D = 6 a 4 − 4 8 a 3 + 1 4 2 a 2 − 1 8 0 a + 8 1 ( m o d p ) does not evaluate to a quadratic residue. Combining the primes upto 150, I tested all integer values from 0 upto 10^6, and the only ones among these for which D is a perfect square are [0, 1, 2, 3, 6, 7].
Here's a solution with a bit more detail:
We have a 3 = x 3 + y 3 + z 3 + 3 ( x y 2 + y z 2 + z x 2 + x 2 y + y 2 z + z 2 x ) + 6 x y z , so a 3 − 3 a b + 2 c − 6 x y z = 0 (I)
Similarly we have a 4 = x 4 + y 4 + z 4 + 4 ( x y 3 + y z 3 + z x 3 + x 3 y + y 3 z + z 3 x ) + 6 ( x 2 y 2 + y 2 z 2 + z 2 x 2 ) + 1 2 a x y z
= d + 4 ( a c − d ) + 3 ( b 2 − d ) + 1 2 a x y z , so
a 4 − 4 a c − 3 b 2 + 6 d − 1 2 a x y z = 0 (II)
Eliminate x y z by multiplying ( I ) by 2 a and then subtract ( I I ) from it:
a 4 − 6 a 2 b + 8 a c + 3 b 2 − 6 d = 0
Using the arithmetic progression, now substitute c = 2 b − a and d = 3 b − 2 a and simplify to
a 4 − 6 a 2 b − 8 a 2 + 1 6 a b + 3 b 2 + 1 2 a − 1 8 b = 0
We can view this as a quadratic in b:
( 3 ) b 2 + ( − 6 a 2 + 1 6 a − 1 8 ) b + ( a 4 − 8 a 2 + 1 2 a ) = 0
with solutions b = 3 3 a 2 − 8 a + 9 ± ( − 3 a 2 + 8 a − 9 ) 2 − 3 ( a 4 − 8 a 2 + 1 2 a )
in which the discriminant simplifies to
D = 6 a 4 − 4 8 a 3 + 1 4 2 a 2 − 1 8 0 a + 8 1 D needs to be a perfect square, so we can check different values of a, and find that D is a square for a ∈ { 0 , 1 , 2 , 3 , 6 , 7 } . This is not exhaustive, but by checking quadratic residues mod p for a prime p, I could exclude many candidates at a time. Doing so for all primes p ≤ 1 5 0 , I sieved out all other candidate values a ≤ 1 , 0 0 0 , 0 0 0 .
Checking the found values for a , we find 5 solutions for ( a , b ) :
Summarized we found solutions ( a , b , c , d ) ∈ { ( 0 , 6 , 1 2 , 1 8 ) , ( 3 , 5 , 7 , 9 ) , ( 6 , 1 0 , 1 4 , 1 8 ) , ( 6 , 3 6 , 6 6 , 9 6 ) , ( 7 , 1 3 , 1 9 , 2 5 ) }
Problem Loading...
Note Loading...
Set Loading...
I use Wolfram
Part 1 x + y + z = a , x 2 + y 2 + z 2 = b , x 3 + y 3 + z 3 = b + ( b − a ) , f i n d x 4 + y 4 + z 4
Part 2 1 / 6 ( a 4 − 2 a 2 ( 3 b + 4 ) + 1 6 a b + 3 b 2 ) = b + 2 ( b − a ) i n t e g e r s o l u t i o n
a = 0 a n d b = 6 a = 3 a n d b = 5 a = 6 a n d b = 1 0 a = 6 a n d b = 3 6 a = 7 a n d b = 1 3