Amicable Pair Checker
Check whether two integers form an amicable pair of proper divisor sums.
Description
Check whether two distinct positive integers equal each other's proper-divisor sums.
Amicable Pair Checker check whether two distinct positive integers equal each other's proper-divisor sums.
Use this for recreational number theory, sequence verification, teaching divisor functions, and checking candidate amicable pairs.
When to use Amicable Pair Checker
Use this for recreational number theory, sequence verification, teaching divisor functions, and checking candidate amicable pairs.
How it works
The tool sums every positive divisor smaller than each number and requires sum(a)=b and sum(b)=a, with a and b distinct.1
Interpreting the result
Keep the input units, direction conventions, encoding, and ordering rules visible when reusing the result. Preserve the full returned value for downstream calculations and round only for presentation.
Assumptions and limitations
This is a pair predicate, not a search. Trial division is bounded for responsive execution, and perfect numbers are excluded because the two inputs must differ.
References
-
The On-Line Encyclopedia of Integer Sequences — OEIS Foundation