Use this mathematical tool to inspect or reproduce the stated operation with inputs that satisfy its dimensional and domain requirements.

First integer

Required integer.

Second integer

Required integer.

The cited overview of Number theory supplies background for the terminology and domain context used by this tool.^[1]

Check whether two integers form an amicable pair of proper divisor sums. Inputs are interpreted exactly in the displayed units and the calculation returns the following fields without presentation rounding.

Is an amicable pair

Returned boolean.

• Floating-point rounding, ill-conditioned inputs, singular cases, tolerance choices, and rapidly growing output sets can affect numerical accuracy or feasibility.
• First integer must be at least 2.
• First integer must be no greater than 1000000000.
• Second integer must be at least 2.
• Second integer must be no greater than 1000000000.
• Use finite inputs in the displayed units, preserve source measurements and assumptions, and independently verify consequential decisions.

Check the result analytically on a small case and use an established numerical or symbolic library with suitable precision and diagnostics for consequential work.

• Betrothed Numbers Checker

  Check whether two integers form a pair of betrothed numbers whose proper divisor sums exceed each partner by one.

• Coprime Number Checker

  Check whether two nonzero safe integers share no factor greater than one.

• Pronic Number Checker

  Check whether a nonnegative integer equals the product of two consecutive integers.