How many ordered pairs of positive integers ( x , y ) satisfy
x 2 + 1 0 ! = y 2 ?
This problem is posed by Kwesi L.
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.
It is a lovely problem.
Shouldn't it be ( y − x ) ( x + y )
nice good job
I forget to divide it by 2. So, the answer showed wrong when I put 210. Thanks for the last case
1 0 ! = ( y − x ) ( y + x ) So we have two factors, both even because we cannot have odd x even or odd x odd. 1 0 ! = 2 8 ⋅ 3 4 ⋅ 5 2 ⋅ 7 y − x = 2 a ⋅ d 1 and y + x = 2 b ⋅ d 2 where a , b > 0 and d 1 , d 2 are divisors of 2 8 1 0 !
How many divisors?: 5 ⋅ 3 ⋅ 2 (the exponents are 4 , 2 , 1 )
In how many ways can we choose a ?: 7 because 0 < a < 8
The solution is 2 7 ⋅ 5 ⋅ 3 ⋅ 2 = 1 0 5 because y > x .
Rearrange the equation we will get:
1 0 ! = y 2 − x 2
1 0 ! = ( y + x ) ( y − x )
Obviously, 1 0 ! is an even number, then ( y + x ) and ( y − x ) both will also be even numbers
1 0 ! = 2 8 × 3 4 × 5 2 × 7
The number of solutions to express 1 0 ! as a product of two EVEN numbers (including symmetries, for example: 2 × 3 and 3 × 2 are counted as two solutions) are
S e v e n ( 1 0 ! ) = 7 × 5 × 3 × 2 = 2 1 0
7 is used instead of 9 because:
1) The number must be even, so 2 0 is removed.
2) The other number must be even too! Remember to share, so another 2 is removed
Next, we handle about the symmetry problem. ( x + y ) and ( x − y ) will not be symmetries as both x and y are positive integers in this case, so the number of solutions (that included symmetry) should be divide by 2, which left 2 2 1 0 = 1 0 5 solutions.
Now, we have 105 ways to express 1 0 ! as a product of two even numbers (excluded symmetries). For each ways, there exist only 1 ordered pair of ( x , y ) .
Thus, we get the answer 1 0 5 .
I HAVE TWO DOUBTS.PLEASE HELP ME CLEAR THOSE;
1) WHY YOU USED 7 INSTEAD OF 9
2) WHY YOU DIVIDED THE TOTAL(210 BY 2
Log in to reply
First, you can learn the technique [Divisor of an integer] in Brilliant.org
The 9 means there are 9 possibility to select the power of 2, which is from 0 to 8, as the first product of 1 0 ! .
However, in this case that the first product ( x + y ) must be even, and an even number must at least has a divisor of 2, so the possibility of selecting 2 0 = 1 is cancelled. Next, the other product ( x − y ) must be even too, so it should have at least one divisor of 2 as well. So in the first product ( x + y ) we must give out a 2 divisor. In the end, we left only 7 (the power of 2 are from 2-8 left).
2) An example: 6 = 6 × 1 = 3 × 2 = 2 × 3 = 1 × 6 total of 4 ways. Among these 4 ways, half of them are just different in arrangements 3 × 2 and 2 × 3 . In this case, we cannot have different arrangements because x + y > x − y , there are only 1 arrangement for each ways of express 1 0 ! as a product of two integers.
Hope you can understand =) and I will improve my solution writing skill
The sketch of my solution
The x 2 and 1 0 ! doesn't look good together so first I shift it to the R.H.S. which I can then factorize.
Now we have, 1 0 ! = ( y + x ) ( y − x )
Now I'd write 10! as 2 8 × 3 4 × 5 2 × 7 so that I can clearly see what is really going on. (It's is fairly easy to prime factorize 10!)
Thus we have, 2 8 × 3 4 × 5 2 × 7 = ( y + x ) ( y − x )
We are now done with simplifying the expression.
Now y + x and y − x are both integers since y,x are both integers, Assume that y + x = a and y − x = b ,[notice that a>b]
Solving for y we get, y = 2 a + b
Since y is integer then a,b must be of same parity. Both a,b can't be simultaneously odd since a × b = 1 0 !
Thus a,b both are even.
(I could choose to solve for x but that'd have given us the same information,ie. a and b are even)
Now our problem is reduced to determine the number of ways to distribute the prime factors 2 8 × 3 4 × 5 2 × 7 to two even parts.
Since both a,b are even we first give them what they crave for, ie. the factor 2 .
Now we are left with 2 8 − 2 × 3 4 × 5 2 × 7 = 2 6 × 3 4 × 5 2 × 7
Whenever I break this number into two factors,we'd get two different numbers since there is only one 7 in it.
Thus whenever I break the number I'd assign the larger number to a and the smaller one to b since a>b.
The problem is simply reduced to this--
In how many ways can 2 6 × 3 4 × 5 2 × 7 be written as product of two numbers where a × b is the same as b × a . ?
This is really easy to solve,we count the number of factors of 2 8 × 3 4 × 5 2 × 7 and divide by 2 as we counted each pair twice.
Thus we get the answer 1 0 5
I think you mean 2^6 instead of 2^8 in the last prime factorisation.
First of all:
1 0 ! = y 2 − x 2 = ( y + x ) ( y − x ) .
We can carefully factorize 1 0 ! to 2 8 ∗ 3 4 ∗ 5 2 ∗ 7 . If we want to find the quantity of divisors of this, we know that for number 2 we have 8 diferent values (as we have 2 8 ), 4 different ones for 3 , 2 for 5 and 1 for 7 . But we need all the divisors, so every quantity of prime factors counts. We make the sum 8 + 4 + 2 + 1 + 8 ∗ 4 + 8 ∗ 2 + 8 ∗ 1 + 4 ∗ 2 + 4 ∗ 1 + 2 ∗ 1 + 8 ∗ 4 ∗ 2 + 8 ∗ 4 ∗ 1 + 8 ∗ 2 ∗ 1 + 4 ∗ 2 ∗ 1 + 8 ∗ 4 ∗ 2 ∗ 1 (we can do it manually and carefully), and this gives us a total of 2 6 9 . We sum 1 more, because we need to include the 1 as a factor, and 1 0 ! has 2 7 0 divisors.
Now, note that 1 0 ! is even, and it is expressed as a square difference. We know that ( y + x ) − ( y − x ) is of the form 2 k (the difference is even). So, we need to exclude the odd factors, because they are forced to be accompanied with an even factor (because odd * odd = odd, and 1 0 ! is even). The odd factors, clearly, are among 3 4 ∗ 5 2 ∗ 7 . With the same idea we found the total of divisors of 1 0 ! , we find that the odd divisors (including 1 ) are a total of 3 0 . As all of them will be accompanied with an specific factor, we need to exclude 3 0 ∗ 2 = 6 0 factors from the 2 7 0 we've calculated. So, we get 2 1 0 factors that can be expressed as a difference of squares with a specific partner. As we are looking for the pairs, the final answer is 2 1 0 / 2 = 1 0 5 .
Problem Loading...
Note Loading...
Set Loading...
Rewrite the expression as y 2 − x 2 = 1 0 ! and factorize into ( x − y ) ( x + y ) = 2 8 3 4 5 2 7 For x and y to be integers we must have the parity of ( x + y ) and ( x − y ) be the same. Since at least one has a factor of 2 , they both have a factor of 2 . We must then distribute the remaining factors of 2 , 3 , 5 , and 7 among ( x + y ) and ( x − y ) .
We have 2 6 3 4 5 2 7 left after giving each term a factor of 2 . Each term can have between 0 and 6 factors of 2 , 0 and 4 factors of 3 , 0 and 2 factors of 5 , and 0 and 1 factors of 7 , so there are in total 7 × 5 × 3 × 2 = 2 1 0 factors to distribute.
We must have x and y positive, so we must have ( x + y ) ≥ ( x − y ) . Since 2 6 3 4 5 2 7 is not a perfect square, for every factor a there is an unequal factor b such that a b = 2 6 3 4 5 2 7 , there are 2 2 1 0 = 1 0 5 such pairings ( a , b ) and for each pairing we assign the greater factor to ( x + y ) Each assignment is valid and gives unique values x and y , so the number of ordered pairs ( x , y ) = 1 0 5
Shoutouts to Kwesi for the problem