Talk:Sequence: nth number with exactly n divisors

From Rosetta Code
Revision as of 10:00, 12 April 2019 by Thundergnat (talk | contribs) (true, but not the point I was making.)

Handy hints

Handy optimization hints: Terms in position n that is a prime number are always the nth prime raised to the (n-1)th power. E.G. 

     # 1  2  3  4  5  6  7  8  9  10  11
primes 2  3  5  7 11 13 17 19 23  29  31

   Term 7  is 17^6  == 24137569. 
   Term 11 is 31^10 == 819628286980801.

and so on.

Non prime odd terms are always a square number. --Thundergnat (talk) 18:53, 11 April 2019 (UTC)

All   odd terms are always a square number.     -- Gerard Schildberger (talk) 01:02, 12 April 2019 (UTC)
You are 100% correct, but these were meant to be optimization hints, not statements of general fact. Sort of an either / or kind of thing. --Thundergnat (talk) 09:59, 12 April 2019 (UTC)
That is one hel heck of some dandy hints!!     -- Gerard Schildberger (talk) 18:56, 11 April 2019 (UTC)
Retrieved from "https://rosettacode.org/wiki/Talk:Sequence:_nth_number_with_exactly_n_divisors?oldid=290005"