1. Understanding the Problem:
We need to compute the largest positive integer k such that 5k divides the sum
d∣N∑ν3(d!)(−1)σ(d),
where N=61999.
2. **Analyzing σ(d):**
Note that σ(d) is odd precisely when d is a power of 2 times an odd square. Since d divides 61999, this is equivalent to saying ν3(d) is even. Therefore, we have (−1)σ(d)=(−1)ν3(d)+1.
3. **Rewriting the Sum S:**
Let S be the sum in question. We can write:
S=k=0∑1999n=0∑1999(−1)n+1ν3((2k⋅3n)!).
4. Using Legendre's Formula:
Legendre's formula gives:
ν3((2k⋅3n)!)=⌊32k⋅3n⌋+⌊322k⋅3n⌋+⌊332k⋅3n⌋+⋯.
Simplifying, we get:
ν3((2k⋅3n)!)=2k(3n−1+3n−2+⋯+1)+ν3((2k)!).
This can be further simplified to:
ν3((2k⋅3n)!)=2k−1(3n−1)+ν3((2k)!).
5. **Summing Over n:**
We now sum over n:
n=0∑1999(−1)n+1(2k−1(3n−1)+ν3((2k)!)).
This simplifies to:
2k−1n=0∑1999(−1)n+1(3n−1).
6. Using the Geometric Series Formula:
The sum of the geometric series is:
n=0∑1999(−1)n+13n=1−(−3)3(1−(−3)2000)=432000−1.
Therefore, the sum becomes:
2k−1⋅432000−1=2k⋅832000−1.
7. **Summing Over k:**
We now sum over k:
S=832000−1k=0∑19992k=832000−1⋅(22000−1).
8. Using the Lifting The Exponent (LTE) Lemma:
Applying the LTE lemma, we get:
ν5(S)=ν5(32000−1)+ν5(22000−1).
Using the properties of the LTE lemma:
ν5(32000−1)=ν5(81500−1)=ν5(81−1)+ν5(500)=1+3=4,
and
ν5(22000−1)=ν5(16500−1)=ν5(16−1)+ν5(500)=1+3=4.
Therefore,
ν5(S)=4+4=8.
The final answer is 8.