Function Repository Resource:

AbundantNumber

Source Notebook

Compute the nth abundant number

Contributed by: Wolfram|Alpha Math Team

ResourceFunction["AbundantNumber"][n]

computes the nth abundant number.

Details and Options

Input must be a positive integer.
An abundant number is a number whose sum of proper divisors is greater than the number itself. The proper divisors of an integer n are the positive integers less than n that divide n.
If instead a number’s proper divisor sum is less than or equal to its value, then it is called deficient or perfect, respectively.

Examples

Basic Examples (2) 

Compute the 5th abundant number:

In[1]:=
ResourceFunction["AbundantNumber"][5]
Out[1]=

Compute the first 20 abundant numbers:

In[2]:=
ResourceFunction["AbundantNumber"] /@ Range[20]
Out[2]=

Publisher

Jack Heimrath

Version History

  • 1.0.0 – 16 October 2020

Related Resources

Author Notes

To view the full source code for AbundantNumber, evaluate the following:

In[1]:=
SystemOpen[
 FileNameJoin[{DirectoryName[FindFile["ResourceFunctionHelpers`"]], "NumberTypes.wl"}]]

License Information