= Alexandrian integer
{c}
An <Alexandrian integer> is a <positive integer> $A=pqr$ for nonzero <integers> $p,q,r$ satisfying
$$
\frac1A=\frac1p+\frac1q+\frac1r,
\qquad\text{equivalently}\qquad pq+pr+qr=1.
$$
The factors may be negative. For example, $A=6$ arises from $(p,q,r)=(1,-2,-3)$, since $1-1/2-1/3=1/6$.
A useful parametrization is
$$
A=n(n+d)(n+e),\qquad d,e,n>0,\qquad de=n^2+1.
$$
Indeed, the signed triple $(n,-n-d,-n-e)$ gives $pq+pr+qr=de-n^2=1$.
Conversely, a valid triple cannot be entirely positive, because then $pq+pr+qr\ge3$. Since its <product> is positive, exactly one factor is positive. Write it as $(n,-x,-y)$, so $(x-n)(y-n)=n^2+1$. Both differences have the same sign; they cannot both be negative, because their <product> would be at most $(n-1)^2$. Thus $d=x-n$ and $e=y-n$ are positive and give the parametrization. Enumerating <factor pairs> of $n^2+1$ therefore produces the candidates without searching arbitrary signed triples.
Back to article page