The congruent number problem - Institut für Mathematik
... Now, as we have a explicit parametrization of Pythagorean triples, we can compute the very first examples for congruent numbers. Notice that a full implementation of the following algorithm in Sage can be found in the appendix. The underlying algorithm is, as one can imagine, very simple. For a give ...
... Now, as we have a explicit parametrization of Pythagorean triples, we can compute the very first examples for congruent numbers. Notice that a full implementation of the following algorithm in Sage can be found in the appendix. The underlying algorithm is, as one can imagine, very simple. For a give ...
