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

Content added Content deleted

Inline

Revision as of 18:55, 11 April 2019

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)

@@ Line 1: / Line 1: @@
-== Handy hint ==
+== Handy hints ==
-Handy optimization hint: Terms in position n that is a prime number are '''always''' the nth prime raised to the (n-1)th power. E.G.
+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
@@ Line 9: / Line 9: @@
     Term 11 is 31^10 == 819628286980801.
+and so on.
-and so on. --[[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)