This submission was written purely for fun, as an introduction to some simple things you can do with integers in MATLAB. The interested student might find some of the tricks interesting, for example, how might you efficiently find all of the proper divisors of a number? Aliquotparts uses a kron trick to do this quite efficiently. The aliquotsum code is also neatly vectorized.
The aliquots of a number, or aliquot parts, are all of the proper divisors of that number. The aliquot sum is the sum of those divisors. From here we can generate perfect numbers, abundant numbers, deficient numbers, amicable numbers, sociable numbers, etc. Who knows, maybe even quasi-perfect numbers?
These tools are vectorized and fairly efficient. For example, the aliquot parts of a number are given by
1 2 3 4 6 9 12 18
(36 is a divisor of itself but not a proper divisor.)
The aliquot sum is
We can count the number of proper divisors using aliquotsum too.
Amicable pairs of numbers are generated via the call:
Perfect numbers less than 10000? Since they must be self-amicable numbers, just do this:
Sociable numbers are those which form a clique of length greater than 2 such that the sums of their divisors are the next element from the clique, and the last member of the clique wraps around to the start. The first such sociable cycle has length 5, and starts with 12496.
12496 14288 15472 14536 14264
These tools are quite efficient. A quick test shows that it took less than a second (on my slow, old cpu) to find all distinct amicable pairs of numbers with the lower element less than 20000.
See the demo for many other examples.
Speed enhancement for aliquotparts
Added more to the demo, plus additional functionality to amicablecycles.
Title change. Who knows what an alioquot sum is anyway?
Additional functionality - p'th powers of the divisors.