How many ordered pairs of positive integers ( x , y ) satisfy
x 2 + 1 0 ! = y 2 ?
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.
Want to cry :'( my method was just like yours but i made badly a division, please, name it after me: 10/5=1
Log in to reply
That's too bad! :( At least you had the right method, which is what really counts, although it definitely hurts when a little mistake prevents you from getting the right number, (a feeling I know all too well).
I really love questions like this (combines 2 topics in maths). Combinations and number theory in this case. Great question!
Log in to reply
Thank you very much! @Julian Poon
If you liked this, you can also see more like these here
Sir i am not getting,
why did you ignored 7 for a moment in step 3 ? @brian charlesworth , can't we do it without ignoring 7 ?
Log in to reply
1 0 ! = 1 0 ∗ 9 ∗ 8 ∗ 7 ∗ 6 ∗ 5 ∗ 4 ∗ 3 ∗ 2 ∗ 1 =
( 2 ∗ 5 ) ∗ ( 3 2 ) ∗ ( 2 3 ) ∗ 7 ∗ ( 2 ∗ 3 ) ∗ 5 ∗ ( 2 2 ) ∗ 3 ∗ 2 = 2 8 ∗ 3 4 ∗ 5 2 ∗ 7 .
I ignored 7 for a moment because I wanted to avoid duplication in the counting process of the distribution of prime factors to (A) and (B). The factor of 7 is what will always make (A) distinct from (B), which is why I waited until the last step to factor it in.
Log in to reply
Ok thank you , understood, any general method to find the factorization of huge numbers such as 1729! , 1000! ,100! etc .
Log in to reply
@U Z – Factoring large numbers into their prime components is generally quite difficult, and there is no general algorithm to do it. For factorials, however, we do have Legendre's Theorem to help us. Using the notation in the link, for 1 0 0 ! we would have
ν 2 ( 1 0 0 ! ) = ∑ k = 1 ⌊ 2 k 1 0 0 ⌋ = 5 0 + 2 5 + 1 2 + 6 + 3 + 1 = 9 7 .
We would then have to do this for all primes up to 9 7 , which would be tedious but within reason. :)
We can rewrite the expression as ( y + x ) ( y − x ) = 2 8 ⋅ 3 4 ⋅ 5 2 ⋅ 7 . Notice that both factors must be even because otherwise, after finding both factors, we would have 2 y = e v e n + o d d so y = o d d / 2 and you know that then y wouldn't be positive integer. So this shows that both ( y + x ) and ( y − x ) must be even, so we distribute one 2 to each. Then we can distribute the prime factorization 2 6 ⋅ 3 4 ⋅ 5 2 ⋅ 7 1 to both factors, but in how many ways? Well, we have 7 ⋅ 5 ⋅ 3 ⋅ 2 = 2 1 0 ways of distributing them (remember, we're distributing to the factors ( y + x ) and ( y − x ) ). But why this is not the answer, and is 1 0 5 ? There are to important ordered pairs ( ( y + x ) , ( y − x ) ) , that we should see. The first one: When y + x = 2 3 ⋅ 3 2 ⋅ 5 ⋅ 7 , then y − x = 2 3 ⋅ 3 2 ⋅ 5 and here we yet have x , y > 0 . But the second one: When y + x = 2 3 ⋅ 3 2 ⋅ 5 , then y − x = 2 3 ⋅ 3 2 ⋅ 5 ⋅ 7 . Well, if we put the 2 1 0 combinations in order of decreasing y + x , this would be the transition from the 1 0 5 t h ordered pair to the 1 0 6 t h ordered pair. For the 1 0 6 t h , notice that y − x > y + x so x < − x , and hence, x ≤ 0 . So we have 1 0 5 ordered pairs (x, y) that satisfy the equation.
PD.: I'm so excited, it has been a while since i dont enter to brilliant and i was able to make this problem in my mind :').
Same as I did!
Problem Loading...
Note Loading...
Set Loading...
Rewrite the equation as y 2 − x 2 = 1 0 ! ⟹ ( y − x ) ( y + x ) = 1 0 ! .
So ( y − x ) and ( y + x ) must be co-factors of 1 0 ! . Also, since they both have the same parity, (i.e., they will be either both even or both odd, (as y + x = ( y − x ) + 2 x )), and since 1 0 ! is even, both ( y − x ) and ( y + x ) must be even.
Now 1 0 ! = 2 8 ∗ 3 4 ∗ 5 2 ∗ 7 . After distributing a factor of 2 to each of ( y − x ) and ( y + x ) , we are left with 2 6 ∗ 3 4 ∗ 5 2 ∗ 7 . Ignoring the 7 for the moment, we note that there are 7 ∗ 5 ∗ 3 = 1 0 5 divisors of 2 6 ∗ 3 4 ∗ 5 2 , each of which is of the form
2 a ∗ 3 b ∗ 5 c , where 0 ≤ a ≤ 6 , 0 ≤ b ≤ 4 , 0 ≤ c ≤ 2 .
For a given a , b , c , form two numbers as follows:
(A) 2 a + 1 ∗ 3 b ∗ 5 c ∗ 7 and (B) 2 7 − a ∗ 3 4 − b ∗ 5 2 − c .
In this way we have formed distinct, even co-factors of 1 0 ! , (distinct because of the factor 7 in (A)). As they are distinct, we can assign the lesser of the two to ( y − x ) and the greater to ( y + x ) . As they are both even we can then solve for a unique, ordered, positive integer pair ( x , y ) .
As there are 1 0 5 ways in which to construct the pair ((A), (B)), there will thus be 1 0 5 ordered, positive integers pairs ( x , y ) satisfying the given equation.