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 the, key to, key and/or tables:
“As soon as you are in a social setting, you better take away the key to the lock of your heart and pocket it; those who leave the key in the lock are fools.”
—Johann Wolfgang Von Goethe (1749–1832)
“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)
“I cannot tell what I am as much afraid of, as a woman who invariably washes on Monday. It is a kind of key to character; and if her mouth is not puckered and her brow wrinkled, they will be, unless she repents.”
—Jane Grey Swisshelm (1815–1884)
“O these encounterers, so glib of tongue,
That give a coasting welcome ere it comes,
And wide unclasp the tables of their thoughts
To every ticklish reader! Set them down
For sluttish spoils of opportunity
And daughters of the game.”
—William Shakespeare (1564–1616)