Key To The Tables
- d(n) is the number of positive divisors of n, including 1 and n itself
- σ(n) is the sum of all the positive divisors of n, including 1 and n itself
- s(n) is the sum of the proper divisors of n, which does not include n itself; that is, s(n) = σ(n) − n
- a perfect number equals the sum of its proper divisors; that is, s(n) = n; the only perfect numbers between 1 and 1000 are 6, 28 and 496
- amicable numbers and sociable numbers are numbers where the sum of their proper divisors form a cycle; the only examples below 1000 are 220 and 284
- a deficient number is greater than the sum of its proper divisors; that is, s(n) < n
- an abundant number is less than the sum of its proper divisors; that is, s(n) > n
- a prime number has only 1 and itself as divisors; that is, d(n) = 2. Prime numbers are always deficient as s(n)=1
Read more about this topic: Table Of Divisors
Famous quotes containing the words key to, key and/or tables:
“Every revolution was first a thought in one man’s mind, and when the same thought occurs in another man, it is the key to that era.”
—Ralph Waldo Emerson (1803–1882)
“‘The key is in the window, the key is in the sunlight at the
window—I have the key—Get married Allen don’t take drugs—the key is in the bars, in the sunlight in the window.
Love,
your mother’”
—Allen Ginsberg (b. 1926)
“The word unto the prophet spoken
Was writ on tables yet unbroken;
The word by seers or sibyls told,
In groves of oak, or fanes of gold,
Still floats upon the morning wind,
Still whispers to the willing mind.”
—Ralph Waldo Emerson (1803–1882)