Forms: A Computational Approach, American Mathematical Society, 2007, congruent-number examples

William Stein, M. (2007). Forms: A Computational Approach, American Mathematical Society, 2007, congruent-number examples.

Type

Unclassified

Intellectual base

Unclassified

Year

2007

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Tunnell's theorem
  • … convenient observable transfers from For odd n, compute A_n and B_n from their two prescribed equations; a congruent n must satisfy 2A_n=B_n, and the converse invokes BSD. to A program enumerates bounded integer triples for a large square-free n and quickly rules out congruence when the required count equality fails..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:7e6a9d457064 · see in the full table