Function Repository Resource:

DeficientNumber

Source Notebook

Compute the nth deficient number

Contributed by: Wolfram|Alpha Math Team

ResourceFunction["DeficientNumber"][n]

computes the nth deficient number.

Details and Options

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

Examples

Basic Examples (2) 

Compute the fifth deficient number:

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

Compute the first 20 deficient numbers:

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

Publisher

Jack Heimrath

Version History

  • 1.0.0 – 13 October 2020

Related Resources

Author Notes

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

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

License Information