How many ordered sets of integers ( x , y ) are there such that there exists a (positive) prime number p satisfying x ( x + y ) = 2 ( y 2 + 1 5 p ) ?
This problem is posed by Ahmad .
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.
A million times better than my solution.Excellent!
May I know what the symbol at the last line mean? Thanks
Log in to reply
You mean the tau τ ? I use it to denote the number of positive divisors of n . In this case it was 2 τ we needed, because we wanted to account for negative divisors as well :)
Log in to reply
Ohhh sorry I have read wrongly! Thank you for the wonderful solution! Voted up!
Log in to reply
@Fan Zhang – No problem, I'm glad you like it :)
That's similar to what I did; however, instead of setting the expression equal to h and k, I just manually computed each pair (just for safety)
We expand, and write as a quadratic in y : 2 y 2 − x y + ( 3 0 p − x 2 ) = 0 Using the quadratic formula, y = 4 x ± 9 x 2 − 2 4 0 p Now, note that 9 x 2 − 2 4 0 p = 3 ( 3 x 2 − 8 0 p ) must be a square. Therefore, since 3 divides it, 9 must too, and so p = 3 . y = 4 x ± 3 x 2 − 8 0 Let x 2 − 8 0 = k 2 . We have that ( x − k ) ( x + k ) = 8 0 We know that 8 0 = 1 ⋅ 8 0 = 2 ⋅ 4 0 = 4 ⋅ 2 0 = 5 ⋅ 1 6 = 8 ⋅ 1 0 , and also we know that the sum of x − k + x + k = 2 x is even, and so we can divide 80 into 2 and 40, 4 and 20, or 8 and 10. From this we get that x = ± 9 , ± 1 2 , ± 2 1 . It is easy to find which values of x give integer values of y , and our solutions are:
( − 2 1 , 9 ) , ( − 1 2 , − 9 ) , ( − 1 2 , 3 ) , ( − 9 , − 3 ) , ( 9 , 3 ) , ( 1 2 , − 3 ) , ( 1 2 , 9 ) , ( 2 1 , − 9 )
The answer is 8 .
Good use of the discriminant to quickly conclude that p = 3 .
why 3, why not 6 or any 3k?
Expanding and rearranging gives the equation in the form
3 0 p = x 2 + x y − 2 y 2
which can be factorised as
3 0 p = ( x + 2 y ) ( x − y )
Now, either ( x + 2 y ) or ( x − y ) must have a factor of 3 , since there is a factor of 3 in the LHS; however:
( x + 2 y ) = ( x − y ) + 3 y
So if one of them is divisible by 3 , then so is the other, since they differ by a multiple of 3 . This means that there must be an extra multiple of 3 on the LHS. The only way this can happen is if p = 3 - no other value of p is possible.
Then we have:
9 0 = ( 2 y + x ) ( x − y )
Each of the brackets has exactly one factor of 3 , so subject to that restriction there are 8 ways to split 9 0 into the two factors ( x + 2 y ) , ( x − y ) -
( ± 3 , ± 3 0 ) ( ± 3 0 , ± 3 ) ( ± 6 , ± 1 5 ) ( ± 1 5 , ± 6 )
These each give the only unique values of x , y that work. At this point we can say, after verifying that every pair above gives integer solutions, that there are 8 possible pairs x , y , which are:
( 2 1 , − 9 ) , ( − 2 1 , 9 ) , ( 1 2 , 9 ) , ( − 1 2 , − 9 ) , ( 1 2 , − 3 ) , ( − 1 2 , 3 ) , ( 9 , 3 ) , ( − 9 , − 3 )
Nice approach of expressing 3 0 p as the product of several terms, which gives us control over what they are.
Quick,what makes a prime number different from others?The fact that it always has only 2 positive divisors!So,what if,what if,we can turn our solution into something of the form
a b = p where a , b are integers and p is a prime.
Then,if a and b are integers,then we have only 8 possible ordered pairs,counting negatives of course.So we want to keep p on the right side only.Now let's look at the problem at hand.
x ( x + y ) = 2 ( y 2 + 1 5 p )
We expand,and keep p on the left side.
x 2 + x y + 2 y 2 = 3 0 p
and now we try to factorize the left side.We try completing the square.
x 2 − 2 x y + y 2 − 3 y 2 + 3 x y = 3 0 p ⟹ ( x − y ) 2 + 3 y ( x − y ) = 3 0 p ⟹ ( x − y ) ( x + 2 y ) = 3 0 p
Ha!I know this isn't exactly the same as what we wanted.But it's good enough.Now,suppose that x − y = m , x + 2 y = n where m and n are integers.Solving the equation gives us y = 3 n − m .But since y must be an integer,, n − m i.e. difference of the two factors must be divisible by 3.Now,we come back to our original equation.
( x − y ) ( x + 2 y ) = 3 0 p
We sort by Values of x − y and x + 2 y .But recall that the difference of the factors must be divisible by 3.For example,if x − y = ± 2 , x + 2 y = ± 1 5 p ,then there is no prime p such that the difference of the factors is divisible by 3.So this lets us eliminate some possibilities.Now we do the tedious part.We are going to count unordered pairs,not ordered pairs.
1 ) ( ± 3 0 , ± p ) , 2 ) ( ± 2 p , ± 1 5 ) , 3 ) ( ± 6 , ± 5 p )
For each of these,only p = 3 works,which is obvious.However the pairs (2) and (3) are equivalent,after putting in p = 3 since they yield the same equations.Now,we are left with 2 values. sighs
( x − y , x + 2 y ) = ( ± 3 0 , ± p ) , ( ± 2 p , ± 1 5 ) and
( x + 2 y , x − y ) = ( ± 3 0 , ± p ) , ( ± 2 p , ± 1 5 )
This gives us 8 solutions.
One doesn't need to scroll to the right apart from once.
I was feeling lazy after typing this.So there might be some inadvertent typos.
Also,when I say "we are going to count unordered pairs",I mean that we are going to count unordered pairs for the time being and later count all the ordered pairs.
When I say "..we keep p on the left side",I mean that we are going to keep p on the right side.
Can you make it more clearer?
Log in to reply
If you can please specify the parts that you find unclear,then I will be happy to clarify.
x(x + y) = 2(y^2 + 15p) => 30p = x^2 + xy - 2(y^2) = (x - y)(x + 2y) => (x - y)(x + 2y) = 2 * 3 * 5 * p
Let (x - y) = a and (x + 2y) = b where a and b are also integers. We get x = (2a + b)/3 and y = (b - a)/3.
As ab = 2 * 3 * 5 * p, one of a and b would be divisible by 3. If a is divisible by 3, we get x = 2k1 + (b/3) and y = (b/3) - k1. If b is divisible by 3, we get x = {(2a)/3} + k2 and y = k2 - (a/3).
Thus, we find that b in the first case and a in the second case also have to be divisible by 3 for x and y to be integers. This can only happen when the prime p is nothing but 3.
Therefore, we get (x - y)(x + 2y) = 2 * 3 * 5 * p = 2 * 3 * 5 * 3 = 90. 90 = 1 * 90 = 2 * 45 = 3 * 30 = 5 * 18 = 6 * 15 = 9 * 10
The equations we need to solve to determine integral values of x and y are: (x - y) = {-30, - 15, -6, - 3, 3, 6, 15, 30} with the corresponding (x + 2y) = {-3, - 6, - 15, - 30, 30, 15, 6, 3} So, there are 8 ordered set of integers.
Solving for all the possible pairs of equations, we get (x, y) = {(-21, 9), (-12, 3), (-9, -3), (-12, -9), (12, 9), (9, 3), (12, -3), (21, -9)}.
We have:
x ( x + y ) = 2 ( y 2 + 1 5 p ) < = > x 2 − y 2 + x y − y 2 = 3 0 p < = > ( x − y ) ( x + y ) + x ( x − y ) = 3 0 p < = > ( x − y ) ( x + 2 y ) = 3 0 p ( 1 )
So /(30p/) is the product of ( x − y ) and ( x + 2 y ) . Let a and b be positive integers such that a × b = 3 0 p . From (1) we get two equations:
x + 2 y = b
x − y = a
( 2 )
The difference gives:
− 3 y = a − b < = > a + 3 y = b < = > 3 ( 3 a + y ) = b
Because b is an integer 3 a + y must be an integer too therefore 3 divides both a and b. Now (2) has exactly one solution (x,y) so the number of possible values a or b can take is the how many ordered sets of integers (x,y) satisfy the parameters given in the problem. We List the possibilities ( a , b ) : ( 3 , 1 0 p ) , ( 6 , 5 p ) , ( 1 5 , 2 p ) , ( 3 0 , p ) , ( p , 3 0 ) , ( 2 p , 1 5 ) , ( 5 p , 6 ) , ( 1 0 p , 3 ) . Hence the answer is 8.
Rearranging the equation as x 2 − y 2 + x y − y 2 = 3 0 p , we see the LHS factors to ( x − y ) ( x + 2 y ) . The difference between x + 2 y and x − y is 3 y . Since the RHS is a multiple of 3, either x + 2 y or x − y must be a multiple of 3, but since their difference is 3 y , we see that both x + 2 y AND x − y have to be multiples of 3, so 3 0 p must be a multiple of 9, and the only prime p that satisfies this is p = 3 .
We are now seeking how many ordered sets of integers ( x , y ) that satisfy: ( x − y ) ( x + 2 y ) = 9 0 . 90 can be factored into two multiples of 3 in the following ways: 3 * 30, 6 * 15. However, note that we can have both factors be negative, and we also have 2 ways to assign each factor to being either x + 2 y or x − y . Thus, there are 2 * 2 * 2 = 8 total ordered pairs that work.
We can rearrange Ahmad's equation to obtain 3 0 p = ( x − y ) ( x + 2 y ) . Setting a = x − y yields 3 0 p = a ( a + 3 y ) , whence 3 0 p = a 2 + 3 a y . (1)
Since the left hand side of this equality is divisible by 3, so is the right hand side, and so 3 ∣ a 2 , which shows that 3 ∣ a . In other words, a = 3 k for some integer k . By substitution on (1), we get 3 0 p = 9 k 2 + 9 k y . (2)
We can therefore conclude that 9 ∣ 3 0 p , and since p is a prime, p = 3 . Replacing and simplifying from (2), we get 1 0 = k 2 + k y or, equivalently, 1 0 = k ( k + y ) .
Finding the solutions of the problem now ammounts to studying all possible factorizations of 10 (which are 8, if we allow negative factors). Each one will yield a distinct solution to Ahmad's equation.
The quadratic formula gives us x = 2 1 × ( − y ± 3 ( 4 0 p + 3 y 2 ) ) .
Since x is an integer, 3 ( 4 0 p + 3 y 2 ) must be a perfect square. This can only be true if 4 0 p + 3 y 2 has a factor of 3. Suppose p = 3 . Then p must be congruent to either 1 or 2 modulo 3 (as otherwise it would be divisible by 3, and either be 3, or a non-prime). Now 3 y 2 is obviously congruent to zero mod 3, and thus the entire expression is congruent to either 1 or 2 mod 3, i.e. does not have 3 as a factor. But then 3 ( 4 0 p + 3 y 2 ) cannot be a perfect square. Thus by contradiction, we have p = 3 .
By substitution we have x = 2 1 × ( − y ± 3 4 0 + y 2 ) . Now 4 0 + y 2 is only a perfect square for y = ± 3 and y = ± 9 - this may be verified with casework, or by observing that the difference between two adjacent squares follows the odd numbers. Thus obtaining a difference of 4 0 by adding up consecutive odd numbers can only be done by adding 7 + 9 + 1 1 + 1 3 or 1 9 + 2 1 , and these are the differences between 3 2 and 7 2 , and 9 2 and 1 1 2 respectively.
Hence we have four values of y . Each value of y clearly gives two solutions for x , and these values will all be integers. This is apparent as y is odd in all cases, and 3 × 4 0 + y 2 is the product of two odd numbers and thus odd - hence, adding them together or subtracting one from another will always give an even number. Thus, the multiplication by 2 1 is safe and will leave all of the solutions for x safely as integers. (Admittedly, it is probably easier to simply verify this with a substitution.)
Thus the answer is 4 × 2 = 8 .
We have x ( x + y ) = 2 ( y 2 + 1 5 p ) ⇒ x 2 + x y − 2 y 2 = 3 0 p ( ∗ ) ⇔
( x + 2 y ) ( x − y ) = 3 0 p ⇒ 3 ∣ x + 2 y or 3 ∣ x − y ⇒ 3 ∣ x + 2 y , x − y since that x − y ≡ x + 2 y ( m o d 3 )
where 9 ∣ ( x − y ) ( x + 2 y ) ⇒ 9 ∣ 3 0 p ⇒ 3 ∣ 1 0 p ⇒ 3 ∣ p ⇒ p = 3 since that p is a prime number and m d c ( 1 0 , 3 ) = 1
Now, by ( ∗ ) and p = 3 ∣ x + 2 y , x − y we have 3 x + 2 y ∗ 3 x − y = 1 0 ⇔ ( ∗ ∗ ) f ∗ g = 1 0 , f = 3 x + 2 y , g = 3 x − y integers and explicitly x = 2 g + f , y = f − g .
Then every solution of ( ∗ ∗ ) is a solution of ( ∗ ) and contrariwise.
Thus and the number of solutions of ( ∗ ∗ ) is the number of integers divisors of 1 0 . How d ( 1 0 ) = 8 , we have 8 solutions.
The given equation is equivalent to x 2 + x y − 2 y 2 = ( x + 2 y ) ( x − y ) = 3 0 p = a b , where a = x + 2 y and b = x − y . This implies 3 ∣ a b and since 3 is prime, it follows that 3 ∣ a or 3 ∣ b . Assume that 3 ∣ a . Since a − b = 3 y , we have 3 ∣ ( b − a ) . Hence 3 ∣ ( ( b − a ) + a ) or 3 ∣ b . Similarly, if 3 ∣ b , then 3 ∣ a . Since 3 0 p factors into primes as 2 ⋅ 3 ⋅ 5 ⋅ p if p = 3 , then 3 would be a factor of either a or b but not both, contradicting to the previous argument we have just made. Therefore, p = 3 and 3 is a common factor of a and b . This implies we have only 4 possible set equations, namely { x + 2 y , x − y } = { 6 , 1 5 } , { − 6 , − 1 5 } , { 3 , 3 0 } , or { − 3 , − 3 0 } . Each set equation gives two possible systems of equations, each producing an integer solution ( x , y ) . Hence there is a total of 4 × 2 = 8 pairs ( x , y ) of integers satisfying the given equation.
Expand and rearrange to get: 3 0 p = x 2 + x y − 2 y 2 = ( x − y ) ( x + 2 y )
Let a = x − y , b = x + 2 y . Then a b = 3 0 p and 2 a + b = 3 x (or b − a = 3 y ). The first equality implies that at least one of a , b is divisible by 3. The second equality then restricts that both a and b are divisible by 3, for x (similar, y ) to be an integer. Then the first equality again implies that p = 3 .
So a b = 9 0 , 3 ∣ a , 3 ∣ b . There are 8 choices:
and the negative versions (that is, a ′ = − a , b ′ = − b , x ′ = − x , y ′ = − y ) of each of the four cases above.
Therefore, there are 8 choices for ( x , y ) that work.
solve for the left and right sides thus,
x 2 + xy = 2 y 2 + 30p
then,
x 2 + xy - 2 y 2 = 30p
using factoring,
(x + 2y)(x - y) = 30p
now, we know that the two solutions of x and y on both factors and disregarding the 'p".. thus,
(x + 2y) or (x - y)
x = 1 and y = 30 or x = 2 and y = 15 or x = 3 and y = 10 or x = 5 and y = 6 or
x = 6 and y = 5 or x = 10 and y = 3 or x = 30 and y = 1
that are 8 values
Equation is equivalent to (x+2
y)
(x-y)=30
p.
Some of left side multiplicants should divide by 3, but then the other divedes too, so 30
p divedes by 9, so p = 3.
Denote x-y=3
z. Then z
(z+y)=10, z may be any divisor of 10 (there are eight of them), y=10/z-z, x=10/z+2*z.
Problem Loading...
Note Loading...
Set Loading...
We have p = 3 0 x 2 + x y − 2 y 2 = 3 0 ( x − y ) ( x + 2 y ) Now, since x − y and x + 2 y are congruent modulo 3, and 30 divides their product, both x − y and x + 2 y are multiples of 3. Let x − y = 3 k , x + 2 y = 3 h . But then p = 3 1 0 h k ⟹ 3 ∣ p ⟹ p = 3 and h k = 1 0 Since for every ordered pair ( h , k ) we find exactly one ordered pair ( x , y ) = ( 2 k + h , h − k ) with an injective map, we just need to count the number of distinct ordered pairs ( h , k ) of integers with the property that h k = 1 0 . This number is 2 ⋅ τ ( 1 0 ) = 8 .