# Re: smallest positive integer that has exactly k divisors

*From*: Richard Heathfield <rjh@xxxxxxxxxxxxxxx>*Date*: Wed, 24 Oct 2007 07:05:52 +0000

mukesh tiwari said:

<snip>

Thnkx a lot for help . exactly what i am looking for but if explain

the algorithm that how did u computed the values for 1 to 36 .

I looked them up (but see below).

"fprintf(stderr, "write some more code.\n"); :)"

actually i have written the code which works fine under 1000 but i

need efficient method.

The trick is to know the formulae. See the FORMULA section of

http://www.research.att.com/~njas/sequences/?q=1%2C2%2C4%2C6%2C16%2C12%2C64%2C24&language=english&go=Search

Shorter URL: http://tinyurl.com/ywqvbc

Shorter URL with preview: http://preview.tinyurl.com/ywqvbc

--

Richard Heathfield <http://www.cpax.org.uk>

Email: -http://www. +rjh@

Google users: <http://www.cpax.org.uk/prg/writings/googly.php>

"Usenet is a strange place" - dmr 29 July 1999

.

**References**:**smallest positive integer that has exactly k divisors***From:*mukesh tiwari

**Re: smallest positive integer that has exactly k divisors***From:*Richard Heathfield

**Re: smallest positive integer that has exactly k divisors***From:*mukesh tiwari

- Prev by Date:
**Re: smallest positive integer that has exactly k divisors** - Next by Date:
**Call for Papers for the IWOMP2008 OpenMP workshop** - Previous by thread:
**Re: smallest positive integer that has exactly k divisors** - Next by thread:
**Re: smallest positive integer that has exactly k divisors** - Index(es):