Is there any proof that the sum of factorial numbers is divisible by 3? – math.stackexchange.com 13:38 Posted by Unknown No Comments I wish to know if someone have already proof that: $$\sum_{n=1}^m n! \equiv 0\pmod 3$$ with $m\gt1$ Ps: Sorry for possible mistakes(english is not my mother language). from Hot Questions - Stack Exchange OnStackOverflow via Blogspot Share this Google Facebook Twitter More Digg Linkedin Stumbleupon Delicious Tumblr BufferApp Pocket Evernote Unknown Artikel TerkaitDid Karl Marx write that slavery had good aspects and abolishing it would destroy civilization? – skeptics.stackexchange.comHow to Override a Calculated Value in a Matrix with an Assigned Value – mathematica.stackexchange.comParsing date with the contents of a previous date execution issues error – unix.stackexchange.comLooking for Sci-fi book title – scifi.stackexchange.comPHP Login System with persistent login – codereview.stackexchange.comIs a helicopter ride unsafe for young children? – aviation.stackexchange.com
0 Comment to "Is there any proof that the sum of factorial numbers is divisible by 3? – math.stackexchange.com"
Post a Comment