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:
“You have many choices. You can choose forgiveness over revenge, joy over despair. You can choose action over apathy.... You hold the key to how well you make the emotional adjustment to your divorce and consequently how well your children will adapt.”
—Stephanie Marston (20th century)
“Sunshine of late afternoon—
On the glass tray
a glass pitcher, the tumbler
turned down, by which
a key is lying—And the
immaculate white bed”
—William Carlos Williams (1883–1963)
“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)