Re: Factoraization of n! as power of primes
- From: magidin@xxxxxxxxxxxxxxxxx (Arturo Magidin)
- Date: Fri, 17 Feb 2006 18:46:19 +0000 (UTC)
In article <l7qdnX7hpcG-j2venZ2dnUVZ_sidnZ2d@xxxxxxxxxxx>,
Tim Peters <tim.one@xxxxxxxxxxx> wrote:
[Arturo Magidin]
...
I misread the original and cancelled my posting.
I thought the original poster wanted to obtain BOTH the list of primes
and their exponents. Of course, it is easy, given a prime p and a
positive integer n, to find the exponent of p in the factorization of
n!. But there is no easy way to find all the primes that occur in the
factorization of n! given only n; at least, no known way.
The set of primes dividing n! is the set of primes <= n, and you surely
don't mean to say there's no known way to find the latter. Perhaps "easy"
is an informal notion of efficiency here?
Yes. I was talking about efficiency. Hence my comments later about
"easy to figure out if n is prime" (which now we know actually ->is<-
"easy", relatively speaking), and "easy to factor".
--
======================================================================
"It's not denial. I'm just very selective about
what I accept as reality."
--- Calvin ("Calvin and Hobbes")
======================================================================
Arturo Magidin
magidin@xxxxxxxxxxxxxxxxx
.
- References:
- Factoraization of n! as power of primes
- From: Abdulla
- Re: Factoraization of n! as power of primes
- From: Gerard Schildberger
- Re: Factoraization of n! as power of primes
- From: Arturo Magidin
- Re: Factoraization of n! as power of primes
- From: Tim Peters
- Factoraization of n! as power of primes
- Prev by Date: The Euler Equation: What does "e" have to do with sine & cosine?
- Next by Date: Challenae question for mathematician
- Previous by thread: Re: Factoraization of n! as power of primes
- Next by thread: max min of 3d points (simple problem)
- Index(es):
Relevant Pages
|
Loading
