Find the largest possible integer value of x such that the expression below is also an integer:
x 2 + 9 x .
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.
On the sixth line, your 80 should be 81.
Log in to reply
agree with Steven
This is not a valid solution because t is unconstrained. For instance, if one back substitutes your original substitution, one gets a parabola with a minimum, but no maximum. This cannot be maximized, and it has dual solutions for any arbitrary x.
Log in to reply
You sure? x and t are integers, and that's the "constraint" you may have missed.
One can also investigate the cases how x ( x + 9 ) results in t 2 :
a) x = n ∧ x + 9 = n m 2 ⇒ 9 = n ( m 2 − 1 ) which has the only solution for integers when n = 3 ∧ m = 2 , i.e. x = 3
b) x = n 2 ∧ x + 9 = m 2 ⇒ 9 = ( m + n ) ( m − n ) which has two solutions:
m + n = m − n = 3 , i.e. n = 0 or
m + n = 9 ∧ m − n = 1 ⇒ m = 5 ∧ n = 4 , i.e. x = 1 6 .
This can be generalized.
Let a be an odd prime.
Find the largest positive integer x such that x 2 + a 2 x = j 2 , where j is an positive integer.
x 2 + a 2 x = j 2 ⟹ ( 2 x + a 2 ) 2 − a 4 = ( 2 j ) 2 ⟹ ( 2 x + a 2 ) 2 − ( 2 j ) 2 = a 4 ⟹ ( 2 x − 2 j + a 2 ) ( 2 x + 2 j + a 2 ) = a 4
2 x + 2 j = a 4 − a 2
2 x − 2 j = 1 − a 2
⟹ x = ( 2 a 2 − 1 ) 2 = k 2 ∈ N and j = 4 ( a − 1 ) ( a 3 + a 2 + 1 ) = m ∗ l ∈ N
2 x + 2 j = a 3 − a 2
2 x − 2 j = a − a 2
⟹ x = a ( 2 a − 1 ) 2 = 2 h n 2 ∈ N and j = a ( 2 a 2 − 1 ) 2 = 2 q s 2 ∈ N
2 x + 2 j = 0
2 x − 2 j = 0
⟹ x = j = 0 clearly x = 0 = x m a x .
For a > 1
( a 2 − 1 ) 2 − a ( a − 1 ) 2 = ( a − 1 ) 2 ( a + 1 ) 2 − a ( a − 1 ) = ( a − 1 ) 2 ( a 2 + a + 1 ) > 0 ⟹ ( a 2 − 1 ) 2 > a ( a − 1 ) 2 ⟹ ( 2 a 2 − 1 ) 2 > a ( 2 a − 1 ) 2
∴ x = x m a x = ( 2 a 2 − 1 ) 2
For instance using a = 7 9 1 9 ⟹ x m a x = 9 8 3 1 5 3 5 8 3 8 7 8 4 0 0 .
Log in to reply
I don't think you need the requirement that a is an odd prime. Specifically, I do not see how you used the fact that a is prime.
You can actually do this for all integers (be careful with the even case).
x 2 + a x = j 2 → ( 2 x + a + 2 j ) ( 2 x + a − 2 j ) = a 2 . Both terms have the same parity and are factors of a 2 ,
Log in to reply
I realize that, but the problem used the odd prime 3 so I used the general case for a as an odd prime. I used the form that the problem stated x 2 + a 2 x = j 2 and using the method I used above and using a prime(not necessarily odd) gives only three pairs of factors ( 1 , a 4 ) , ( a , a 3 ) , ( a 2 , a 2 ) .
It took me awhile to work through your solution. Putting in more steps would have been helpful. Think like a teacher! :>)
you know for some reason I saw this on my NWEA (Northwest Evaluation Association) math test...
Log in to reply
shrugs I made this problem myself when I was grade 8 x'D
Is there particular logic that allowed you to skip other possibilities of solutions where you swap (1 & 81) (3 & 27) on the right hand side of those x and t expressions ?or is it understood that we have to check them also to verify the solution doesn't change ?
Log in to reply
t is a non-negative integer, and therefore, 2 x − 2 t + 9 ≤ 2 x + 2 t + 9 .
We need x 2 + 9 x = n 2 for some integer n .
x 2 + 9 x − n 2 = 0
x = 2 − 9 ± 8 1 + 4 n 2 ⟹ x = 2 − 9 + 8 1 + 4 n 2 to maximize x . Thus, 2 x + 9 = 8 1 + 4 n 2 . Therefore, we can create a right triangle with sides 9 , 2 n , and 2 x + 9 .
The Pythagorean triplet with length 9 that maximizes the length of the hypotenuse (and thus x ) is the 9 − 4 0 − 4 1 right triangle (see below). This can be accomplished with n = 2 0 and x = 1 6 .
For primitive Pythagorean triplet a − b − c , where c is the hypotenuse, the three sides can be generated by choosing two positive coprime integers with different parity r and s with r > s :
a = r 2 − s 2
b = 2 r s
c = r 2 + s 2
Choosing r = 5 and s = 4 , we get the 9 − 4 0 − 4 1 triangle. There are no other perfect squares with a difference of 9 (note that for any integer a , ( a + 1 ) 2 − a 2 > a 2 − ( a − 1 ) 2 ⟹ 1 > − 1 , so consecutive differences of perfect squares will get increasingly larger than 9 after 2 5 , and smaller values can be tested with trial and error). 9 cannot be equal to 2 r s since it is odd, and it cannot be c since it is a leg of the triangle. 9 can also be created from scaling up another primitive Pythagorean triplet, but the only such triangle can be created by scaling up a 3 − 4 − 5 triangle to get a 9 − 1 2 − 1 5 triangle. Therefore, we have found the largest value for the hypotenuse.
I love this interpretation of converting to something you are familiar with, and then applying what you already know.
Mathematics is built by reducing everything to a previously solved problem :)
I got it wrong 'cause i wrote 20 instead of 16 so i thought i had done something wrong and tried with the smaller solutions. Anyways, my initial approach was the same as yours, but when i got to 8 1 + 4 n 2 i observed that, since 4 n 2 = ( 2 n ) 2 is a square itself, we have the highest possible solution when 4 n 2 + 8 1 = ( 2 n + 1 ) 2 , which means n = 2 0 and therefore x = 1 6 .
Log in to reply
Be careful with statements like "highest possible solution when ...". This might seem intuitive obvious, so let's justify why.
A better explanation would be:
Let
4
n
2
+
8
1
=
(
2
n
+
a
)
2
where
a
≥
1
is a positive integer.
Then,
n
=
a
8
1
−
a
2
, and from the graph we know the maximum in the restricted domain occus at
a
=
1
.
Log in to reply
This is how I saw it:
Since ( n + 1 ) 2 = n 2 + 2 n + 1 , we know that the square of the (n+1)-nth positive integer is the square of the n-th integer plus the n-th odd number.
Let's take an odd number 2 k + 1 and let's ask ourselves: when is this number a difference between squares? For sure it is when these two squares are k 2 and ( k + 1 ) 2 .
Are there bigger solutions? No, because if m ≥ k then 2 k + 1 ≤ 2 m + 1 , which means the odd number we considered is even smaller than the difference between the square of m and the next square, so it is useless to look further than that.
If you apply these considerations to our case, you can see that being 8 1 the 40-th odd number, and being 4 n 2 the 2 n -nth square, it has to be 2 n = 4 0 , therefore n = 2 0 and, going back to our quadratic equation, x = 1 6 .
Log in to reply
@Steve Gualtieri – I just realized, while reading this, how 2 k + 1 is the ( k + 1 ) -nth odd number and not the k -th, otherwise 1 would be the 0-th odd number and not the first. But I hope that you get what I meant either way :)
@Steve Gualtieri – Right, my point is that the justifications which you later provided, were not stated at the start.
For example, you used the important fact that "Apart from 4 n 2 , we are left with just an odd integer, so lets solve 8 1 = 4 n + 1 .". If we were left with (say) 7 n + 8 1 , then the conclusion of " 7 n + 8 1 = 4 n + 1 " is not true (since n = 3 8 0 is not accepted).
Log in to reply
@Calvin Lin – Of course you are right, but 7 n is not a square (unless n = 7 ). I explicitly observed that 4 n 2 is one regardless of the choice of n , implicitly implying the argument i posted later. When i wrote my first solution I was using my phone and it was impractical to write a decently structured proof as to why the fact that 4 n 2 is a square implies that, in order to be the highest possible integer square, 4 n 2 + 8 1 must equal ( 2 n + 1 ) 2 , but I have posted a more detailed explanation of it as soon as I got home, because I knew that my proof was incomplete without it.
Relevant wiki: Quadratic Diophantine Equations - Solve by Bounding Values
The question is equivalent to ask find the biggest integer value of x such that x 2 + 9 x is a perfect square. Since x = 0 gives us x 2 + 9 x = 0 is a perfect square, we only need to consider positive x only.
Obviously, x 2 + 9 x > x 2 and x 2 + 9 x < x 2 + 1 0 x + 2 5 = ( x + 5 ) 2 . Hence, we can conclude that x 2 + 9 x is equal to ( x + k ) 2 ( k = 1 , 2 , 3 , 4 ) , because x 2 + 9 x is a perfect square between perfect squares x 2 and ( x + 5 ) 2 .
Try and error, we can get x = 3 , 1 6 . Hence, the answer is 1 6 .
Note: The claim of "It is obvious that positive x is bigger than negative x , so just consider positive x only. " need not be true. What is true is "Since x = 0 gives us x 2 + 9 x = 0 is a perfect square, we only need to consider positive x only".
Without setting this bound in place, it might turn out that there are no positive x which satisfy the conditions, so it is not sufficient to only consider positive x (at that point in time of the logical argument).
@Chan Tin Ping Won't the trial and error method be pretty long?
Log in to reply
There exist 4 cases only, so it isn't long. Besides that, x 2 + 9 x 9 x x = ( x + k ) 2 = ( x + k ) 2 − x 2 = k ( 2 x + k ) = 9 − 2 k k 2 So we just need to put four value to k such that x is positive integer. You can generalize it first then use try and error.
I found the answer with an excel spreadsheet fairly quickly.
This was my method too:
x ( x + 9 ) = k 2
x 2 < k 2 < ( x + 5 ) 2
etc.
How do you use latex on this site?
Log in to reply
Enclose your latex code within the Latex brackets of \ ( \ ) I've edited your comment for your reference.
I may be misunderstanding something, but -25 is "larger" than 16, despite being negative. Why are negative numbers not being included?
Log in to reply
We're not comparing absolute values here. We're comparing them relatively, IE − 2 5 < 0 < 1 6 .
x 2 + 9 x = y x 2 + 9 x = y 2 Completing the square is usually a good idea! First, however, we multiply everything by four to avoid fractions. ( 2 x ) 2 + 2 ⋅ 9 ( 2 x ) + 9 2 = ( 2 y ) 2 + 9 2 ( 2 x + 9 ) 2 − ( 2 y ) 2 = 9 2 ( 2 x + 9 + 2 y ) ( 2 x + 9 − 2 y ) = 9 2 . The expressions in brackets must be integers. Obviously, the largest possible value of either expression is 81. To optimize x , therefore, we write 8 1 ⋅ 1 = 9 2 : { 2 x + 9 + 2 y = 8 1 2 x + 9 − 2 y = 1 Add these to find 4 x + 1 8 = 8 2 ∴ x = 1 6 . Indeed, 1 6 2 + 9 ⋅ 1 6 = 1 6 ⋅ ( 1 6 + 9 ) = 1 6 2 5 = 4 ⋅ 5 = 2 0 .
Here's a solution for the more visually-minded, like me.
On the bottom is an x by x square, and above it is a 9 by x rectangle. You want to break up the rectangle and add the pieces to the square to make another square. You slice the rectangle into three pieces, two that are 4 by x and one that is 1 by x, and move one of the 4 by x pieces to the side of the square, as shown. Then the remaining 1 by x piece will have to make up the missing smaller square. Since that square is, we know, 4 by 4, then it must have 16 unit squares in it. It was a one by x rectangle, so x must have been 16.I just plugged it into excel, hoping the answer was small. The only values that have integer results were 3 and 16.
me too! and carried the series on long enough to show that the first two solutions for x, 3 and 16, had a difference of 6-3=3 and 20-16= 4, and that the next one,5, would never be reached as the difference went to 4.5 for x=infinity.
x²+9x=(x+a)²; (x+a) > x because 9x is positive and a is positive integer x²+9x=x²+2ax+a² (9-2a)x=a² x=a²/(9-2a) for largest x (9-2a) must be positive, a is integer 0<a<=4 for all values of a (a,x); (1, 1/7), (2, 4/5), (3, 3), (4, 16) max possible value of x is 16
I enjoy seeing the approaches everyone uses. Here I chose the brute-force approach, since all possible solutions must be integers, and likely small integers at that. A quick Excel spreadsheet covers all integers from -64 to 63 (no particular reason to cut off there, though). Solutions to the problem as stated are -25, -12, -9, 0, 3, and 16. Because the problem asks for the largest rather than the most positive, it seems the correct answer should be -25.
I have a solution with no trial and error which I haven't seen yet: Rewrite x^2+9x as x(x+9) For this to be a perfect square, both x and x+9 must be perfect squares Since we know the difference between the squares goes up as the odd numbers (1,4,9... difference is 3,5,7 etc), the max value of x is when x+9 is the next square, giving us 16.
Elegant and fast solution indeed. I used the same approach ;)
Log in to reply
So did i ! I did it quickly in my head since i hadnt a pen !
When x = 3 neither it nor x+9 are squares, but their product is. So it is not necessary for both factors to be squares in order for their product to be one.
I paraphrased this question as "what does 9 x need to be so that x 2 + 9 x is a square".
Every square larger than x 2 is of the form ( x + n ) 2 , so
x 2 + 9 = ( x + n ) 2 x 2 + 9 x = x 2 + 2 n x + n 2 9 x = 2 n x + n 2 9 x − 2 n x = n 2 ( 9 − 2 n ) x = n 2 n 2 > 0 ⟹ ( 9 − 2 n ) x > 0 ⟹ 9 − 2 n > 0 ⟹ 2 n < 9 ⟹ n ∈ { 1 , 2 , 3 , 4 }
From this we get
7 x = 1 5 x = 4 3 x = 9 x = 1 6
And so the only integer solutions are 3 and 16.
Note that we can factor x 2 + 9 x as x ( x + 9 ) . Suppose x 2 + 9 x is a perfect square. Now suppose some prime p divides x . Then p ∣ ( x + 9 ) ⟹ p ∣ ( x + 9 ) − x = 9 ⟹ p = 3 . Therefore unless p = 3 , we must have that p 2 ∣ x , and further that x has an even number of factors of p . This means that x = 3 n 2 or x = n 2 for some n . In the case x = 3 n 2 , we have that x 2 + 9 x = 9 n 4 + 2 7 n 2 = 9 n 2 ( n 2 + 3 )
This implies that n 2 + 3 is a perfect square, which we know only happens for n = 1 . Thus x = 3 is one possible solution.
In the case x = n 2 , we have x 2 + 9 x = n 4 + 9 n 2 = n 2 ( n 2 + 9 ) . This means n 2 + 9 is a perfect square, and the largest n for which that is true will be when n 2 + 9 = ( n + 1 ) 2 ⟹ n = 4 . Thus x = 1 6 is the largest possible x .
Simplified to (square root x).(square root X+9)
Therefore X and X+9 must be whole numbers And since the whole numbers grow in sequence exponentially, then finding the two whole numbers whose difference equals 9 is easy. sr16.sr(16+9)= sr4.5 =20 Unfortunately this approach didn't get neither number 3 or 0 possibility.
Let n = x 2 + 9 x . x , n are integers.
Thus n 2 = x 2 + 9 x .
Let x = n − k , thus k is also an integer.
x 2 = ( n − k ) 2 = n 2 − 2 k n + k 2
By rearranging the above: n 2 = x 2 + ( 2 k n − k 2 )
So 9 x = 2 k n − k 2
Substituting for n : 9 x = 2 k ( x + k ) − k 2
In terms of x : x = 9 − 2 k k 2 − ( 1 )
Since the numerator is of higher order, maximising k maximises x .
It can be seen from the denominator that for the constraint x ≥ 0 , k ≤ 2 9 .
Maximum integer k under this constraint is 4 . From ( 1 ) , this yields x = 1 6 , which happens to be an integer.
I worked it out in my head and found 3 was a solution. Like another respondent, I tried it in Excel, but with both positive and negative x, up to +1000 and down to -1000. The ONLY solutions are x=16, 3, 0, -9, -12 and -25. It is clear these are the only ones, because as x tends to +infinity, sqrt(xsq+9x) tends to x + 4.5, and x tends to -infinity, sqrt(xsq+9x) tends to x - 4.5, as would be predicted by a series expansion. But what is interesting is the VALUES of sqrt(xsq+9x) corresponding to these solutions. These are 20, 6, 0, 0, 6, 20. There is no obvious symmetry to the sequence x=16, 3, 0, -9, -12 and -25, in contrast. And 20, 6, 0, 0, 6, 20 can be written 5 * 4, 3 * 2, 1 * 0 etc.
General solution for any x 2 + ( 2 n + 1 ) x is to observe the fact that n 2 = ∑ k = 1 n 2 k − 1 and x 2 + ( 2 n + 1 ) x = x x + ( 2 n + 1 )
in other words, the question requires both x and x + ( 2 n + 1 ) to be square
or in other words both 1 + 3 + 5 + . . . + ( 2 x − 1 ) and 1 + 3 + 5 + . . . . + ( 2 x − 1 ) + ( 2 n + 1 ) to be square
the largest point this is achieved is at x = n 2 , exceeding that would prevent one multiple or the other being a square number, in this case n = 4 , therefore the solution is 16!
If sqrt(x^2 + 9x) is an integer, then x^2 +9x is the square of an integer, which we designate as x+n. So, x^2 + 9x = (x+n)^2. Solving, we have x = n^2/(9-2n). We want the largest possible value for x and we want x to be an integer. If n=4, then 9-2n=1>0 and x=16.
OK how about this:
We want x(x+9) to be a large square number.
Note that the square number needs paired up prime factors in order to have an integer root.
In my usual way of doing solutions, I note that the difference between squares is in the sequence of odd numbers, i.e. ...
How about 16 and 25, which have a difference of 9 and luckily happen to be square numbers themselves . Therefore their multiple also has an integer root.
Therefore 16 is a pretty good answer.
QUESTION:
Is this method alone sufficient to prove that there are no higher numbers that fit the bill?
Let x 2 + 9 x = z . Then we solve the equation x 2 + 9 x − z 2 = 0 in x , and, in order for x to be the largest possible integer value, we take x = 2 − 9 + 4 z 2 + 8 1 . So x is an integer only if the expression 4 z 2 + 8 1 is a perfect square, which means that it is necessary to be of the form 4 z 2 + 2 ⋅ 2 z ⋅ p + p 2 , i.e. 8 1 = 4 z p + p 2 = p ( 4 z + p ) . Since 8 1 = 3 4 , possible divisors are p = 1 , 3 , 9 , 2 7 , 8 1 . If p = 1 , then 4 z + 1 = 8 1 , and we find z = 2 0 . If p = 3 , then 4 z + 3 = 2 7 , and z = 6 . If p = 9 , then 4 z + 9 = 9 , and z = 0 . If p = 2 7 , then 4 z + 2 7 = 3 , and z = − 6 . Finally, if p = 8 1 , then 4 z + 8 1 = 1 , and z = − 2 0 . So, the largest possible integer value of x is obtained for z = 2 0 , i.e. x = 1 6 .
Well, pass the calculating part to the computer, with just a simple program, I got 3 results: 0, 3 and 16.
This can be generalized.
Let a be an odd prime.
Find largest positive integer x such that x 2 + a 2 x = j 2 , where j is an positive integer.
x 2 + a 2 x = j 2 ⟹ ( 2 x + a 2 ) 2 − a 4 = ( 2 j ) 2 ⟹ ( 2 x + a 2 ) 2 − ( 2 j ) 2 = a 4 ⟹ ( 2 x − 2 j + a 2 ) ( 2 x + 2 j + a 2 ) = a 4
2 x + 2 j = a 4 − a 2
2 x − 2 j = 1 − a 2
⟹ x = ( 2 a 2 − 1 ) 2 = k 2 ∈ N and j = 4 ( a − 1 ) ( a 3 + a 2 + 1 ) = m ∗ l ∈ N
2 x + 2 j = a 3 − a 2
2 x − 2 j = a − a 2
⟹ x = a ( 2 a − 1 ) 2 = 2 h n 2 ∈ N and j = a ( 2 a 2 − 1 ) 2 = 2 q s 2 ∈ N
2 x + 2 j = 0
2 x − 2 j = 0
⟹ x = j = 0 clearly x = 0 = x m a x .
For a > 1
( a 2 − 1 ) 2 − a ( a − 1 ) 2 = ( a − 1 ) 2 ( a + 1 ) 2 − a ( a − 1 ) = ( a − 1 ) 2 ( a 2 + a + 1 ) > 0 ⟹ ( a 2 − 1 ) 2 > a ( a − 1 ) 2 ⟹ ( 2 a 2 − 1 ) 2 > a ( 2 a − 1 ) 2
∴ x = x m a x = ( 2 a 2 − 1 ) 2
For instance using a = 7 9 1 9 ⟹ x m a x = 9 8 3 1 5 3 5 8 3 8 7 8 4 0 0 .
I tried to make x 2 + 9 x a perfect square.
Think of it as
( x + 1 ) 2 = x 2 + 2 x + 1 = x 2 + 9 x (then 7 x = 1 , x = 7 1 is not an integer)
or
( x + 3 ) 2 = x 2 + 6 x + 9 = x 2 + 9 x (so 3 x = 9 , x = 3 ).
Then the largest possible integer for x becomes 1 6 , since
( x + 4 ) 2 = x 2 + 8 x + 1 6 = x 2 + 9 x
that gives us x = 1 6 .
And we can't go any further, because the coefficient of the linear term can't exceed 9 , or it will not able to be made a perfect square.
x 2 + 9 x = c
x ( x + 9 ) = c Therfore, x and (x+9) must both be perfect squares. The only perfect squares that have a difference of 9 are 25 and 16. Therefore x=3
Which is not the correct answer.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 |
|
1 |
|
This solution is pretty roundabout, but it's different; letting y = x 2 + 9 x and a = y − x , we have ( y − x ) ( y + x ) a ( a + 2 x ) ⟹ x = 9 x = 9 x = 9 − 2 a a 2 . ( 1 ) Note that if y = x , we obtain only one solution of y = x = 0 . Substituting x = 1 yields y = 1 0 > 1 , which means that y > x ∀ x ≥ 1 . Hence, a > 0 . Now, to maximise x , we must minimise 9 − 2 a and maximise a 2 (from ( 1 ) ), both of which can be achieved by increasing a . Thus, we choose the largest integer a (since a ∈ Z + ) such that 9 − 2 a > 0 (otherwise x < 0 ). This is clearly 4 , since 9 − 2 × 5 = − 1 < 0 . This means that the maximum value of x over all positive, integral a is 4 2 / ( 9 − 2 × 4 ) = 1 6 , which is itself an integer, meaning we are done.
Hence, the largest integer x such that x 2 + 9 x is an integer is 1 6 .
sqrt(x^2+9x)=sqrt(x)*sqrt(x+9), if x=16 then 16+9=25 is also a square number
import math
def isInteger(num):
res = math.sqrt(pow(num,2) + 9*num)
if res % 1 == 0:
return True
else:
return False
for i in range(0,1000):
q = isInteger(i)
if q:
print(str(i) + ": " + str(q))(q))
If we let y equal the expression, we can write it as: x 2 + 9 x = y 2
Now what do you add to a square number to form another square number? A triangular number!
We can deduce 9x is the (x+1)th triangular number, because it's the amount that's wrapped around the initial square.
So now we can form the expression: 2 n 2 + n = 9 n
which simplifies to: n 2 − 1 7 n = 0
The solutions are 0 and 17. Since we want the bigger value, we'll roll with 17.
So, x + 1 = 17
x = 1 6
I do not understand the whole solution. Could you explain more? By the way, add a triangular number to a square number does not always equal a square number.
Let r = gcd(x,y), so that x = ar, y = br with (a,b) = 1. Substituting, (a^2)(r^2) + 9(at) = (b^2)(r^2). Dividing by r, ra^2 + 9a =rb^2. Since (a,b) =1, a|r. Let r = ac. Then ca^3 + 9a = acb^2. Dividing by a, ca^2 + 9 =cb^2. Hence, c = 1,3, or 9. If c = 1, a^2 + 9 = b^2, b^2 - a^2 =9, and (b - a)(b + a) = 9, so b -a =1, b+ a = 9, 2b= 10, b =5, a =4, r=ca = 4, x= ar = 16.Repeating the calculation for c = 3 or c = 9 results in smaller values for x. Ed Gray
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Quadratic Diophantine Equations - Solve by Factoring
x 2 + 9 x = t x 2 + 9 x = t 2 ( x + 2 9 ) 2 − 4 8 1 = t 2 ( 2 x − 2 t + 9 ) ( 2 x + 2 t + 9 ) = 8 1 ⎩ ⎪ ⎨ ⎪ ⎧ 2 x − 2 t + 9 = 1 2 x + 2 t + 9 = 8 1 or ⎩ ⎪ ⎨ ⎪ ⎧ 2 x − 2 t + 9 = 3 2 x + 2 t + 9 = 2 7 or ⎩ ⎪ ⎨ ⎪ ⎧ 2 x − 2 t + 9 = 9 2 x + 2 t + 9 = 9 ⎩ ⎪ ⎨ ⎪ ⎧ x = 1 6 t = 2 0 or ⎩ ⎪ ⎨ ⎪ ⎧ x = 3 t = 6 or ⎩ ⎪ ⎨ ⎪ ⎧ x = 0 t = 0
Since x needs to be maximized, the answer is 1 6 .