How many trailing zero(s) are there in the constant term of ( x + x 1 ) 2 0 1 4 ?
Details and Assumptions :
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.
Note: You can use Kummer's Theorem , which is an extension of Lucas' Theorem, to determine what power of 2 and 5 divides a binomial coefficient. In this case, we can show that 5 divides it, but not 25.
Log in to reply
wow. nice theorem. where i can get the collection of all useful theorem?
This is going to be a long ride,so sit back and enjoy. Let us start by expanding ( x + x 1 ) 2 0 1 4 .We will do this using the binomial theorem: ( x + x 1 ) 2 0 1 4 = ( 0 2 0 1 4 ) ∗ x 2 0 1 4 ∗ ( x 1 ) 0 + ( 1 2 0 1 4 ) ∗ x 2 0 1 3 ∗ ( x 1 ) 1 . . . . ( 2 0 1 3 2 0 1 4 ) ∗ x 1 ∗ ( x 1 ) 2 0 1 3 + ( 2 0 1 4 2 0 1 4 ) ∗ x 0 ∗ ( x 1 ) 2 0 1 4 . Now,because we want a constant term there shouldn't be any x in it.Now,because x and x 1 are reciprocals they will cancel each other but in the expansion above x and x 1 have the same power only once and that is 1 0 0 7 .The term is: ( 1 0 0 7 2 0 1 4 ) ∗ x 1 0 0 7 ∗ ( x 1 ) 1 0 0 7 = 1 0 0 7 ! ∗ 1 0 0 7 ! 2 0 1 4 ! ∗ 1 . Now,find the number of trailing zeroes in the numerator and denominator and we are done.How to find the number of zeroes at the end of n ! : [ 5 n ] + [ 5 2 n ] + . . . . . . Till 5 x < n . Where[] is the greatest integer function.
Constant term wil be 2014 C 1007, 1007 will be derived from laws of exponent, x^(2014-T)*x^(-T) = x^(0), where, 2014-T+(-T) = 0, 2T=2014, then T=2014/2 = 1007. Next, Trailing zero's: Count numbers within factorial divisible by 5, 25, 125, 625 and so on (base 5 divisors):
Consider 2014, divisor 5, max number near 2014 = 2010, so 2010/5= 402 + divisor 25, max number near 2014 = 2000, so 2000/25= 80 + divisor 125, max number near 2014 = 2000, so 2010/125= 16 + divisor 625, max number near 2014 = 1875, so 1875/625= 3 , divisor 3125 > 2014 , so stop. Total No. of trailing zero's = 402 + 80 + 16 + 3 = 501.
Consider 1007, divisor 5, max number near 1007= 1005, so 1005/5= 201+ divisor 25, max number near 1007= 1000, so 1000/25= 40+ divisor 125, max number near 1007= 1000, so 1000/125= 8+ divisor 625, max number near 1007 = 625, so 625/625= 1, divisor 3125 > 1007, so stop. Total No. of trailing zero's = 201+ 40+ 8+ 1 = 250.
Going Back to Constant= 2014C1007 = 2014! / [ (2014-1007)! 1007! ] =2014! / ( 1007! 1007! ) = 2014! / (1007! )^2
Applying de Polignac's formula helps.
I did it like this: The coefficient of the constant term is ( 1 0 0 7 2 0 1 4 ) = 1 0 0 7 ! 2 2 0 1 4 ! = 1 0 0 7 ! 2 0 1 4 ⋅ 2 0 1 3 ⋅ . . . ⋅ 1 0 0 8 After that I looked at the numerator and denominator separately and calculated how many factors with trailing zeroes they have, since these are also the only reason for trailing zeroes in the result. For 2 0 1 4 ⋅ 2 0 1 3 ⋅ . . . ⋅ 1 0 0 8 we can examine the interval 1 0 0 0 to 2 0 1 0 and count how many 1 0 ths, 1 0 0 ths, etc. there are, which also represents the amount of multiplicands with one, two or three zeroes at the end. Doing that, we get 1 0 1 0 1 0 = 1 0 1 1 0 ths, 1 0 0 1 0 1 0 = 1 0 1 0 0 ths, and 1 0 0 0 1 0 1 0 = 1 1 0 0 0 ths. Summing that up we get 1 2 1 zeroes. Analogously with the interval 1 0 0 0 to 2 0 0 0 we get 1 2 0 zeroes, meaning we get something like Y ⋅ 1 0 1 2 0 X ⋅ 1 0 1 2 1 leaving us with only one factor of 1 0 and thus one trailing zero. But I am not really sure if I explained it well or if this is even a valid solution method.
The expression that you must find the number of trailing 0s is c=a/b where a is the product of all x: 1007<x<=2014 and b is the product of all x: 0<x<=1007, you than take the prime factorisation of a and b, and find the difference in the exponents for 5 in a and 5 in b, let us call that i, and than find the difference in the exponents for 2 in a and b, let us call that j. choose either i or j (just take the lower one). I technacly cheated by first trying out a few assumptions as I was too lazy to do the whole method first time, I assumed j to be higher than i so I could just use i.
We have to find {Trailing zeros in 2014! - Trailing zeros in (1007!)^2}
=Trailing Zeros in (1008.1009.....2014) - Trailing zeros in (1.2.3.......1007)
=Trailing Zeros in (8.9..........1014) - Trailing zeros in (1.2.3.......1007) =Trailing Zeros in (1008.1009...1014) =Trailing Zeros in 1010 =1
How you got from here ""=Trailing Zeros in (1008.1009.....2014) - Trailing zeros in (1.2.3.......1007)"" to here ""=Trailing Zeros in (8.9..........1014) - Trailing zeros in (1.2.3.......1007) ""??
Problem Loading...
Note Loading...
Set Loading...
The coefficient of the constant term is ( 2 0 1 4 1 0 0 7 ) = 1 0 0 7 ! 2 2 0 1 4 !
The number of trialing zeros of n ! is given by: z = i = 1 ∑ k ⌊ 5 i n ⌋ , where ⌊ ⋅ ⌋ denotes the floor function .
⟹ z ( 2 0 1 4 ) ⟹ z ( 1 0 0 7 ) = ⌊ 5 2 0 1 4 ⌋ + ⌊ 2 5 2 0 1 4 ⌋ + ⌊ 1 2 5 2 0 1 4 ⌋ + ⌊ 6 2 5 2 0 1 4 ⌋ = 4 0 2 + 8 0 + 1 6 + 3 = 5 0 1 = ⌊ 5 1 0 0 7 ⌋ + ⌊ 2 5 1 0 0 7 ⌋ + ⌊ 1 2 5 1 0 0 7 ⌋ + ⌊ 6 2 5 1 0 0 7 ⌋ = 2 0 1 + 4 0 + 8 + 1 = 2 5 0
The trialing zeros of 1 0 0 7 ! 2 2 0 1 4 ! , z = z ( 2 0 1 4 ) − 2 z ( 1 0 0 7 ) = 5 0 1 − 5 0 0 = 1