Talk:Sequence: nth number with exactly n divisors: Difference between revisions

From Rosetta Code
Content added Content deleted
m (Reverted edits by Thundergnat (talk) to last revision by Gerard Schildberger)
m (corrected text for plurals, added a hint that encompasses all odd terms.)
Line 13: Line 13:
Non prime odd terms are '''always''' a square number. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 18:53, 11 April 2019 (UTC)
Non prime odd terms are '''always''' a square number. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 18:53, 11 April 2019 (UTC)


: That is one <strike>hel</strike> heck of a dandy hint!! &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 18:56, 11 April 2019 (UTC)
: ''All'' &nbsp; odd terms are '''always''' a square number. &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 01:02, 12 April 2019 (UTC)

: That is one <strike>hel</strike> heck of some dandy hints!! &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 18:56, 11 April 2019 (UTC)

Revision as of 01:03, 12 April 2019

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)
That is one hel heck of some dandy hints!!     -- Gerard Schildberger (talk) 18:56, 11 April 2019 (UTC)