Hilbert’s 10th Problem: Does an Algorithm for Rational Solutions Exist?
One post on this topic wasn’t enough — so this is the start of a mini-series. The first installment drops on Monday!
In the meantime, here’s a question worth sitting with: does there exist an algorithm that, given any “school-level” system of polynomials, can determine whether it has a rational solution?
Hilbert’s 10th Problem and the Question of Decidability
More precisely: given one or more polynomials with integer coefficients f(x₁,…,xₙ)=0, we want an algorithm — maybe AI? — that always answers YES or NO in finite time to the question: does a solution exist in the rational numbers (i.e. xᵢ ∈ ℚ)?
Why Hilbert’s 10th Problem Is Both Strange and Beautiful
This question is striking for several reasons at once.
First, the problem sounds elementary — the kind of thing you’d see in a high school math class. But it is actually a question about the boundaries of what can be computed at all.
Second, a closely related version of the problem — asking about integer solutions instead of rational ones — is already known to be impossible. No universal algorithm for deciding whether integer solutions exist can be built. This is the classical result established by Davis, Putnam, Robinson, and Matiyasevich in the 1970s.
The Gap Between Integer and Rational Decidability
Third, and here is where things get genuinely strange: when you expand the solution space from ℤ to ℚ, the picture suddenly becomes foggy. For rational numbers, the question remains open to this day and runs into some very deep mathematical ideas.
Fourth, the topic is very much alive right now. In 2024–2025, significant advances appeared in generalizations of the problem — all falling under the umbrella of Hilbert’s 10th problem — but none of them have closed the puzzle specifically for ℚ.
What We Know — and What Remains Open
To put it plainly, the situation is paradoxical: for integers, we know no algorithm exists; for rationals, we can neither construct such an algorithm nor prove that one is impossible.
That gap — between the known impossibility and the unknown — is exactly what makes Hilbert’s 10th problem decidability one of the most captivating open questions in mathematics today.
