Re: product of an arithmetic sequence

From: "Proginoskes" <proginoskes@xxxxxxxxxxxxx>
Date: 14 Jun 2005 15:32:36 -0700

Sebastian Martin Ruiz wrote:
> We can calculate Mod[k!,n] in polynomial time complexity? k, n
> integers.
>
> Mod[k!,n] = k! (module n)

I doubt it ... If so, there is a trivial prime-testing algorithm using
Wilson's Theorem:

THEOREM. (n-1)! = -1 (mod n) iff n is prime.

--- Christopher Heckman

.

References:
- product of an arithmetic sequence
  - From: Sebastian Martin Ruiz
- Re: product of an arithmetic sequence
  - From: David Kastrup
- Re: product of an arithmetic sequence
  - From: Sebastian Martin Ruiz

Prev by Date: Re: Another prime number theorem?
Next by Date: Re: Programs for numerical integration of points?
Previous by thread: Re: product of an arithmetic sequence
Next by thread: Random sequence convergence theorem
Index(es):
- Date
- Thread

Relevant Pages

product of an arithmetic sequence
... (With polynomial time complexity.) ... Sebastian Martin Ruiz ... Prev by Date: ...
(sci.math)
Re: product of an arithmetic sequence
... > (With polynomial time complexity.) ... 15, 44793 Bochum ... Prev by Date: ...
(sci.math)
Re: product of an arithmetic sequence
... > We can calculate Modin polynomial time complexity? ... Depends on what you define as a fundamental operation and what you ... 15, 44793 Bochum ... Prev by Date: ...
(sci.math)