smallest positive integer that has exactly k divisors

From: mukesh tiwari <mukeshtiwari.iiitm@xxxxxxxxx>
Date: Wed, 24 Oct 2007 18:30:18 +0000 (UTC)

Hello everybody . i have to find the smallest positive integer that
has exactly k divisors. for example if k=6 then 12 is the minimum
number which have 6 divisors.One brute force approach i came across
is find the prime factorization and calculate the factors until
factors are equal to the k but this one is taking to much time even
for 2000 factors .

.

Follow-Ups:
- Re: smallest positive integer that has exactly k divisors
  - From: Peter Pearson
- Re: smallest positive integer that has exactly k divisors
  - From: Edwin Clark
- Re: smallest positive integer that has exactly k divisors
  - From: Jeff Barnett

Prev by Date: Re: Special properties of the ring of complex numbers
Next by Date: Re: Special properties of the ring of complex numbers
Previous by thread: Re: Special properties of the ring of complex numbers
Next by thread: Re: smallest positive integer that has exactly k divisors
Index(es):
- Date
- Thread

Relevant Pages

Re: ISO algorithm to list all divisors of a number
... I'm looking for an algorithm to list all the divisors (not ... >necessarily prime) of an arbitrary positive integer. ... >all the divisors, but I'm looking for an algorithm with a clue. ... First find the prime factorization of the number. ...
(sci.math)
Re: smallest positive integer that has exactly k divisors
... number which have 6 divisors.One brute force approach i came across ... is find the prime factorization and calculate the divisors until ... Gerry Myerson ...
(sci.math)
Re: smallest positive integer that has exactly k divisors
... number which have 6 divisors.One brute force approach i came across ... is find the prime factorization and calculate the divisors until ... square-free just means the UNIQUE divisors will be the same ...
(sci.math)
smallest positive integer that has exactly k divisors
... has exactly k divisors. ... number which have 6 divisors.One brute force approach i came across ... is find the prime factorization and calculate the factors until ...
(comp.programming)
Re: smallest positive integer that has exactly k divisors
... number which have 6 divisors.One brute force approach i came across ... is find the prime factorization and calculate the divisors until ... This is true, _if_ N is square-free (i.e., when 1 is the only perfect ...
(sci.math)