Number of 5s dividing ∏n=150n!=∑n=150v5(n!) where v5(n!)=⌊n/5⌋+⌊n/25⌋+⌊n/125⌋+⋯.
For n≤50, v5(n!)=⌊n/5⌋+⌊n/25⌋ (higher terms vanish).
∑n=150⌊n/5⌋: ⌊n/5⌋=k for n∈{5k,5k+1,5k+2,5k+3,5k+4}, contributing 5k.
- n=1–4: 0, sum 0.
- n=5–9: 1, sum 5.
- n=10–14: 2, sum 10.
- n=15–19: 3, sum 15.
- n=20–24: 4, sum 20.
- n=25–29: 5, sum 25.
- n=30–34: 6, sum 30.
- n=35–39: 7, sum 35.
- n=40–44: 8, sum 40.
- n=45–49: 9, sum 45.
- n=50: 10, sum 10.
Total: 0+5+10+15+20+25+30+35+40+45+10=235.
∑n=150⌊n/25⌋: 0 for n≤24, 1 for n∈[25,49] (25 values), 2 for n=50. Sum =25+2=27.
Total k=235+27=262.
Verified answer: 262.
Why this is CAT-level: Double summation ∑nv5(n!) instead of v5(single factorial); the structural switch is non-obvious and brute-force expansion is infeasible.