All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Factorial Remainder (Posted on 2011-09-02)
Determine the remainder when 98! is divided by 101

*** For an extra challenge, solve this problem without using a computer program.

 See The Solution Submitted by K Sengupta Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 re: Trying to avoid 98 mods... | Comment 3 of 9 |
(In reply to Trying to avoid 98 mods... by Jer)

You are correct on the number of zeroes, but I fail to see how this really helps?

As for a shorter way, I've been trying some things, but I can't seem to get very far.

I started with:

98! MOD 101
= (100!/(99*100)) MOD 101

and used the distributive property of MOD:

=((100! MOD 101)/((99*100) MOD 101)) MOD 101

and reduced:

=((100! MOD 101)/(9900 MOD 101)) MOD 101
=((100! MOD 101)/2) MOD 101

Where should I go from here, though?

Edited on September 3, 2011, 4:59 am
 Posted by Joshua on 2011-09-02 18:00:41

 Search: Search body:
Forums (0)