Find the maximum possible integral value of
2 5 x 2 − 1 0 3 x + 2 0 1 4
Where x is an integer.
Assume:
I will post a solution to this with a neat generalized formula 16 hours after this post if no one else has.
You may use a calculator
You may use all and any means possible of solving this problem, whether be it wolfram alpha, Python coding, or Java. Although I encourage you to use only a pencil and a hand held calculator because that is how I did it.
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.
Nice alternative solution. Mine is a more case specific and formula based while yours is more intuitive and manipulative.
The graph of this function is an infinite parabola. So can you please explain to me as to how can it have a finite maximum value?
Log in to reply
We're restricting to integer values of the domain and range.
Let k be an integer such that 2 5 x 2 − 1 0 3 x + 2 0 1 4 = k 2 2 5 x 2 − 1 0 3 x + ( 2 0 1 4 − k 2 ) = 0 Since x is an integer satifying the above equation, the discrminant of the above quadratic is a perfect square .
Let p be that perfect square . 1 0 3 2 − 4 ( 2 0 1 4 − k 2 ) ( 2 5 ) = p 2 (expand it) ⇒ 4 ( 2 5 ) ( 2 0 1 4 ) − 1 0 3 2 = ( 1 0 k ) 2 − p 2 ⇒ ( 1 0 k − p ) ( 1 0 k + p ) = 1 9 0 7 9 1
We know that 1 9 0 7 9 1 = 3 2 × 1 7 × 2 9 × 4 3
Let α 1 and α 2 be factors of 1 9 0 7 9 1 , such that
( 1 0 k − p ) = α 1 ( 1 0 k + p ) = α 2 α 1 α 2 = 1 9 0 7 9 1
Add the first 2 eqns
2 0 k = α 1 + α 2
So we need to find 2 factors of 190791 such that there sum is maximum, by AM-GM we know that the minimal value would occur at symmetry(both the factors being equal), so we can think that at the extreme points the sum would maximize. We start by taking one of the factors to be unity(one) and the other to be the 190791, but we fail to get an integer solution. Second we take one factor to be 3 and the other to be 63579, in this case we get an an integer solution i.e, k = 3 1 8 0
let y = 2 5 x 2 − 1 0 3 x + 2 0 1 4
Which represents the function a 2 x 2 + b x + c
Thus, because the first term is obviously a square number for an integer X, 1 0 3 x − 2 0 1 4 must be a difference of squares.
We can represent y 2 = 2 5 ( x + n ) 2 implying that 2 5 ( x + n ) 2 − 2 5 x 2 = − 1 0 3 x + 2 0 1 4
From here, a little manipulation yields x = 1 0 3 + 5 0 n 2 0 1 4 − 2 5 n 2
Now, I don't know of any guarnteed way of finding an exact n without guess and check. Luckily, however, the max value of x occurs when the denominator is as small as possible, or 1 0 3 = − 5 0 n
However, since n must be an integer for x to be an integer, we round to the nearest integer, thus n=-2. As our first guess, we can try n=-2, which, coincidentally, makes x an integer.
Thus plugging in n=-2, x=638. Plugging in x=638 we get y = 3 1 8 0
I will post a note for a much more generalized form of this.
Brilliant! I got to n=-103/50 but didn't understand what to do with that haha. Thanks!
Log in to reply
Ya, it's cool that every number a,b,c,n has to be an integer or y is guarnteed irrational
At x=638, you will get maximum value of 3180. Please check your answer again! Btw I need my 165 points! :-|
Log in to reply
Yeah, sorry about that, I didn't realize at the time that the lemma I used only holds for a,b,c being positive
Log in to reply
What are a,b,c??? Well... Can you share your lemma?
Log in to reply
@Pranjal Jain – I will post a note detailing it further , also the problem has been fixed so you should have been rewarded you points (assuming you put the answer as 3180.
Log in to reply
@Trevor Arashiro – Yeah! I got points! Thanks btw!
@Trevor Arashiro – apologies, but shouldn't the maximum possible value of given polynomial by infinity since the coefficient of x^2 is greater than 0? Shouldn't there always be a number greater than 638 which gives an integral solution? Please elaborate...
Log in to reply
@Yash Akhauri – Well, you are inputting x as integers. So you might get infinite results but they need not be perfect squares to give y an integer!
Log in to reply
@Pranjal Jain – Could you provide me with a generalized way to solve such sums? Or this one specifically? Thanks"
Log in to reply
@Yash Akhauri – There is no exact general one, but I will post my solution right no.
Problem Loading...
Note Loading...
Set Loading...
Let y = 2 5 x 2 − 1 0 3 x + 2 0 1 4 . Let a = 1 0 y , b = 5 0 x − 1 0 3 . Then squaring , multiplying both sides by 1 0 0 , and completing the square gives ( a + b ) ( a − b ) = 1 9 0 7 9 1 .
Note that a + b ≡ 7 mod 1 0 and a − b ≡ 3 mod 1 0 . Note also that both factors should be positive because their sum is 2 0 y , which is positive. There are six pairs of factors of 1 9 0 7 9 1 = 3 2 ⋅ 1 7 ⋅ 2 9 ⋅ 4 3 of this form: 6 3 5 9 7 ⋅ 3 , 1 7 ⋅ 1 1 2 2 3 , 4 4 3 7 ⋅ 4 3 , 8 7 ⋅ 2 1 9 3 , 1 2 4 7 ⋅ 1 5 3 , 3 8 7 ⋅ 4 9 3 . This leads to the solutions ( x , y ) = ( 6 3 8 , 3 1 8 0 ) , ( − 1 1 0 , 5 6 2 ) , ( 4 6 , 2 2 4 ) , ( − 1 9 , 1 1 4 ) , ( 1 3 , 7 0 ) , ( 1 , 4 4 ) . So the answer is 3 1 8 0 .