How to Find the Remainder of a Modulo Operation in Factorial Series?

  • Topic:
  • Thread starter Thread starter Albert1
  • Start date Start date
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
3 replies · 2K views
Albert1
Messages
1,221
Reaction score
0
$A=\sum_{k=1}^{91}(k!\times k)$

find $ A $ MOD 2002
 
Mathematics news on Phys.org
Since $k!k = k! ((k+1)-1) = (k+1)! - k!$ for all $k$, $A$ telescopes to 92! - 1. Since $2002 = 2 \cdot 7 \cdot 11 \cdot 13$, $92!$ is divisible by 2002 and hence $A = 2001 \pmod{2002}$.
 
Last edited:
Euge said:
Since $k!k = k! ((k+1)-1) = (k+1)! - k$ for all $k$, $A$ telescopes to 92! - 1. Since $2002 = 2 \cdot 7 \cdot 11 \cdot 13$, $92!$ is divisible by 2002 and hence $A = 2001 \pmod{2002}$.
very nice !
a typo :$k!k=k!(k+1-1)=(k+1)!-k!$
 
Albert said:
very nice !
a typo :$k!k=k!(k+1-1)=(k+1)!-k!$

Thanks. I use my phone to post answers here, and sometimes the keyboard doesn't function properly. I will make the correction.