Re: product of an arithmetic sequence
- From: "Sebastian Martin Ruiz" <smaranda@xxxxxxxxxx>
- Date: 14 Jun 2005 08:03:39 -0700
We can calculate Mod[k!,n] in polynomial time complexity? k, n
integers.
Mod[k!,n] = k! (module n)
.
- Follow-Ups:
- Re: product of an arithmetic sequence
- From: Proginoskes
- Re: product of an arithmetic sequence
- From: David Kastrup
- Re: product of an arithmetic sequence
- References:
- product of an arithmetic sequence
- From: Sebastian Martin Ruiz
- Re: product of an arithmetic sequence
- From: David Kastrup
- product of an arithmetic sequence
- Prev by Date: Re: quadratics with related roots
- Next by Date: Re: product of an arithmetic sequence
- Previous by thread: Re: product of an arithmetic sequence
- Next by thread: Re: product of an arithmetic sequence
- Index(es):
Loading
