3 x 3 + y 3 + x y = 2 0 0 7
Let there be n unordered positive integral solutions to the above equation. Call these solutions ( x 1 , y 1 ) , ( x 2 , y 2 ) , … , ( x n , y n ) . Find the value of
i = 1 ∑ n x i y i .
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.
Good solution. Used the same approach. Just a minor addition, you do not really need to check for all 3 6 pairs X , Y ∈ { 1 , 2 , ⋯ , 6 } , since it can be easily verified from the equation that g cd ( X , Y ) = 1 . Also, the solutions need to be unordered. So there are really 1 1 pairs that need to be checked: { ( 1 , 2 ) , ( 1 , 3 ) , ( 1 , 4 ) , ( 1 , 5 ) , ( 1 , 6 ) , ( 2 , 3 ) , ( 2 , 5 ) , ( 3 , 4 ) , ( 3 , 5 ) , ( 4 , 5 ) , ( 5 , 6 ) }
Log in to reply
True but, to be honest, it is simpler to drag out a 6x6 array of formulae in Excel than to take time to determine which combinations are redundant!
Log in to reply
Yes, that is true since the size is only 6x6, but or larger sizes, it might be helpful to check the redundant pairs. Anyway, good solution.
Sorry for the confusing typo, everyone!
We use the factorisation x 3 + y 3 + z 3 − 3 x y z = ( x + y + z ) ( x 2 + y 2 + z 2 − x y − y z − z x ) .
3 x 3 + y 3 + x y x 3 + y 3 + 3 x y x 3 + y 3 + ( − 1 ) 3 − 3 x y ( − 1 ) ( x + y − 1 ) ( x 2 + y 2 + 1 − x y + x + y ) ( x + y − 1 ) ( ( x + y − 1 ) 2 − 3 x y − 3 x − 3 y ) = 2 0 0 7 = 6 0 2 1 = 6 0 2 0 = 6 0 2 0 = 2 2 × 5 × 7 × 4 3
Since the RHS ≡ 2 ( m o d 3 ) , the LHS must also be ≡ 2 ( m o d 3 ) . Thus, we must have x + y − 1 ≡ 2 ( m o d 3 ) . All positive factors of 6020 that are equivalent to 2 ( m o d 3 ) are 2 , 5 , 1 4 , 2 0 , 3 5 , 8 6 , 1 4 0 , 2 1 5 , 6 0 2 , 8 6 0 , 1 5 0 5 and 6 0 2 0 . By observation, we get that only x + y − 1 = 2 0 satisfies, with x = 1 8 , y = 3 or vice-versa. Thus, x y = 5 4 .
I bashed my way out by limiting and got the solution as (18,3), I didn't see the summation though and clicked view solution after 21 failed
I'm so screwed atm ._.
This is from Titu's book right
Log in to reply
Yeah, but I found it quite interesting and showed an easy way to prove something which would be ugly otherwise.
Log in to reply
Which book, anyone?
Log in to reply
@Mehul Arora – Introduction to Diophantine Equations, Titu et al
Transform the equation first:
3 x 3 + y 3 + x y = 3 ( x + y ) ( x 2 − x y + y 2 ) + x y = 3 ( x + y ) ( ( x + y ) 2 − 3 x y ) + x y = 3 ( x + y ) 3 − 3 x y ( x + y ) + x y = 2 0 0 7
Let:
m n = x + y = x y
Now we have:
3 m 3 − 3 m n + n 3 m 3 − m n + n 3 m 3 + n ( 1 − m ) 3 m 3 − 2 0 0 7 3 ( m − 1 ) m 3 − 6 0 2 1 = 2 0 0 7 = 2 0 0 7 = 2 0 0 7 = n ( m − 1 ) = n
Since n has to be a positive integer, it must be that:
m 3 > 6 0 2 1 ⇒ m > 1 8 .
Also by known inequality:
x y n 3 ( m − 1 ) m 3 − 6 0 2 1 3 m 3 − 6 0 2 1 4 m 3 − 2 4 0 8 4 m 3 + 3 m ≤ 4 ( x + y ) 2 ≤ 4 m 2 ≤ 4 m 2 ≤ 4 m 3 − m ≤ 3 m 3 − 3 m ≤ 2 4 0 8 4
Knowing that 3 0 3 = 2 7 0 0 0 and by testing, we find that: m < 2 9 .
Having that: 3 ∣ m 3 − 6 0 2 1 and 3 ∣ 6 0 2 1 it must be that 3 ∣ m 3 ⇒ 3 ∣ m . So, m can be either 2 1 , 2 4 , or 2 7 . By replacing m with each of these numbers, we can conclude that n is integer only if m = 2 1 ( n = 5 4 ) , which means there is only one unordered pair of integers x and y that satisfies the starting equation. We were asked to find the sum of products of all such pairs, and knowing that there is only one of them, the solution is n = x y = 5 4
Problem Loading...
Note Loading...
Set Loading...
Since a 3 ≡ a modulo 3 for all integers a , and since x 3 + y 3 must be a multiple of 3 , it follows that x + y ≡ 0 modulo 3 . If, for example, x ≡ 1 and y ≡ 2 modulo 3 , then 3 1 ( x 3 + y 3 ) + x y ≡ 2 modulo 3 , and hence cannot be equal to 2 0 0 7 . Thus it follows that x , y must both be multiples of 3 . Writing x = 3 X , y = 3 Y , we need to solve X 3 + Y 3 + X Y = 2 2 3 for positive integers X , Y . But then 1 ≤ X , Y < 3 2 2 3 < 7 , so there are only 3 6 cases to check. The only (unordered) pair that works is { X , Y } = { 1 , 6 } , so that { x , y } = { 3 , 1 8 } , and hence the answer is 5 4 .
We could be really basic, and note that, in the original problem, we must have x , y ≤ 3 3 × 2 0 0 7 , so that 1 ≤ x , y ≤ 1 8 . A simple Excel calculation can test the 3 2 4 cases.