Difference between revisions of "Talk:Counting divisors"
| Line 1: | Line 1: | ||
A good path for this article might include a proof that squares are the only natural numbers with odd numbers of positive divisors. There are many contest problems that require algebraic manipulation of the divisor counting process or formula. Perhaps even more advanced problems can be found.--[[User:MCrawford|MCrawford]] 23:27, 19 June 2006 (EDT) | A good path for this article might include a proof that squares are the only natural numbers with odd numbers of positive divisors. There are many contest problems that require algebraic manipulation of the divisor counting process or formula. Perhaps even more advanced problems can be found.--[[User:MCrawford|MCrawford]] 23:27, 19 June 2006 (EDT) | ||
| + | |||
| + | |||
| + | ---- | ||
| + | There are a whole bunch of problems about this from the AMC/AIME. I'll try to add some when I have time. --[[User:Chess64|Chess64]] 23:31, 19 June 2006 (EDT) | ||
Latest revision as of 22:31, 19 June 2006
A good path for this article might include a proof that squares are the only natural numbers with odd numbers of positive divisors. There are many contest problems that require algebraic manipulation of the divisor counting process or formula. Perhaps even more advanced problems can be found.--MCrawford 23:27, 19 June 2006 (EDT)
There are a whole bunch of problems about this from the AMC/AIME. I'll try to add some when I have time. --Chess64 23:31, 19 June 2006 (EDT)
