|
In mathematics, a highly abundant number is a certain kind of natural number. Formally, a natural number n is called highly abundant iff for all m < n, Euclid, Greek mathematician, 3rd century BC, known today as the father of geometry; shown here in a detail of The School of Athens by Raphael. ...
In mathematics, a natural number is either a positive integer (1, 2, 3, 4, ...) or a non-negative integer (0, 1, 2, 3, 4, ...). The former definition is generally used in number theory, while the latter is preferred in set theory and computer science. ...
It has been suggested that this article or section be merged with Logical biconditional. ...
- σ(n) > σ(m)
where σ denotes the divisor function. The first few highly abundant numbers are 1, 2, 3, 4, 6, 8, 10, 12, 16, 18, 20, 24, 30, 36, 42, 48, 60, ... (sequence A002093 in OEIS). In mathematics, and specifically in number theory, a divisor function is an arithmetical function related to the divisors of an integer. ...
The On-Line Encyclopedia of Integer Sequences (OEIS) is an extensive searchable database of integer sequences, freely available on the Web. ...
All integer values of the factorial are highly abundant numbers, as are all colossally abundant numbers. The integers consist of the positive natural numbers (1, 2, 3, …), their negatives (−1, −2, −3, ...) and the number zero. ...
In mathematics, the factorial of a natural number n is the product of all positive integers less than or equal to n. ...
In mathematics, a colossally abundant number (sometimes abbreviated as CA) is a certain kind of natural number. ...
[edit]
See also
|
Feeds |
Contact