The BSD conjecture states that if your name is long enough, it will always count as two letters on a famous conejcture.
Maybe also insert a joke about BSD Operating Systems if you're into that kind of stuff.
The conjecture states that Equation 1. "BSD conjecture" holds for every elliptic curve over the rational numbers (which is defined by its constants and )
The conjecture, if true, provides a (possibly inefficient) way to calculate the rank of an elliptic curve over the rational numbers, since we can calculate the number of elements of an elliptic curve over a finite field by Schoof's algorithm in polynomial time. So it is just a matter of calculating like that up to some point at which we are quite certain about .
The Wikipedia page of the this conecture is the perfect example of why it is not possible to teach natural sciences on Wikipedia. A million dollar problem, and the page is thoroughly incomprehensible unless you already know everything!
Summary:
- overview of the formula of the BSD conjecture
- definition of elliptic curve
- domain of an elliptic curve. Prerequisite: field
- elliptic curve group. Prerequisite: group
- Mordell's theorem lets us define the rank of an elliptic curve over the rational numbers, which is the . Prerequisite: generating set of a group
- reduction of an elliptic curve from to lets us define as the number of elements of the generated finite group
The paper that states the BSD conjecture.
Likely paywalled at: www.degruyter.com/document/doi/10.1515/crll.1965.218.79/html. One illegal upload at: virtualmath1.stanford.edu/~conrad/BSDseminar/refs/BSDorigin.pdf.