I have written a quartic polynomial of the form x 4 − A x 3 + B x 2 − C x + C , where A , B , C are positive integers. The roots of the quartic are positive integers, not all necessarily distinct.
Find the maximum possible value of C .
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.
I think it's much better to ask the question directly. It takes quite a while to phrase what you're saying, at which point in time I lose interest.
Note that the question in brackets isn't identical to the one that you asked. What you want is, "When the coefficient of the constant term is negative of the coefficient of the linear term, what is the maximum possible value of this term?"
Log in to reply
I'm not sure what's meant by "ask the question directly," since I was just phrasing it based off of the inspiration. But, let me see if I can formulate it better.
Your second point is valid. Perhaps I do need to edit the question to make it clearer.
Log in to reply
Simply say.
Suppose that a , b , c , d are 4 (not necessarily distinct) positive integers such that
a b c + b c d + c d a + d a b = a b c d
What is the maximum possible value of a b c d ?
In general, the more hoops you place for people to jump through, the harder it is for them to follow (and for you to ensure that those are indeed the right hoops).
Log in to reply
@Calvin Lin – OK, that makes more sense now. I'm going to see if I can reformulate the problem to be clearer what it's asking for without removing the premise of the quartic polynomial.
Problem Loading...
Note Loading...
Set Loading...
Let a , b , c , d be the roots of the quartic. From Vieta's, D = a b c d and C = a b c + a b d + a c d + b c d . Since D = C , we can write
a b c + a b d + a c d + b c d = a b c d .
We can divide both sides by a b c d (since none of the roots are zero) to get
a 1 + b 1 + c 1 + d 1 = 1 .
Solving this equation requires a lot of work that would greatly expand the length of this solution, so we'll skip it for now. The solutions in positive integers to the equation are
( a , b , c , d ) = ( 2 , 3 , 1 2 , 1 2 ) , ( 2 , 3 , 1 0 , 1 5 ) , ( 2 , 3 , 9 , 1 8 ) , ( 2 , 3 , 8 , 2 4 ) , ( 2 , 3 , 7 , 4 2 ) , ( 2 , 4 , 8 , 8 ) ( 2 , 4 , 6 , 1 2 ) , ( 2 , 4 , 5 , 2 0 ) , ( 2 , 5 , 5 , 1 0 ) ( 2 , 6 , 6 , 6 ) , ( 3 , 3 , 4 , 1 2 ) , ( 3 , 3 , 6 , 6 ) ( 3 , 4 , 4 , 6 ) , ( 4 , 4 , 4 , 4 ) .
Thus, the maximum possible value of C is 1 7 6 4 , attained when ( a , b , c , d ) = ( 2 , 3 , 7 , 4 2 ) .