$$F(X,Y) = 0$$
A rational point is $(x,y) \in \mathbf{Q}\times\mathbf{Q}$ such that $F(x,y) = 0$.
Open Problem: Give an algorithm to decide whether or not an integer $n$ is the area of a right triangle with rational side lengths.
This is a 1000-year old open problem, perhaps the oldest open problem in mathematics.
{{{id=3| T = line([(0,0), (3,0), (3,4), (0,0)],rgbcolor='black',thickness=2) lbl = text("3",(1.5,-.5),fontsize=28) + text("4",(3.2,1.5),fontsize=28) lbl += text("5",(1.5,2.5),fontsize=28) lbl += text("Area $n = 6$", (2.1,1.2), fontsize=28, rgbcolor='red') show(T+lbl, axes=False) /// }}}Theorem: The Birch and Swinnerton-Dyer Conjecture provides a solution to the congruent number problem.
Proof: Suppose $n$ is a positive integer. Consider the cubic curve $y^2 = x^3 - n^2 x$. Using algebra, one sees that this cubic curve has infinitely many rational points if and only if there are integers $a,b,c$ such that $n=ab/2$ and $a^2 + b^2 = c^2$. The Birch and Swinnerton-Dyer conjecture gives an algorithm to decide whether or not any cubic curve has infinitely many solutions.
{{{id=5| n = 5 var('x,y') C = EllipticCurve(y^2 == x^3 - n^2 * x) show(C) ///