How Elliptic Curves Solve the Equation a/(b+c) + b/(a+c) + c/(a+b) = 4 in Positive Integers
We are looking for solutions in positive integers. The solution actually comes in two steps.
Step One: Key Observations About the Diophantine Equation
The equation is homogeneous. If (a, b, c) is a solution, then (ka, kb, kc) is also a solution, because ka/(kb+kc) = a/(b+c).
This means the actual values don’t matter — only their ratios do. So we can divide everything by c, set c = 1, find a rational solution, and then multiply through by the common denominator to return to integers.
Multiplying the equation by all denominators gives:
Reducing the Cubic to an Elliptic Curve Diophantine Equation
The degree is 3, and equations of this type frequently lead to elliptic curves. After a change of variables, the equation transforms into the form:
y² = x³ + 109x² + 224x
This is already a standard form of an elliptic curve — one that mathematicians know how to work with.
Step Two: The Power of Elliptic Curves
The next step uses the central fact of the theory: if even a single rational point is found on such a curve, new rational points can be constructed from it by a precise geometric rule. The rule works as follows — draw a line through two known points, find where it intersects the curve a third time, and that new intersection gives the next point. If a single point is added to itself, the tangent line is used instead of a secant. Starting from just one point, this process generates an entire sequence of new rational points.
For example, the point
x = −100, y = 260
lies on this curve. Reversing the change of variables gives:
a = 4, b = −1, c = 11
This is already a solution to the original equation, but it doesn’t work for our purposes because b is negative.
Finding Positive Integer Solutions via Elliptic Curve Point Multiplication
We now repeatedly apply the group law on the curve, computing 2P, 3P, 4P, and so on, where P = (−100, 260). Each new point is translated back into a triple (a, b, c). The first several steps yield solutions, but negative values keep appearing among them. It is only at the 9th step — the point 9P — that a triple with all positive values finally appears.
This is the solution we were looking for. The numbers are roughly 80 digits long:
a = 154476802108746166441951315019919837485664325669565431700026634898253202035277999
b = 36875131794129999827197811565225474825492979968971970996283137471637224634055579
c = 4373612677928697257861252602371390152816537558161613618621437993378423467772036
And for these values, the equation holds exactly:
a/(b+c) + b/(a+c) + c/(a+b) = 4
Why Elliptic Curves in Number Theory Are Unavoidable Here
The irony is that an equation which looks like a school-level puzzle turns out to require the theory of elliptic curves to solve — one of the deepest areas of modern mathematics. What appears to be a simple arithmetic challenge conceals a problem where elliptic curves Diophantine equations are not merely a convenient tool, but the only known path to a solution.
