[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

*To*: [email protected]*Subject*: Fast Modular Factorial?*From*: [email protected] (Paul J. Ste. Marie)*Date*: Mon, 26 Sep 94 13:22:08 EDT*Cc*: [email protected], [email protected]*In-Reply-To*: Jim choate's message of Fri, 23 Sep 1994 12:55:34 -0500 (CDT) <[email protected]>*Reply-To*: [email protected]*Sender*: [email protected]

> > If (n!)mod x = 0 then there is a factor of x which is less than n. If > > you can solve modular factorials, then you can solve for the largest > > factor of x in logarithmic time. Obviously, nobody has found a method > > to do either. > > > Just some thoughts... ... > If x>n and x is not a prime then the result will again always be 0 since > we can break x down into factors smaller than n and the previous argument > removes the various factors. This doesn't work--(x > n) & x not prime doesn't imply that x has a factor less than n. That's only true if sqrt(x) >= n.

**References**:**Re: Fast Modular Factorial?***From:*Jim choate <[email protected]>

- Prev by Date:
**Re: Chomsky (Thread from Hell)** - Next by Date:
**DNA at last (fwd)** - Prev by thread:
**Re: Fast Modular Factorial?** - Next by thread:
**Re: Fast Modular Factorial?** - Index(es):