Proof: Let n=2a5bm with 2,5 ⧸| m. Then n has min{a,b} zeros at the end, as 10c | n⇔2c,5c | n⇔c≤min{a,b}. By Legendre's theorem for the power of p in n!vp(n!)=∑k=1⌊n/pk⌋we see we will have to pay attention only to the power of 5 in computing the number of zeros at the end. Use Legendre's theorem for this application on 1000 to obtain 249 zeros, and the same goes for 1001!,...,1004! as they don't have any greater powers of 5, and 1005=3·5·67 contributes one extra zero to 1005! for a total of 250.
Saturday, April 12, 2014
Problem 10
Proof: Let n=2a5bm with 2,5 ⧸| m. Then n has min{a,b} zeros at the end, as 10c | n⇔2c,5c | n⇔c≤min{a,b}. By Legendre's theorem for the power of p in n!vp(n!)=∑k=1⌊n/pk⌋we see we will have to pay attention only to the power of 5 in computing the number of zeros at the end. Use Legendre's theorem for this application on 1000 to obtain 249 zeros, and the same goes for 1001!,...,1004! as they don't have any greater powers of 5, and 1005=3·5·67 contributes one extra zero to 1005! for a total of 250.
Labels:
OUSMI
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment