ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Call a positive rational number nn congruent if there exist a,b,c∈Q>0a,b,c\in\mathbb{Q}_{>0} with

a2+b2=c2,12ab=n,a^{2}+b^{2}=c^{2},\qquad \tfrac{1}{2}ab=n,

that is, if nn is the area of a right triangle all of whose sides are rational.

For a positive integer nn, the following three conditions are equivalent:

(i) nn is congruent;

(ii) there exist integers x,y,u,vx,y,u,v with y≠0y\neq 0 such that

x2−ny2=u2,x2+ny2=v2x^{2}-ny^{2}=u^{2},\qquad x^{2}+ny^{2}=v^{2}

(so that u2,x2,v2u^{2},x^{2},v^{2} form an arithmetic progression with common difference ny2ny^{2});

(iii) the elliptic curve En: Y2=X3−n2XE_{n}:\ Y^{2}=X^{3}-n^{2}X has a rational point of infinite order, i.e. rank⁡En(Q)>0\operatorname{rank} E_{n}(\mathbb{Q})>0.

There exists an algorithm which, given as input a positive rational number nn presented as a quotient of two positive integers, terminates after finitely many steps and outputs whether or not nn is congruent.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.