1994-09-24 - Re: Fast Modular Factorial?
Header Data
From: chen@intuit.com (Mark Chen)
To: cypherpunks@toad.com (cypherpunks)
Message Hash: 8f56076e50cd80bbe58e3198fc11b771e07a00b574dc6bf7310e478850d300e3
Message ID: <9409240012.AA15318@doom.intuit.com>
Reply To: N/A
UTC Datetime: 1994-09-24 00:13:13 UTC
Raw Date: Fri, 23 Sep 94 17:13:13 PDT
Raw message
From: chen@intuit.com (Mark Chen)
Date: Fri, 23 Sep 94 17:13:13 PDT
To: cypherpunks@toad.com (cypherpunks)
Subject: Re: Fast Modular Factorial?
Message-ID: <9409240012.AA15318@doom.intuit.com>
MIME-Version: 1.0
Content-Type: text/plain
As a footnote to my previous message,
(p - 1)! ~ -1 mod p
whenever p is prime (Wilson's theorem).
This follows immediately from the general rule that I gave.
- Mark -
--
Mark Chen
chen@netcom.com
415/329-6913
finger for PGP public key
D4 99 54 2A 98 B1 48 0C CF 95 A5 B0 6E E0 1E 1D
Thread
Return to September 1994
Return to “chen@intuit.com (Mark Chen)”
1994-09-24 (Fri, 23 Sep 94 17:13:13 PDT) - Re: Fast Modular Factorial? - chen@intuit.com (Mark Chen)