A Theorem of Congruent Primes

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter than existing proofs, but the method may be useful in other contexts. The proof of Theorem 1 tracks the set of solutions and this set branches as a binary tree. Conditions set to the theorem restricts the branches so that only one branch is left. Following this branch gives either a solution or a contradiction. In Theorem 1 it leads to a contradiction. The interest is in the proof method, which maybe can be generalized to non-primes.