Divisor-bound conjecture for the symbolic generator

About 1 year old · traced to

Let Δn∈Z>0\Delta_n\in\mathbb{Z}_{>0}, and let r∈Z>0r\in\mathbb{Z}_{>0} be a divisor of Δn\Delta_n. Consider the parametrized formulas for A,B,C,DA,B,C,D constructed in Sections 2.1 and 2.2, and require them to yield positive, non-zero integer values. Divisor-bound conjecture. It is necessary when n=2n=2, and empirically observed when n=3n=3, that

r<Δnn.r<\sqrt[n]{\Delta_n}.

This inequality ensures that expressions such as Δn−r22r\frac{\Delta_n-r^2}{2r} are non-negative integers; for n=3n=3, it improves the likelihood that 12⋅Δ3⋅r−3⋅r4\sqrt{12\cdot\Delta_3\cdot r-3\cdot r^4} is a perfect square, enabling closed-form rational solutions. The statement is proved only as a necessary condition for n=2n=2 in the supplied wording; its status for n=3n=3 is empirical rather than established.

References

Primary source

Jamal Agbanwa, “A Closed-Form Symbolic Generator: A^n + B^n = C^n + D^n, for n = 2,3”, arXiv:2506.19173 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.