S = 1 2 3 ! + 2 3 4 ! + 3 4 5 ! + … + 7 8 9 ! + 8 9 0 !
Find S mod 1 2 3 4 5 6 7 8 9 0
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Wow! I thought Wolfram Alpha can't evaluate this!
Log in to reply
Me too, I prayed and wolfram answered!
No "Wolfram|Alpha needs more time to respond to your query..."
Or "Computation timed out. Experimental feature: Try again with more time »"
Or "Computation timed out. No more results available."
The trick is to never loose faith in wolfram and he'll bless you.
Log in to reply
Well, may be you can use an elementary way, but it's verrrryyyy long, and I'm lazy.
You don't know the power of Wolfram Alpha :P
At current stage, it's very easy and quick to compute the answer directly.
Here's the manual code:
1 2 |
|
Simple standard approach.
Here 's a C++ solution. Adding it here for the sake of variety. I envy you since I can't do it directly like that in C++ because of data type range limitations. :|
Log in to reply
That's true. I remember banging my head against the walls and using
Big Integer
(in Java) while others were comfortably using python.
Problem Loading...
Note Loading...
Set Loading...
compski
Wolfram saved the day for this one.