Betrothed Numbers Checker
Check whether two integers form a pair of betrothed numbers whose proper divisor sums exceed each partner by one.
Description
Check whether two distinct integers have proper-divisor sums one greater than the other partner.
Betrothed Numbers Checker check whether two distinct integers have proper-divisor sums one greater than the other partner.
Use this for recreational number theory and for verifying candidate betrothed pairs such as 48 and 75.
When to use Betrothed Numbers Checker
Use this for recreational number theory and for verifying candidate betrothed pairs such as 48 and 75.
How it works
The pair passes when sumProperDivisors(a)=b+1 and sumProperDivisors(b)=a+1.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 checks one supplied pair and uses bounded trial division; it does not enumerate pairs or prove anything about larger undiscovered values.
References
-
The On-Line Encyclopedia of Integer Sequences — OEIS Foundation