Talk:Sequence: nth number with exactly n divisors: Difference between revisions
Content added Content deleted
m (→Handy hints: added a comment.) |
Thundergnat (talk | contribs) m (Edit: add a (small) caveat) |
||
| Line 1: | Line 1: | ||
== Handy hints == |
== 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. |
Handy optimization hints: Terms in position n > 3 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 |
# 1 2 3 4 5 6 7 8 9 10 11 |
||
Revision as of 19:00, 11 April 2019
Handy hints
Handy optimization hints: Terms in position n > 3 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)
- That is one
helheck of a dandy hint!! -- Gerard Schildberger (talk) 18:56, 11 April 2019 (UTC)