Jump to content

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

Talk:Sequence: nth number with exactly n divisors (view source)

Revision as of 18:55, 11 April 2019

58 bytes added ,  5 years ago
m
→‎Handy hint: another hint
(→‎Handy hint: new section)
 
m (→‎Handy hint: another hint)
Line 1:
== Handy hinthints ==
 
Handy optimization hinthints: 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:
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)▼
 
▲andNon soprime onodd terms are '''always''' a square number. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 18:53, 11 April 2019 (UTC)
Thundergnat
10,333

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/290000"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information