In number theory, the aliquot sum s(n) of a positive integer n is the sum of all proper divisors of n, that is, all divisors of n other than n itself.
They are defined by the sums of their aliquot divisors. The aliquot divisors of a number are all of its divisors except the number itself. The aliquot sum is the sum of the aliquot divisors so, for example, the aliquot divisors of 12 are 1, 2, 3, 4, and 6 and it’s aliquot sum is 16.
A number whose aliquot sum equals its value is a PERFECT number (6 for example).
Input : 12 Output : 16 Explanation : Proper divisors of 12 is = 1, 2, 3, 4, 6 and sum 1 + 2 + 3 + 4 + 6 = 16 Input : 15 Output : 9 Explanation : Proper divisors of 15 is 1, 3, 5 and sum 1 + 3 + 5 = 9
A simple solution is to traverse through all numbers smaller than n. For every number i, check if i divides n. If yes, we add it to result.
- Aliquot Sequence
- Find the sum of the costs of all possible arrangements of the cells
- Find an integer in the given range that satisfies the given conditions
- Minimum cost to partition the given binary string
- Transportation Problem | Set 7 ( Degeneracy in Transportation Problem )
- Minimize the sum of digits of A and B such that A + B = N
- Restore a permutation from the given helper array
- Convert Decimal To Hexa-Decimal including negative numbers
- Find the player who will win the Coin game
- Find ways to arrange K green balls among N balls such that exactly i moves is needed to collect all K green balls
- Transportation Problem | Set 6 (MODI Method - UV Method)
- Multiplication on Array : Range update query in O(1)
- Count of indices in an array that satisfy the given condition
- Minimum inversions required so that no two adjacent elements are same
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : jit_t