Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Function Repository Resource:
Abundant
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]](https://www.wolframcloud.com/obj/resourcesystem/images/6eb/6ebae805-287b-40a4-b883-c9c6330d8a61/7000c10cc4e98ee3.png){kind=small} |
| Out[1]= |  |
Compute the first 20 abundant numbers:
| In[2]:= | ![ResourceFunction["AbundantNumber"] /@ Range[20]](https://www.wolframcloud.com/obj/resourcesystem/images/6eb/6ebae805-287b-40a4-b883-c9c6330d8a61/0355869c03e773d7.png){kind=small} |
| Out[2]= |  |
Publisher
Version History
- 1.0.0 – 16 October 2020
Related Resources
Related Symbols
Author Notes
To view the full source code for AbundantNumber, evaluate the following:
| In[1]:= | ![SystemOpen[
FileNameJoin[{DirectoryName[FindFile["ResourceFunctionHelpers`"]], "NumberTypes.wl"}]]](https://www.wolframcloud.com/obj/resourcesystem/images/6eb/6ebae805-287b-40a4-b883-c9c6330d8a61/0bf529ecf1e6e81c.png){kind=small} |
License Information
This work is licensed under a Creative Commons Attribution 4.0 International License