Highest Power in the Expansion of n!
How many zeroes at the end ?If is expressed in its prime factorization form, what is the power of ? What is the highest power of 15 in the expansion in ? These are just some examples and different problem but the method used to solve these problems is the same. The number of zeroes at the end is commonly called trailing zeroes.
For trailing zeroes, . The number of zeroes here is dependent on the number of . We observe that . Surely the number of 2’s will always be more than the number of 5’s.
Let’s take for example in the expansion of .
If we continue this and we count the number of 5’s. There are only two of them. 1 from the factor of 10 and the other is the 5 itself. Two is also the highest power of .
The number of is 8. 1 from 10, 3 from 8, 1 from 6, 2 from 4, 1 from 2. Meaning the number of 10 that is dependent in number of 5’s. Since there are only two 5’s. The number of zeroes in the expansion of 10! is also 2.
Generally, the highest power of $lates r$ such that where in the expansion of can be found using the following formula.
Where is the greatest integer function of x. ,
Worked Problem 1:
How many zeroes at the end ?
This problem is the same in our example above.
Worked Problem 2:
What is the highest power of 15 in the expansion in ?
. Which means that the highest power of 15 is dependent on the highest power of 5.
Worked Problem 3:
What is the highest power of in ?
. Since 7 is highest prime factor of 35, the highest power of 105 is dependent on the highest power of 7.