Maximal sum of divisors Example
Author: Shmulik London
Maximal sum of divisors
The problem:
In a given range n1,n1+1,...,n2 find the number n,
whose sum of divisors in maximal.
Running the example
java divisors_example.MaximalSumOfDivisors 20 50
Implementation
The example demonstrate the working with CompoundComputations, read more about
this example in 'Java Popcorn Tutorial'.
Source
You can look at
MaximalSumOfDivisors.java,
MaxSumOfDivisorsComputation.java,
SumOfDivisorsComputation.java and
PartialSumOfDivisorsPacket.java
for the source code.