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:
“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)
“They have thrown away her electric toothbrush, someone else slips
The key into the lock of her safety-deposit box
At the Crocker-Anglo Bank; her seat at the cricket matches
Is warmed by buttocks less delectable than hers.”
—Randall Jarrell (1914–1965)
“It breedeth no small offence and scandal to see and consider upon the one part the curiosity and cost bestowed by all sorts of men upon their private houses; and on the other part the unclean and negligent order and spare keeping of the houses of prayer by permitting open decays and ruins of coverings of walls and windows, and by appointing unmeet and unseemly tables with foul cloths for the communion of the sacrament.”
—Elizabeth I (1533–1603)