adventures in binary quadratic forms - vadim ponomarenkomonoids and irreducibles make vadim happy....
TRANSCRIPT
![Page 1: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/1.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Adventures in Binary Quadratic Formsor: What I Did over Winter Break
Vadim Ponomarenko
Department of Mathematics and StatisticsSan Diego State University
University of California at Irvine May 24, 2018
http://vadim.sdsu.edu/2018-UCI-talk.pdf
![Page 2: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/2.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Shameless advertising
Please encourage your students to apply to theSan Diego State University Mathematics REU.
Serious projects.
http://www.sci.sdsu.edu/math-reu/index.html
This not-so-serious work had major contributions from JacksonAutry, and minor contributions from J.T. Dimabayao and O.J.Q.
Tigas.
![Page 3: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/3.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Shameless advertising
Please encourage your students to apply to theSan Diego State University Mathematics REU.
Serious projects.
http://www.sci.sdsu.edu/math-reu/index.html
This not-so-serious work had major contributions from JacksonAutry, and minor contributions from J.T. Dimabayao and O.J.Q.
Tigas.
![Page 4: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/4.jpg)
Background Introduction Main results Connections Future Work? Bibliography
The Problem to be Solved
Two weeks off for winter break, want palate cleanser.
No time for heavy reading:
![Page 5: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/5.jpg)
Background Introduction Main results Connections Future Work? Bibliography
A Challenge Appears
“A note on primes of the form a2 ± ab + 2b2”, Dimabayao andTigas – declined
“Prime numbers p with expression p = a2 ± ab ± b2”,Bahmanpour, Journal of Number Theory 166 (2016) 208-218.
Amazing! OK. . .
![Page 6: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/6.jpg)
Background Introduction Main results Connections Future Work? Bibliography
A Challenge Appears
“A note on primes of the form a2 ± ab + 2b2”, Dimabayao andTigas – declined
“Prime numbers p with expression p = a2 ± ab ± b2”,Bahmanpour, Journal of Number Theory 166 (2016) 208-218.
Amazing! OK. . .
![Page 7: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/7.jpg)
Background Introduction Main results Connections Future Work? Bibliography
A Challenge Appears
“A note on primes of the form a2 ± ab + 2b2”, Dimabayao andTigas – declined
“Prime numbers p with expression p = a2 ± ab ± b2”,Bahmanpour, Journal of Number Theory 166 (2016) 208-218.
Amazing! OK. . .
![Page 8: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/8.jpg)
Background Introduction Main results Connections Future Work? Bibliography
My Entry Point
Integers represented by quadratic Form x2 + y2:
1. [Fermat 1640] Prime p is represented by x2 + y2 iff p = 2or p ≡ 1 (mod 4).
2. [Girard 1625] Natural n is represented by x2 + y2 iff everyprime dividing n that is congruent to 3 (mod 4), appears toan even power.
Irreducibles in (multiplicative) monoid are: “good” primes(2,5,13, . . .), squares of “bad” primes (32,72,112, . . .).
Monoids and irreducibles make Vadim happy.
![Page 9: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/9.jpg)
Background Introduction Main results Connections Future Work? Bibliography
My Entry Point
Integers represented by quadratic Form x2 + y2:
1. [Fermat 1640] Prime p is represented by x2 + y2 iff p = 2or p ≡ 1 (mod 4).
2. [Girard 1625] Natural n is represented by x2 + y2 iff everyprime dividing n that is congruent to 3 (mod 4), appears toan even power.
Irreducibles in (multiplicative) monoid are: “good” primes(2,5,13, . . .), squares of “bad” primes (32,72,112, . . .).
Monoids and irreducibles make Vadim happy.
![Page 10: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/10.jpg)
Background Introduction Main results Connections Future Work? Bibliography
My Entry Point
Integers represented by quadratic Form x2 + y2:
1. [Fermat 1640] Prime p is represented by x2 + y2 iff p = 2or p ≡ 1 (mod 4).
2. [Girard 1625] Natural n is represented by x2 + y2 iff everyprime dividing n that is congruent to 3 (mod 4), appears toan even power.
Irreducibles in (multiplicative) monoid are: “good” primes(2,5,13, . . .), squares of “bad” primes (32,72,112, . . .).
Monoids and irreducibles make Vadim happy.
![Page 11: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/11.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Recent Work
1. [Bahmanpour 2016] Prime p is represented byx2 + xy − y2 iff p ≡ 0,1,−1 (mod 5). Prime p isrepresented by x2 + xy + y2 iff p ≡ 0,1 (mod 3).
2. [Nair arxiv:2004] Natural n is represented by x2 + xy + y2
iff every prime dividing n that is congruent to 2 (mod 3),appears to an even power.
Monoids and irreducibles again...?
![Page 12: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/12.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Recent Work
1. [Bahmanpour 2016] Prime p is represented byx2 + xy − y2 iff p ≡ 0,1,−1 (mod 5). Prime p isrepresented by x2 + xy + y2 iff p ≡ 0,1 (mod 3).
2. [Nair arxiv:2004] Natural n is represented by x2 + xy + y2
iff every prime dividing n that is congruent to 2 (mod 3),appears to an even power.
Monoids and irreducibles again...?
![Page 13: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/13.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Recent Work
1. [Bahmanpour 2016] Prime p is represented byx2 + xy − y2 iff p ≡ 0,1,−1 (mod 5). Prime p isrepresented by x2 + xy + y2 iff p ≡ 0,1 (mod 3).
2. [Nair arxiv:2004] Natural n is represented by x2 + xy + y2
iff every prime dividing n that is congruent to 2 (mod 3),appears to an even power.
Monoids and irreducibles again...?
![Page 14: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/14.jpg)
Background Introduction Main results Connections Future Work? Bibliography
My Other Background
1. [Pell’s equation] 1 is represented by x2 − ny2, provided nis a nonsquare (Lagrange).
2. [negative Pell’s equation] −1 is represented by x2 − ny2,provided continued fractions. . .
3. Quadratic fields. . .4. Quadratic forms. . .
Damn the torpedoes, time to prove something (original or not).
![Page 15: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/15.jpg)
Background Introduction Main results Connections Future Work? Bibliography
My Other Background
1. [Pell’s equation] 1 is represented by x2 − ny2, provided nis a nonsquare (Lagrange).
2. [negative Pell’s equation] −1 is represented by x2 − ny2,provided continued fractions. . .
3. Quadratic fields. . .4. Quadratic forms. . .
Damn the torpedoes, time to prove something (original or not).
![Page 16: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/16.jpg)
Background Introduction Main results Connections Future Work? Bibliography
My Other Background
1. [Pell’s equation] 1 is represented by x2 − ny2, provided nis a nonsquare (Lagrange).
2. [negative Pell’s equation] −1 is represented by x2 − ny2,provided continued fractions. . .
3. Quadratic fields. . .4. Quadratic forms. . .
Damn the torpedoes, time to prove something (original or not).
![Page 17: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/17.jpg)
Background Introduction Main results Connections Future Work? Bibliography
My Other Background
1. [Pell’s equation] 1 is represented by x2 − ny2, provided nis a nonsquare (Lagrange).
2. [negative Pell’s equation] −1 is represented by x2 − ny2,provided continued fractions. . .
3. Quadratic fields. . .4. Quadratic forms. . .
Damn the torpedoes, time to prove something (original or not).
![Page 18: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/18.jpg)
Background Introduction Main results Connections Future Work? Bibliography
My Other Background
1. [Pell’s equation] 1 is represented by x2 − ny2, provided nis a nonsquare (Lagrange).
2. [negative Pell’s equation] −1 is represented by x2 − ny2,provided continued fractions. . .
3. Quadratic fields. . .4. Quadratic forms. . .
Damn the torpedoes, time to prove something (original or not).
![Page 19: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/19.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Outline
1. What was known going in. (complete)2. What was proved.3. What was learned afterward.4. What will happen next.
![Page 20: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/20.jpg)
Background Introduction Main results Connections Future Work? Bibliography
“New” Result
Given a principal binary quadratic form x2 + xy + ny2,
with τ = |1− 4n| prime,
if Condition P holds,
then a full characterization of which integers are represented isprovided.
Note 1: n = 1 gives τ = 3, n = −1 gives τ = 5.Note 2: Condition P fairly easy to test computationally.Note 3: Generalizes to x2 + mxy + ny2, with prime |m2 − 4n|.
![Page 21: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/21.jpg)
Background Introduction Main results Connections Future Work? Bibliography
“New” Result
Given a principal binary quadratic form x2 + xy + ny2,
with τ = |1− 4n| prime,
if Condition P holds,
then a full characterization of which integers are represented isprovided.
Note 1: n = 1 gives τ = 3, n = −1 gives τ = 5.Note 2: Condition P fairly easy to test computationally.Note 3: Generalizes to x2 + mxy + ny2, with prime |m2 − 4n|.
![Page 22: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/22.jpg)
Background Introduction Main results Connections Future Work? Bibliography
“New” Result
Given a principal binary quadratic form x2 + xy + ny2,
with τ = |1− 4n| prime,
if Condition P holds,
then a full characterization of which integers are represented isprovided.
Note 1: n = 1 gives τ = 3, n = −1 gives τ = 5.Note 2: Condition P fairly easy to test computationally.Note 3: Generalizes to x2 + mxy + ny2, with prime |m2 − 4n|.
![Page 23: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/23.jpg)
Background Introduction Main results Connections Future Work? Bibliography
“New” Result
Given a principal binary quadratic form x2 + xy + ny2,
with τ = |1− 4n| prime,
if Condition P holds,
then a full characterization of which integers are represented isprovided.
Note 1: n = 1 gives τ = 3, n = −1 gives τ = 5.Note 2: Condition P fairly easy to test computationally.Note 3: Generalizes to x2 + mxy + ny2, with prime |m2 − 4n|.
![Page 24: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/24.jpg)
Background Introduction Main results Connections Future Work? Bibliography
“New” Result
Given a principal binary quadratic form x2 + xy + ny2,
with τ = |1− 4n| prime,
if Condition P holds,
then a full characterization of which integers are represented isprovided.
Note 1: n = 1 gives τ = 3, n = −1 gives τ = 5.Note 2: Condition P fairly easy to test computationally.Note 3: Generalizes to x2 + mxy + ny2, with prime |m2 − 4n|.
![Page 25: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/25.jpg)
Background Introduction Main results Connections Future Work? Bibliography
“New” Result
Given a principal binary quadratic form x2 + xy + ny2,
with τ = |1− 4n| prime,
if Condition P holds,
then a full characterization of which integers are represented isprovided.
Note 1: n = 1 gives τ = 3, n = −1 gives τ = 5.Note 2: Condition P fairly easy to test computationally.Note 3: Generalizes to x2 + mxy + ny2, with prime |m2 − 4n|.
![Page 26: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/26.jpg)
Background Introduction Main results Connections Future Work? Bibliography
“New” Result
Given a principal binary quadratic form x2 + xy + ny2,
with τ = |1− 4n| prime,
if Condition P holds,
then a full characterization of which integers are represented isprovided.
Note 1: n = 1 gives τ = 3, n = −1 gives τ = 5.Note 2: Condition P fairly easy to test computationally.Note 3: Generalizes to x2 + mxy + ny2, with prime |m2 − 4n|.
![Page 27: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/27.jpg)
Background Introduction Main results Connections Future Work? Bibliography
A look at τ
Given x2 + xy + ny2, set τ = |1− 4n|. Discriminant ∆ = 1− 4n.
If n > 0, then ∆ < 0 and τ ≡ 3 (mod 4). “positive definite qf”
If n < 0, then ∆ > 0 and τ ≡ 1 (mod 4). “indefinite qf”
In both cases, ∆ ≡ 1 (mod 4), since τ is assumed prime.
![Page 28: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/28.jpg)
Background Introduction Main results Connections Future Work? Bibliography
A look at τ
Given x2 + xy + ny2, set τ = |1− 4n|. Discriminant ∆ = 1− 4n.
If n > 0, then ∆ < 0 and τ ≡ 3 (mod 4). “positive definite qf”
If n < 0, then ∆ > 0 and τ ≡ 1 (mod 4). “indefinite qf”
In both cases, ∆ ≡ 1 (mod 4), since τ is assumed prime.
![Page 29: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/29.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Where’s the monoid?
Set Kn = {x2 + xy + ny2 : x , y ∈ Z} ⊆ Z.
(a2 + ab + nb2)(c2 + cd + nd2) =(ac − nbd︸ ︷︷ ︸
e
)2 + (ac − nbd︸ ︷︷ ︸e
)(bc + ad + bd︸ ︷︷ ︸f
) + n(bc + ad + bd︸ ︷︷ ︸f
)2
1 = 12 + 1 · 0 + n(0)2 Monoid!
Set K ′n = {x2 + xy + ny2 : x , y ∈ Z,gcd(x , y) = 1} ⊆ Kn
Note that if p ∈ Kn is prime, then in fact p ∈ K ′n.
![Page 30: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/30.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Where’s the monoid?
Set Kn = {x2 + xy + ny2 : x , y ∈ Z} ⊆ Z.
(a2 + ab + nb2)(c2 + cd + nd2) =(ac − nbd︸ ︷︷ ︸
e
)2 + (ac − nbd︸ ︷︷ ︸e
)(bc + ad + bd︸ ︷︷ ︸f
) + n(bc + ad + bd︸ ︷︷ ︸f
)2
1 = 12 + 1 · 0 + n(0)2 Monoid!
Set K ′n = {x2 + xy + ny2 : x , y ∈ Z,gcd(x , y) = 1} ⊆ Kn
Note that if p ∈ Kn is prime, then in fact p ∈ K ′n.
![Page 31: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/31.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Where’s the monoid?
Set Kn = {x2 + xy + ny2 : x , y ∈ Z} ⊆ Z.
(a2 + ab + nb2)(c2 + cd + nd2) =(ac − nbd︸ ︷︷ ︸
e
)2 + (ac − nbd︸ ︷︷ ︸e
)(bc + ad + bd︸ ︷︷ ︸f
) + n(bc + ad + bd︸ ︷︷ ︸f
)2
1 = 12 + 1 · 0 + n(0)2 Monoid!
Set K ′n = {x2 + xy + ny2 : x , y ∈ Z,gcd(x , y) = 1} ⊆ Kn
Note that if p ∈ Kn is prime, then in fact p ∈ K ′n.
![Page 32: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/32.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Where’s the monoid?
Set Kn = {x2 + xy + ny2 : x , y ∈ Z} ⊆ Z.
(a2 + ab + nb2)(c2 + cd + nd2) =(ac − nbd︸ ︷︷ ︸
e
)2 + (ac − nbd︸ ︷︷ ︸e
)(bc + ad + bd︸ ︷︷ ︸f
) + n(bc + ad + bd︸ ︷︷ ︸f
)2
1 = 12 + 1 · 0 + n(0)2 Monoid!
Set K ′n = {x2 + xy + ny2 : x , y ∈ Z,gcd(x , y) = 1} ⊆ Kn
Note that if p ∈ Kn is prime, then in fact p ∈ K ′n.
![Page 33: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/33.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Kn for n < 0
Recall: x2 + xy + ny2. If n < 0 then τ = |1− 4n| = 1− 4n.
Lemma: Let n < 0. Then −1 ∈ Kn.Proof: τ ≡ 1 (mod 4) is prime, so negative Pell equationx2 − τy2 = −1 has a solution. We see that(−x − y)2 + (−x − y)(2y) + n(2y)2 = x2 − (1− 4n)y2 = −1.
Corollary: Kn = −Kn
![Page 34: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/34.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Kn for n < 0
Recall: x2 + xy + ny2. If n < 0 then τ = |1− 4n| = 1− 4n.
Lemma: Let n < 0. Then −1 ∈ Kn.Proof: τ ≡ 1 (mod 4) is prime, so negative Pell equationx2 − τy2 = −1 has a solution. We see that(−x − y)2 + (−x − y)(2y) + n(2y)2 = x2 − (1− 4n)y2 = −1.
Corollary: Kn = −Kn
![Page 35: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/35.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Kn for n < 0
Recall: x2 + xy + ny2. If n < 0 then τ = |1− 4n| = 1− 4n.
Lemma: Let n < 0. Then −1 ∈ Kn.Proof: τ ≡ 1 (mod 4) is prime, so negative Pell equationx2 − τy2 = −1 has a solution. We see that(−x − y)2 + (−x − y)(2y) + n(2y)2 = x2 − (1− 4n)y2 = −1.
Corollary: Kn = −Kn
![Page 36: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/36.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Kn for n > 0
Recall: x2 + xy + ny2. If n > 0 then τ = |1− 4n| = 4n − 1 > 0.
Lemma: Let n > 0. Then Kn ⊆ N0.Proof: Let a,b ∈ Z. Set s = n−1/2,b′ = bn1/2. Note: b = sb′.a2 + ab + nb2 = a2 + sab′+ (b′)2 = 2+s
4 (a + b′)2 + 2−s4 (a− b′)2.
Now |s| < 2, so 2±s4 > 0. Hence a2 + ab + nb2 ≥ 0, with
equality iff a = b = 0.
![Page 37: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/37.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Representing τ and squares
Recall: x2 + xy + ny2. τ = |1− 4n| is assumed prime.
Lemma: τ ∈ Kn.Proof: (−1)2 + (−1)(2) + n(2)2 = −1 + 4n. For n > 0, this is τ .For n < 0, this is −τ , but Kn = −Kn.
Lemma: For any x ∈ N, x2 ∈ Kn.Proof: x2 + x(0) + n(0)2.
![Page 38: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/38.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Representing τ and squares
Recall: x2 + xy + ny2. τ = |1− 4n| is assumed prime.
Lemma: τ ∈ Kn.Proof: (−1)2 + (−1)(2) + n(2)2 = −1 + 4n. For n > 0, this is τ .For n < 0, this is −τ , but Kn = −Kn.
Lemma: For any x ∈ N, x2 ∈ Kn.Proof: x2 + x(0) + n(0)2.
![Page 39: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/39.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Representing nonresidues
Recall: x2 + xy + ny2. τ = |1− 4n| is assumed prime.
Lemma: If t 6= τ is a quadratic nonresidue mod τ , then t /∈ Kn.Proof: ABWOC, t = a2 + ab + nb2. Working mod τ ,4t ≡ 4a2 + 4ab + 4nb2 ≡ (2a + b)2 + b2(4n − 1) ≡ (2a + b)2.Hence 1 =
(4tτ
)=( tτ
)(2τ
)2=( tτ
)= −1, a contradiction.
Prime τ : yesNonresidues: noResidues: ?
![Page 40: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/40.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Representing nonresidues
Recall: x2 + xy + ny2. τ = |1− 4n| is assumed prime.
Lemma: If t 6= τ is a quadratic nonresidue mod τ , then t /∈ Kn.Proof: ABWOC, t = a2 + ab + nb2. Working mod τ ,4t ≡ 4a2 + 4ab + 4nb2 ≡ (2a + b)2 + b2(4n − 1) ≡ (2a + b)2.Hence 1 =
(4tτ
)=( tτ
)(2τ
)2=( tτ
)= −1, a contradiction.
Prime τ : yesNonresidues: noResidues: ?
![Page 41: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/41.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Representing nonresidues
Recall: x2 + xy + ny2. τ = |1− 4n| is assumed prime.
Lemma: If t 6= τ is a quadratic nonresidue mod τ , then t /∈ Kn.Proof: ABWOC, t = a2 + ab + nb2. Working mod τ ,4t ≡ 4a2 + 4ab + 4nb2 ≡ (2a + b)2 + b2(4n − 1) ≡ (2a + b)2.Hence 1 =
(4tτ
)=( tτ
)(2τ
)2=( tτ
)= −1, a contradiction.
Prime τ : yesNonresidues: noResidues: ?
![Page 42: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/42.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Quadratic Reciprocity
Recall: x2 + xy + ny2. τ = |1− 4n| is assumed prime.
Lemma: Let p 6= τ be an odd prime. Then(pτ
)=(1−4n
p
).
Proof: If n < 0, then τ = 1− 4n and τ ≡ 1 (mod 4), so byquadratic reciprocity
(pτ
)=(τp
)=(1−4n
p
).
If n > 0, then τ = 4n − 1 and τ ≡ 3 (mod 4), so by QR(−1)(p−1)/2 =
(pτ
)(τp
)=(pτ
)(1−4np
)(−1p
)=(pτ
)(1−4np
)(−1)(p−1)/2.
![Page 43: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/43.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Quadratic Reciprocity
Recall: x2 + xy + ny2. τ = |1− 4n| is assumed prime.
Lemma: Let p 6= τ be an odd prime. Then(pτ
)=(1−4n
p
).
Proof: If n < 0, then τ = 1− 4n and τ ≡ 1 (mod 4), so byquadratic reciprocity
(pτ
)=(τp
)=(1−4n
p
).
If n > 0, then τ = 4n − 1 and τ ≡ 3 (mod 4), so by QR(−1)(p−1)/2 =
(pτ
)(τp
)=(pτ
)(1−4np
)(−1p
)=(pτ
)(1−4np
)(−1)(p−1)/2.
![Page 44: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/44.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Quadratic Reciprocity
Recall: x2 + xy + ny2. τ = |1− 4n| is assumed prime.
Lemma: Let p 6= τ be an odd prime. Then(pτ
)=(1−4n
p
).
Proof: If n < 0, then τ = 1− 4n and τ ≡ 1 (mod 4), so byquadratic reciprocity
(pτ
)=(τp
)=(1−4n
p
).
If n > 0, then τ = 4n − 1 and τ ≡ 3 (mod 4), so by QR(−1)(p−1)/2 =
(pτ
)(τp
)=(pτ
)(1−4np
)(−1p
)=(pτ
)(1−4np
)(−1)(p−1)/2.
![Page 45: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/45.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Key Lemma
Recall: K ′n = {x2 + xy + ny2 : x , y ∈ Z,gcd(x , y) = 1} ⊆ Kn
Key Lemma: Let p 6= τ be an odd, prime, quadratic residue.Then pt ∈ K ′n for some t ∈ Z. If p >
√τ3 , then also 0 < |t | < p.
Proof: By QR lemma, there is r ∈ Z with r2 ≡ 1− 4n (mod p).Take s with 2s + 1 ≡ r (mod p). 4s2 + 4s + 4n ≡ 0 (mod p),so s2 + s + n ≡ 0 (mod p). Hence there is t ′ with t ′p ∈ K ′n.
Take g(x) = (s + xp)2 + (s + xp) + n. If x ∈ Z, then p|g(x).Vertex is k ′ = −2s+1
2p . g(k ′) = 4n−14 , g(k ′ ± 1
2) = 4n−14 + p2
4 .Take integer k ∈ [k ′ − 1
2 , k′ + 1
2 ]. So p|g(k), and
g(k) ∈ [4n−14 , 4n−1
4 + p2
4 ]. |g(k)| ≤ τ4 + p2
4 < 3p2
4 + p2
4 = p2. Sog(k) = pt with |t | < p. |t | > 0 since 0 /∈ K ′n (IOU).
![Page 46: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/46.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Key Lemma
Recall: K ′n = {x2 + xy + ny2 : x , y ∈ Z,gcd(x , y) = 1} ⊆ Kn
Key Lemma: Let p 6= τ be an odd, prime, quadratic residue.Then pt ∈ K ′n for some t ∈ Z. If p >
√τ3 , then also 0 < |t | < p.
Proof: By QR lemma, there is r ∈ Z with r2 ≡ 1− 4n (mod p).Take s with 2s + 1 ≡ r (mod p). 4s2 + 4s + 4n ≡ 0 (mod p),so s2 + s + n ≡ 0 (mod p). Hence there is t ′ with t ′p ∈ K ′n.
Take g(x) = (s + xp)2 + (s + xp) + n. If x ∈ Z, then p|g(x).Vertex is k ′ = −2s+1
2p . g(k ′) = 4n−14 , g(k ′ ± 1
2) = 4n−14 + p2
4 .Take integer k ∈ [k ′ − 1
2 , k′ + 1
2 ]. So p|g(k), and
g(k) ∈ [4n−14 , 4n−1
4 + p2
4 ]. |g(k)| ≤ τ4 + p2
4 < 3p2
4 + p2
4 = p2. Sog(k) = pt with |t | < p. |t | > 0 since 0 /∈ K ′n (IOU).
![Page 47: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/47.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Key Lemma
Recall: K ′n = {x2 + xy + ny2 : x , y ∈ Z,gcd(x , y) = 1} ⊆ Kn
Key Lemma: Let p 6= τ be an odd, prime, quadratic residue.Then pt ∈ K ′n for some t ∈ Z. If p >
√τ3 , then also 0 < |t | < p.
Proof: By QR lemma, there is r ∈ Z with r2 ≡ 1− 4n (mod p).Take s with 2s + 1 ≡ r (mod p). 4s2 + 4s + 4n ≡ 0 (mod p),so s2 + s + n ≡ 0 (mod p). Hence there is t ′ with t ′p ∈ K ′n.
Take g(x) = (s + xp)2 + (s + xp) + n. If x ∈ Z, then p|g(x).Vertex is k ′ = −2s+1
2p . g(k ′) = 4n−14 , g(k ′ ± 1
2) = 4n−14 + p2
4 .Take integer k ∈ [k ′ − 1
2 , k′ + 1
2 ]. So p|g(k), and
g(k) ∈ [4n−14 , 4n−1
4 + p2
4 ]. |g(k)| ≤ τ4 + p2
4 < 3p2
4 + p2
4 = p2. Sog(k) = pt with |t | < p. |t | > 0 since 0 /∈ K ′n (IOU).
![Page 48: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/48.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Main Result Sketch
Key Lemma: Let p 6= τ be an odd, prime, quadratic residue.Then pt ∈ K ′n for some t ∈ Z. If p >
√τ3 , then also 0 < |t | < p.
Thm: Assume Condition P. If p prime with(pτ
)= 1, then p ∈ Kn.
Proof: ABWOC, p minimal prime with(pτ
)= 1 and p /∈ Kn.
Condition P implies p >√
τ3 . Applying Key Lemma, choose |t |
minimal with 0 < |t | < p and pt ∈ K ′n.
|t | = 1 impossible. So write |t | = p1p2 · · · pk , with each pi primeand pi < p. By (IOU), each pi /∈ Kn. By (IOU), each pi must be2, and by (IOU), k ≤ 1. Finally, t = 2, but then pt = 2p, anonresidue, so pt /∈ Kn.
![Page 49: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/49.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Main Result Sketch
Key Lemma: Let p 6= τ be an odd, prime, quadratic residue.Then pt ∈ K ′n for some t ∈ Z. If p >
√τ3 , then also 0 < |t | < p.
Thm: Assume Condition P. If p prime with(pτ
)= 1, then p ∈ Kn.
Proof: ABWOC, p minimal prime with(pτ
)= 1 and p /∈ Kn.
Condition P implies p >√
τ3 . Applying Key Lemma, choose |t |
minimal with 0 < |t | < p and pt ∈ K ′n.
|t | = 1 impossible. So write |t | = p1p2 · · · pk , with each pi primeand pi < p. By (IOU), each pi /∈ Kn. By (IOU), each pi must be2, and by (IOU), k ≤ 1. Finally, t = 2, but then pt = 2p, anonresidue, so pt /∈ Kn.
![Page 50: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/50.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Main Result Sketch
Key Lemma: Let p 6= τ be an odd, prime, quadratic residue.Then pt ∈ K ′n for some t ∈ Z. If p >
√τ3 , then also 0 < |t | < p.
Thm: Assume Condition P. If p prime with(pτ
)= 1, then p ∈ Kn.
Proof: ABWOC, p minimal prime with(pτ
)= 1 and p /∈ Kn.
Condition P implies p >√
τ3 . Applying Key Lemma, choose |t |
minimal with 0 < |t | < p and pt ∈ K ′n.
|t | = 1 impossible. So write |t | = p1p2 · · · pk , with each pi primeand pi < p. By (IOU), each pi /∈ Kn. By (IOU), each pi must be2, and by (IOU), k ≤ 1. Finally, t = 2, but then pt = 2p, anonresidue, so pt /∈ Kn.
![Page 51: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/51.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Condition P
In the theorem, we need(pτ
)= 1 and p /∈ Kn to imply p >
√τ3 .
Set Pτ ={
p prime :(pτ
)= 1,p ≤
√τ3
}.
Condition P is just: Pτ ⊆ Kn
For n = ±1, P3 = P5 = ∅, so Condition P holds vacuously.For n = −4, P17 = {2}; we verify condition P via2 = 22 + 2(1) + (−4)(1)2.
Lots of computational data available.
![Page 52: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/52.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Condition P
In the theorem, we need(pτ
)= 1 and p /∈ Kn to imply p >
√τ3 .
Set Pτ ={
p prime :(pτ
)= 1,p ≤
√τ3
}.
Condition P is just: Pτ ⊆ Kn
For n = ±1, P3 = P5 = ∅, so Condition P holds vacuously.For n = −4, P17 = {2}; we verify condition P via2 = 22 + 2(1) + (−4)(1)2.
Lots of computational data available.
![Page 53: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/53.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Condition P
In the theorem, we need(pτ
)= 1 and p /∈ Kn to imply p >
√τ3 .
Set Pτ ={
p prime :(pτ
)= 1,p ≤
√τ3
}.
Condition P is just: Pτ ⊆ Kn
For n = ±1, P3 = P5 = ∅, so Condition P holds vacuously.For n = −4, P17 = {2}; we verify condition P via2 = 22 + 2(1) + (−4)(1)2.
Lots of computational data available.
![Page 54: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/54.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Condition P
In the theorem, we need(pτ
)= 1 and p /∈ Kn to imply p >
√τ3 .
Set Pτ ={
p prime :(pτ
)= 1,p ≤
√τ3
}.
Condition P is just: Pτ ⊆ Kn
For n = ±1, P3 = P5 = ∅, so Condition P holds vacuously.For n = −4, P17 = {2}; we verify condition P via2 = 22 + 2(1) + (−4)(1)2.
Lots of computational data available.
![Page 55: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/55.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Paying IOUs
Lemma: Let p 6= τ be odd prime with(pτ
)= −1, and t ∈ Z.
Then pt /∈ K ′n.
Proof: ABWOC, pt = a2 + ab + nb2 with gcd(a,b) = 1. If p|b,then p|a, contradiction. Hence pick c with bc ≡ 1 (mod p).
Modulo p, a2 + ab + nb2 ≡ b2((ac)2 + (ac) + n) ≡ 0 ≡4((ac)2 + (ac) + n) ≡ (2ac + 1)2 + 4n − 1. Hence
(1−4np
)= 1.
By Lemma,(pτ
)= 1, contradiction.
Corollary: 0 /∈ K ′n [Pays IOU in Key Lemma]Proof: Choose p an odd quadratic nonresidue by Dirichlet’stheorem, and t = 0.
What about p = 2 with(pτ
)= −1?
![Page 56: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/56.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Paying IOUs
Lemma: Let p 6= τ be odd prime with(pτ
)= −1, and t ∈ Z.
Then pt /∈ K ′n.
Proof: ABWOC, pt = a2 + ab + nb2 with gcd(a,b) = 1. If p|b,then p|a, contradiction. Hence pick c with bc ≡ 1 (mod p).
Modulo p, a2 + ab + nb2 ≡ b2((ac)2 + (ac) + n) ≡ 0 ≡4((ac)2 + (ac) + n) ≡ (2ac + 1)2 + 4n − 1. Hence
(1−4np
)= 1.
By Lemma,(pτ
)= 1, contradiction.
Corollary: 0 /∈ K ′n [Pays IOU in Key Lemma]Proof: Choose p an odd quadratic nonresidue by Dirichlet’stheorem, and t = 0.
What about p = 2 with(pτ
)= −1?
![Page 57: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/57.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Paying IOUs
Lemma: Let p 6= τ be odd prime with(pτ
)= −1, and t ∈ Z.
Then pt /∈ K ′n.
Proof: ABWOC, pt = a2 + ab + nb2 with gcd(a,b) = 1. If p|b,then p|a, contradiction. Hence pick c with bc ≡ 1 (mod p).
Modulo p, a2 + ab + nb2 ≡ b2((ac)2 + (ac) + n) ≡ 0 ≡4((ac)2 + (ac) + n) ≡ (2ac + 1)2 + 4n − 1. Hence
(1−4np
)= 1.
By Lemma,(pτ
)= 1, contradiction.
Corollary: 0 /∈ K ′n [Pays IOU in Key Lemma]Proof: Choose p an odd quadratic nonresidue by Dirichlet’stheorem, and t = 0.
What about p = 2 with(pτ
)= −1?
![Page 58: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/58.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Paying IOUs
Lemma: Let p 6= τ be odd prime with(pτ
)= −1, and t ∈ Z.
Then pt /∈ K ′n.
Proof: ABWOC, pt = a2 + ab + nb2 with gcd(a,b) = 1. If p|b,then p|a, contradiction. Hence pick c with bc ≡ 1 (mod p).
Modulo p, a2 + ab + nb2 ≡ b2((ac)2 + (ac) + n) ≡ 0 ≡4((ac)2 + (ac) + n) ≡ (2ac + 1)2 + 4n − 1. Hence
(1−4np
)= 1.
By Lemma,(pτ
)= 1, contradiction.
Corollary: 0 /∈ K ′n [Pays IOU in Key Lemma]Proof: Choose p an odd quadratic nonresidue by Dirichlet’stheorem, and t = 0.
What about p = 2 with(pτ
)= −1?
![Page 59: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/59.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Paying IOUs
Lemma: Let p 6= τ be odd prime with(pτ
)= −1, and t ∈ Z.
Then pt /∈ K ′n.
Proof: ABWOC, pt = a2 + ab + nb2 with gcd(a,b) = 1. If p|b,then p|a, contradiction. Hence pick c with bc ≡ 1 (mod p).
Modulo p, a2 + ab + nb2 ≡ b2((ac)2 + (ac) + n) ≡ 0 ≡4((ac)2 + (ac) + n) ≡ (2ac + 1)2 + 4n − 1. Hence
(1−4np
)= 1.
By Lemma,(pτ
)= 1, contradiction.
Corollary: 0 /∈ K ′n [Pays IOU in Key Lemma]Proof: Choose p an odd quadratic nonresidue by Dirichlet’stheorem, and t = 0.
What about p = 2 with(pτ
)= −1?
![Page 60: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/60.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Paying IOUs, cont.
Lemma: Let p = 2 with(pτ
)= −1, and t ∈ Z. Then 4t /∈ K ′n.
Proof: By QR, |1− 4n| = τ ≡ ±3 (mod 8), so n odd.ABWOC: 4t = a2 + ab + nb2 with gcd(a,b) = 1.
Working mod 2, we have 0 ≡ a2 + ab + b2 (mod 2). Looking atcases, must have a ≡ b ≡ 0 (mod 2). But then gcd(a,b) 6= 1, acontradiction.
![Page 61: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/61.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Paying IOUs, cont.
Lemma: Let p = 2 with(pτ
)= −1, and t ∈ Z. Then 4t /∈ K ′n.
Proof: By QR, |1− 4n| = τ ≡ ±3 (mod 8), so n odd.ABWOC: 4t = a2 + ab + nb2 with gcd(a,b) = 1.
Working mod 2, we have 0 ≡ a2 + ab + b2 (mod 2). Looking atcases, must have a ≡ b ≡ 0 (mod 2). But then gcd(a,b) 6= 1, acontradiction.
![Page 62: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/62.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Paying IOUs, cont.
Lemma: Let p = 2 with(pτ
)= −1, and t ∈ Z. Then 4t /∈ K ′n.
Proof: By QR, |1− 4n| = τ ≡ ±3 (mod 8), so n odd.ABWOC: 4t = a2 + ab + nb2 with gcd(a,b) = 1.
Working mod 2, we have 0 ≡ a2 + ab + b2 (mod 2). Looking atcases, must have a ≡ b ≡ 0 (mod 2). But then gcd(a,b) 6= 1, acontradiction.
![Page 63: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/63.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Paying the last IOU
Lemma: Let p, t ∈ N with p prime. If tp,p ∈ Kn, then t ∈ Kn.
Proof: Write tp = a2 + ab + nb2, p = c2 + cd + nd2. Wecalculate b2p − d2tp = (bc − ad)(bd + bc + ad).
Case p|(bc − ad): Write rp = bc − ad . Set y = a + rnd ,x = b− rc. Plug in for a,b, cancel, rearrange to c(x − rd) = dy .Since p ∈ K ′n, gcd(c,d) = 1, so c|y and we write y = cw . Plugin for y , cancel, rearrange to x = d(w + r). Compute(w + wr + nr2)(c + cd + nd2) = · · · = a2 + ab + nb2 = tp, sot = w2 + wr + nr2 ∈ Kn.
Case p|(bd + bc + ad): similar.
![Page 64: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/64.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Paying the last IOU
Lemma: Let p, t ∈ N with p prime. If tp,p ∈ Kn, then t ∈ Kn.
Proof: Write tp = a2 + ab + nb2, p = c2 + cd + nd2. Wecalculate b2p − d2tp = (bc − ad)(bd + bc + ad).
Case p|(bc − ad): Write rp = bc − ad . Set y = a + rnd ,x = b− rc. Plug in for a,b, cancel, rearrange to c(x − rd) = dy .Since p ∈ K ′n, gcd(c,d) = 1, so c|y and we write y = cw . Plugin for y , cancel, rearrange to x = d(w + r). Compute(w + wr + nr2)(c + cd + nd2) = · · · = a2 + ab + nb2 = tp, sot = w2 + wr + nr2 ∈ Kn.
Case p|(bd + bc + ad): similar.
![Page 65: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/65.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Paying the last IOU
Lemma: Let p, t ∈ N with p prime. If tp,p ∈ Kn, then t ∈ Kn.
Proof: Write tp = a2 + ab + nb2, p = c2 + cd + nd2. Wecalculate b2p − d2tp = (bc − ad)(bd + bc + ad).
Case p|(bc − ad): Write rp = bc − ad . Set y = a + rnd ,x = b− rc. Plug in for a,b, cancel, rearrange to c(x − rd) = dy .Since p ∈ K ′n, gcd(c,d) = 1, so c|y and we write y = cw . Plugin for y , cancel, rearrange to x = d(w + r). Compute(w + wr + nr2)(c + cd + nd2) = · · · = a2 + ab + nb2 = tp, sot = w2 + wr + nr2 ∈ Kn.
Case p|(bd + bc + ad): similar.
![Page 66: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/66.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Paying the last IOU
Lemma: Let p, t ∈ N with p prime. If tp,p ∈ Kn, then t ∈ Kn.
Proof: Write tp = a2 + ab + nb2, p = c2 + cd + nd2. Wecalculate b2p − d2tp = (bc − ad)(bd + bc + ad).
Case p|(bc − ad): Write rp = bc − ad . Set y = a + rnd ,x = b− rc. Plug in for a,b, cancel, rearrange to c(x − rd) = dy .Since p ∈ K ′n, gcd(c,d) = 1, so c|y and we write y = cw . Plugin for y , cancel, rearrange to x = d(w + r). Compute(w + wr + nr2)(c + cd + nd2) = · · · = a2 + ab + nb2 = tp, sot = w2 + wr + nr2 ∈ Kn.
Case p|(bd + bc + ad): similar.
![Page 67: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/67.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Remembering all the Lemmas
Key Lemma: Let p 6= τ be an odd, prime, quadratic residue.Then pt ∈ K ′n for some t ∈ Z. If p >
√τ3 , then also 0 < |t | < p.
Lemma: Let p 6= τ be odd prime with(pτ
)= −1, and t ∈ Z.
Then pt /∈ K ′n.
Lemma: Let p = 2 with(pτ
)= −1, and t ∈ Z. Then 4t /∈ K ′n.
Lemma: Let p, t ∈ N with p prime. If tp,p ∈ Kn, then t ∈ Kn.
![Page 68: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/68.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Main Result, Revisited
Thm: Assume Condition P. If p prime with(pτ
)= 1, then p ∈ Kn.
Proof: ABWOC, p minimal prime with(pτ
)= 1 and p /∈ Kn.
Condition P implies p >√
τ3 .
Key Lemma: Let p 6= τ be an odd, prime, quadratic residue.Then pt ∈ K ′n for some t ∈ Z. If p >
√τ3 , then also 0 < |t | < p.
Applying Key Lemma, choose |t | minimal with 0 < |t | < p andpt ∈ K ′n.
|t | = 1 impossible. So write |t | = p1p2 · · · pk , with each pi primeand pi < p.
![Page 69: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/69.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Main Result, Revisited
Thm: Assume Condition P. If p prime with(pτ
)= 1, then p ∈ Kn.
Proof: ABWOC, p minimal prime with(pτ
)= 1 and p /∈ Kn.
Condition P implies p >√
τ3 .
Key Lemma: Let p 6= τ be an odd, prime, quadratic residue.Then pt ∈ K ′n for some t ∈ Z. If p >
√τ3 , then also 0 < |t | < p.
Applying Key Lemma, choose |t | minimal with 0 < |t | < p andpt ∈ K ′n.
|t | = 1 impossible. So write |t | = p1p2 · · · pk , with each pi primeand pi < p.
![Page 70: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/70.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Main Result, Revisited
Thm: Assume Condition P. If p prime with(pτ
)= 1, then p ∈ Kn.
Proof: ABWOC, p minimal prime with(pτ
)= 1 and p /∈ Kn.
Condition P implies p >√
τ3 .
Key Lemma: Let p 6= τ be an odd, prime, quadratic residue.Then pt ∈ K ′n for some t ∈ Z. If p >
√τ3 , then also 0 < |t | < p.
Applying Key Lemma, choose |t | minimal with 0 < |t | < p andpt ∈ K ′n.
|t | = 1 impossible. So write |t | = p1p2 · · · pk , with each pi primeand pi < p.
![Page 71: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/71.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Main Result, Continued
pt ∈ K ′n, |t | = p1p2 · · · pk < p, with each pi prime and pi < p.
Lemma: Let p, t ∈ N with p prime. If tp,p ∈ Kn, then t ∈ Kn.
If pi ∈ Kn, then by Lemma p tpi∈ Kn. Write p t
pi= a2 + ab + nb2,
and now p tpi gcd(a,b)2 ∈ K ′n. Contradicts choice of t . So pi /∈ Kn.
Lemma: Let p 6= τ be odd prime with(pτ
)= −1, and t ∈ Z.
Then pt /∈ K ′n.
If pi is odd and(piτ
)= 1, contradicts choice of p. If pi is odd and(pi
τ
)= −1, by lemma, pt /∈ K ′n, a contradiction. Hence pi = 2,
i.e. |t | = 2c for some c ≥ 1.
![Page 72: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/72.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Main Result, Continued
pt ∈ K ′n, |t | = p1p2 · · · pk < p, with each pi prime and pi < p.
Lemma: Let p, t ∈ N with p prime. If tp,p ∈ Kn, then t ∈ Kn.
If pi ∈ Kn, then by Lemma p tpi∈ Kn. Write p t
pi= a2 + ab + nb2,
and now p tpi gcd(a,b)2 ∈ K ′n. Contradicts choice of t . So pi /∈ Kn.
Lemma: Let p 6= τ be odd prime with(pτ
)= −1, and t ∈ Z.
Then pt /∈ K ′n.
If pi is odd and(piτ
)= 1, contradicts choice of p. If pi is odd and(pi
τ
)= −1, by lemma, pt /∈ K ′n, a contradiction. Hence pi = 2,
i.e. |t | = 2c for some c ≥ 1.
![Page 73: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/73.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Main Result, Continued
pt ∈ K ′n, |t | = p1p2 · · · pk < p, with each pi prime and pi < p.
Lemma: Let p, t ∈ N with p prime. If tp,p ∈ Kn, then t ∈ Kn.
If pi ∈ Kn, then by Lemma p tpi∈ Kn. Write p t
pi= a2 + ab + nb2,
and now p tpi gcd(a,b)2 ∈ K ′n. Contradicts choice of t . So pi /∈ Kn.
Lemma: Let p 6= τ be odd prime with(pτ
)= −1, and t ∈ Z.
Then pt /∈ K ′n.
If pi is odd and(piτ
)= 1, contradicts choice of p. If pi is odd and(pi
τ
)= −1, by lemma, pt /∈ K ′n, a contradiction. Hence pi = 2,
i.e. |t | = 2c for some c ≥ 1.
![Page 74: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/74.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Main Result, Continued
pt ∈ K ′n, |t | = p1p2 · · · pk < p, with each pi prime and pi < p.
Lemma: Let p, t ∈ N with p prime. If tp,p ∈ Kn, then t ∈ Kn.
If pi ∈ Kn, then by Lemma p tpi∈ Kn. Write p t
pi= a2 + ab + nb2,
and now p tpi gcd(a,b)2 ∈ K ′n. Contradicts choice of t . So pi /∈ Kn.
Lemma: Let p 6= τ be odd prime with(pτ
)= −1, and t ∈ Z.
Then pt /∈ K ′n.
If pi is odd and(piτ
)= 1, contradicts choice of p. If pi is odd and(pi
τ
)= −1, by lemma, pt /∈ K ′n, a contradiction. Hence pi = 2,
i.e. |t | = 2c for some c ≥ 1.
![Page 75: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/75.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Main Result, Concluded
pt ∈ K ′n,(2τ
)= −1, |t | = 2c for some c ≥ 1.
Lemma: Let p = 2 with(pτ
)= −1, and t ∈ Z. Then 4t /∈ K ′n.
If c ≥ 2, apply Lemma to get pt /∈ K ′n, a contradiction. Hencec = 1, i.e. |t | = 2.
Finally, we are left with 2p ∈ K ′n,(2τ
)= −1. But then(2p
τ
)=(2τ
)(pτ
)= −1, a contradiction.
Thm: Assume Condition P. If p prime with(pτ
)= 1, then p ∈ Kn.
![Page 76: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/76.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Main Result, Concluded
pt ∈ K ′n,(2τ
)= −1, |t | = 2c for some c ≥ 1.
Lemma: Let p = 2 with(pτ
)= −1, and t ∈ Z. Then 4t /∈ K ′n.
If c ≥ 2, apply Lemma to get pt /∈ K ′n, a contradiction. Hencec = 1, i.e. |t | = 2.
Finally, we are left with 2p ∈ K ′n,(2τ
)= −1. But then(2p
τ
)=(2τ
)(pτ
)= −1, a contradiction.
Thm: Assume Condition P. If p prime with(pτ
)= 1, then p ∈ Kn.
![Page 77: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/77.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Main Result, Concluded
pt ∈ K ′n,(2τ
)= −1, |t | = 2c for some c ≥ 1.
Lemma: Let p = 2 with(pτ
)= −1, and t ∈ Z. Then 4t /∈ K ′n.
If c ≥ 2, apply Lemma to get pt /∈ K ′n, a contradiction. Hencec = 1, i.e. |t | = 2.
Finally, we are left with 2p ∈ K ′n,(2τ
)= −1. But then(2p
τ
)=(2τ
)(pτ
)= −1, a contradiction.
Thm: Assume Condition P. If p prime with(pτ
)= 1, then p ∈ Kn.
![Page 78: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/78.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Monoids...?
Lemma: τ ∈ Kn.
Lemma: If t 6= τ is a quadratic nonresidue mod τ , then t /∈ Kn.
Lemma: For any x ∈ N, x2 ∈ Kn.
Thm: Assume Condition P. If p prime with(pτ
)= 1, then p ∈ Kn.
Monoid irreducibles: τ , residues p, nonresidues q2, others?
![Page 79: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/79.jpg)
Background Introduction Main results Connections Future Work? Bibliography
No others
Theorem: Assume Condition P. The irreducibles in Kn ∩ N are:τ , p (for prime residues p), q2 (for prime nonresidues q).
Proof: Suppose t = p1p2 · · · pk is irreducible in Kn, of no othertype. Note k ≥ 2. If any pi ∈ Kn, then t
pi∈ Kn by Lemma,
contradicting irreducible. If any pi is odd, then by Lemmat /∈ K ′n. Since t ∈ Kn, we have t = a2 + ab + nb2 withr = gcd(a,b) > 1. But then r2, t
r2 ∈ Kn, contradictingirreducible. Hence each pi = 2. If k is even, contradictsirreducible. If k is odd, t is nonresidue.
![Page 80: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/80.jpg)
Background Introduction Main results Connections Future Work? Bibliography
No others
Theorem: Assume Condition P. The irreducibles in Kn ∩ N are:τ , p (for prime residues p), q2 (for prime nonresidues q).
Proof: Suppose t = p1p2 · · · pk is irreducible in Kn, of no othertype. Note k ≥ 2. If any pi ∈ Kn, then t
pi∈ Kn by Lemma,
contradicting irreducible. If any pi is odd, then by Lemmat /∈ K ′n. Since t ∈ Kn, we have t = a2 + ab + nb2 withr = gcd(a,b) > 1. But then r2, t
r2 ∈ Kn, contradictingirreducible. Hence each pi = 2. If k is even, contradictsirreducible. If k is odd, t is nonresidue.
![Page 81: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/81.jpg)
Background Introduction Main results Connections Future Work? Bibliography
No others
Theorem: Assume Condition P. The irreducibles in Kn ∩ N are:τ , p (for prime residues p), q2 (for prime nonresidues q).
Proof: Suppose t = p1p2 · · · pk is irreducible in Kn, of no othertype. Note k ≥ 2. If any pi ∈ Kn, then t
pi∈ Kn by Lemma,
contradicting irreducible. If any pi is odd, then by Lemmat /∈ K ′n. Since t ∈ Kn, we have t = a2 + ab + nb2 withr = gcd(a,b) > 1. But then r2, t
r2 ∈ Kn, contradictingirreducible. Hence each pi = 2. If k is even, contradictsirreducible. If k is odd, t is nonresidue.
![Page 82: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/82.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Representation Characterization
Theorem: Consider form x2 + xy + ny2, with τ = |1− 4n|prime. Assume Condition P. Natural t is represented byx2 + xy + ny2, iff every prime dividing t that is a quadraticnonresidue modulo τ , appears to an even power.
![Page 83: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/83.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Generalizing
Given a principal binary quadratic form x2 + mxy + ny2,
If τ = |m2 − 4n| is prime, then m is odd, and
using substitution[xy
]→[1 (1−m)/20 1
] [xy
]turns the form into x2 + xy + 1−m2+4n
4 y2.
Note: τ = |m2 − 4n| unchanged, monoid unchanged“Properly equivalent”
![Page 84: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/84.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Generalizing
Given a principal binary quadratic form x2 + mxy + ny2,
If τ = |m2 − 4n| is prime, then m is odd, and
using substitution[xy
]→[1 (1−m)/20 1
] [xy
]turns the form into x2 + xy + 1−m2+4n
4 y2.
Note: τ = |m2 − 4n| unchanged, monoid unchanged“Properly equivalent”
![Page 85: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/85.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Generalizing
Given a principal binary quadratic form x2 + mxy + ny2,
If τ = |m2 − 4n| is prime, then m is odd, and
using substitution[xy
]→[1 (1−m)/20 1
] [xy
]turns the form into x2 + xy + 1−m2+4n
4 y2.
Note: τ = |m2 − 4n| unchanged, monoid unchanged“Properly equivalent”
![Page 86: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/86.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Various Equivalences
proper equivalence:[xy
]→ A
[xy
]with A ∈ SLn(Z), i.e. |A| = 1
wide equivalence:[xy
]→ A
[xy
]with A ∈ GLn(Z), i.e. |A| = ±1
image equivalence: The forms share the same image in Z
(proper equiv.)→(wide equiv.)→(image equiv.)All preserve discriminant.
![Page 87: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/87.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Various Equivalences
proper equivalence:[xy
]→ A
[xy
]with A ∈ SLn(Z), i.e. |A| = 1
wide equivalence:[xy
]→ A
[xy
]with A ∈ GLn(Z), i.e. |A| = ±1
image equivalence: The forms share the same image in Z
(proper equiv.)→(wide equiv.)→(image equiv.)All preserve discriminant.
![Page 88: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/88.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Various Equivalences
proper equivalence:[xy
]→ A
[xy
]with A ∈ SLn(Z), i.e. |A| = 1
wide equivalence:[xy
]→ A
[xy
]with A ∈ GLn(Z), i.e. |A| = ±1
image equivalence: The forms share the same image in Z
(proper equiv.)→(wide equiv.)→(image equiv.)All preserve discriminant.
![Page 89: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/89.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Various Equivalences
proper equivalence:[xy
]→ A
[xy
]with A ∈ SLn(Z), i.e. |A| = 1
wide equivalence:[xy
]→ A
[xy
]with A ∈ GLn(Z), i.e. |A| = ±1
image equivalence: The forms share the same image in Z
(proper equiv.)→(wide equiv.)→(image equiv.)All preserve discriminant.
![Page 90: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/90.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Quadratic Forms
My naive approach: Given form, find its image.
Traditional approach: Given integer in image, find form thatrepresents it.
For discriminant ∆:∆ < 0: “positive definite”, h(D) = # proper equivalence classes∆ > 0: “indefinite”, h+(D) = # proper equivalence classes
“class numbers”
![Page 91: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/91.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Quadratic Forms
My naive approach: Given form, find its image.
Traditional approach: Given integer in image, find form thatrepresents it.
For discriminant ∆:∆ < 0: “positive definite”, h(D) = # proper equivalence classes∆ > 0: “indefinite”, h+(D) = # proper equivalence classes
“class numbers”
![Page 92: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/92.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Quadratic Forms
My naive approach: Given form, find its image.
Traditional approach: Given integer in image, find form thatrepresents it.
For discriminant ∆:∆ < 0: “positive definite”, h(D) = # proper equivalence classes∆ > 0: “indefinite”, h+(D) = # proper equivalence classes
“class numbers”
![Page 93: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/93.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Quadratic Forms
My naive approach: Given form, find its image.
Traditional approach: Given integer in image, find form thatrepresents it.
For discriminant ∆:∆ < 0: “positive definite”, h(D) = # proper equivalence classes∆ > 0: “indefinite”, h+(D) = # proper equivalence classes
“class numbers”
![Page 94: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/94.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Positive Definite Forms
Lemma: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. If prime p ∈ Kn, then p ≥ τ
4 .Proof: Suppose x2 + xy + ny2 = p. Quadratic formula givesx = 1
2(−y ±√−τy2 + 4p), so −τy2 + 4p ≥ 0. y = 0
impossible, so y2 ≥ 1. Hence p ≥ τ4 .
Theorem: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. Then Condition P holds iff Pτ = ∅.
Proof: Pτ ={
p prime :(pτ
)= 1,p ≤
√τ3
} ?⊆ Kn. τ
4 ≤ p ≤√
τ3
Corollary: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. Then Condition P holds iff the least prime quadraticresidue modulo τ is >
√τ3 .
![Page 95: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/95.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Positive Definite Forms
Lemma: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. If prime p ∈ Kn, then p ≥ τ
4 .Proof: Suppose x2 + xy + ny2 = p. Quadratic formula givesx = 1
2(−y ±√−τy2 + 4p), so −τy2 + 4p ≥ 0. y = 0
impossible, so y2 ≥ 1. Hence p ≥ τ4 .
Theorem: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. Then Condition P holds iff Pτ = ∅.
Proof: Pτ ={
p prime :(pτ
)= 1,p ≤
√τ3
} ?⊆ Kn. τ
4 ≤ p ≤√
τ3
Corollary: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. Then Condition P holds iff the least prime quadraticresidue modulo τ is >
√τ3 .
![Page 96: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/96.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Positive Definite Forms
Lemma: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. If prime p ∈ Kn, then p ≥ τ
4 .Proof: Suppose x2 + xy + ny2 = p. Quadratic formula givesx = 1
2(−y ±√−τy2 + 4p), so −τy2 + 4p ≥ 0. y = 0
impossible, so y2 ≥ 1. Hence p ≥ τ4 .
Theorem: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. Then Condition P holds iff Pτ = ∅.
Proof: Pτ ={
p prime :(pτ
)= 1,p ≤
√τ3
} ?⊆ Kn. τ
4 ≤ p ≤√
τ3
Corollary: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. Then Condition P holds iff the least prime quadraticresidue modulo τ is >
√τ3 .
![Page 97: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/97.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Positive Definite Forms
Lemma: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. If prime p ∈ Kn, then p ≥ τ
4 .Proof: Suppose x2 + xy + ny2 = p. Quadratic formula givesx = 1
2(−y ±√−τy2 + 4p), so −τy2 + 4p ≥ 0. y = 0
impossible, so y2 ≥ 1. Hence p ≥ τ4 .
Theorem: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. Then Condition P holds iff Pτ = ∅.
Proof: Pτ ={
p prime :(pτ
)= 1,p ≤
√τ3
} ?⊆ Kn. τ
4 ≤ p ≤√
τ3
Corollary: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. Then Condition P holds iff the least prime quadraticresidue modulo τ is >
√τ3 .
![Page 98: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/98.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Positive Definite Forms, cont.
Corollary: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. Then Condition P holds iff the least quadratic residuemodulo τ is >
√τ3 .
Theorem [Chowla Cowles Cowles 1986]: Let τ > 3 be primewith τ ≡ 3 (mod 8). Then the least prime quadratic residuemodulo τ is: {
<√
τ3 h(−τ) > 1
= τ+14 h(−τ) = 1.
For n > 0, we have (Class number 1)↔ (Condition P)
![Page 99: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/99.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Positive Definite Forms, cont.
Corollary: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. Then Condition P holds iff the least quadratic residuemodulo τ is >
√τ3 .
Theorem [Chowla Cowles Cowles 1986]: Let τ > 3 be primewith τ ≡ 3 (mod 8). Then the least prime quadratic residuemodulo τ is: {
<√
τ3 h(−τ) > 1
= τ+14 h(−τ) = 1.
For n > 0, we have (Class number 1)↔ (Condition P)
![Page 100: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/100.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Positive Definite Forms, cont.
Corollary: Consider x2 + xy + ny2, with n > 0 and τ = 4n − 1prime. Then Condition P holds iff the least quadratic residuemodulo τ is >
√τ3 .
Theorem [Chowla Cowles Cowles 1986]: Let τ > 3 be primewith τ ≡ 3 (mod 8). Then the least prime quadratic residuemodulo τ is: {
<√
τ3 h(−τ) > 1
= τ+14 h(−τ) = 1.
For n > 0, we have (Class number 1)↔ (Condition P)
![Page 101: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/101.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Positive Definite Forms Wrapup
For n > 0, we have (Class number 1)↔ (Condition P)
Theorem [Baker-Heegner-Stark]:For ∆ < 0, the (narrow) class number of Q[
√∆] = 1, iff
d ∈ {−1,−2,−3,−7,−11,−19,−43,−67,−163}
Corollary: For n > 0 and τ prime, Condition P holds iffτ ∈ {3,7,11,19,43,67,163}
![Page 102: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/102.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Positive Definite Forms Wrapup
For n > 0, we have (Class number 1)↔ (Condition P)
Theorem [Baker-Heegner-Stark]:For ∆ < 0, the (narrow) class number of Q[
√∆] = 1, iff
d ∈ {−1,−2,−3,−7,−11,−19,−43,−67,−163}
Corollary: For n > 0 and τ prime, Condition P holds iffτ ∈ {3,7,11,19,43,67,163}
![Page 103: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/103.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Indefinite Forms
For n < 0, we have (Class number 1)→ (Condition P)
If τ is prime with τ ≡ 1 (mod 4), and Q[√τ ] has narrow class
number 1, then Condition P holds.
Condition P holds for τ ∈ {5,13,17,29,37,41,53, . . .}.
Open problem: Are there infinitely many τ ≡ 1 (mod 4) withQ[√τ ] having narrow class number 1?
![Page 104: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/104.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Indefinite Forms
For n < 0, we have (Class number 1)→ (Condition P)
If τ is prime with τ ≡ 1 (mod 4), and Q[√τ ] has narrow class
number 1, then Condition P holds.
Condition P holds for τ ∈ {5,13,17,29,37,41,53, . . .}.
Open problem: Are there infinitely many τ ≡ 1 (mod 4) withQ[√τ ] having narrow class number 1?
![Page 105: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/105.jpg)
Background Introduction Main results Connections Future Work? Bibliography
Indefinite Forms
For n < 0, we have (Class number 1)→ (Condition P)
If τ is prime with τ ≡ 1 (mod 4), and Q[√τ ] has narrow class
number 1, then Condition P holds.
Condition P holds for τ ∈ {5,13,17,29,37,41,53, . . .}.
Open problem: Are there infinitely many τ ≡ 1 (mod 4) withQ[√τ ] having narrow class number 1?
![Page 106: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/106.jpg)
Background Introduction Main results Connections Future Work? Bibliography
What Happens Next. . . ?
1. Paper with Dimabayao and Tigas2. For n < 0, do we have (Class number 1)↔ (Condition P)?
(genera?)3. For n > 0, can we disprove Condition P directly?
Elementary proof of Baker-Heegner-Stark4. If Condition P fails, what can we salvage? Monoid?5. τ = 23 minimal with n > 0; τ = 229 minimal with n < 0.6. Non-principal forms, non-prime τ . . .
![Page 107: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/107.jpg)
Background Introduction Main results Connections Future Work? Bibliography
What Happens Next. . . ?
1. Paper with Dimabayao and Tigas2. For n < 0, do we have (Class number 1)↔ (Condition P)?
(genera?)3. For n > 0, can we disprove Condition P directly?
Elementary proof of Baker-Heegner-Stark4. If Condition P fails, what can we salvage? Monoid?5. τ = 23 minimal with n > 0; τ = 229 minimal with n < 0.6. Non-principal forms, non-prime τ . . .
![Page 108: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/108.jpg)
Background Introduction Main results Connections Future Work? Bibliography
What Happens Next. . . ?
1. Paper with Dimabayao and Tigas2. For n < 0, do we have (Class number 1)↔ (Condition P)?
(genera?)3. For n > 0, can we disprove Condition P directly?
Elementary proof of Baker-Heegner-Stark4. If Condition P fails, what can we salvage? Monoid?5. τ = 23 minimal with n > 0; τ = 229 minimal with n < 0.6. Non-principal forms, non-prime τ . . .
![Page 109: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/109.jpg)
Background Introduction Main results Connections Future Work? Bibliography
What Happens Next. . . ?
1. Paper with Dimabayao and Tigas2. For n < 0, do we have (Class number 1)↔ (Condition P)?
(genera?)3. For n > 0, can we disprove Condition P directly?
Elementary proof of Baker-Heegner-Stark4. If Condition P fails, what can we salvage? Monoid?5. τ = 23 minimal with n > 0; τ = 229 minimal with n < 0.6. Non-principal forms, non-prime τ . . .
![Page 110: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/110.jpg)
Background Introduction Main results Connections Future Work? Bibliography
What Happens Next. . . ?
1. Paper with Dimabayao and Tigas2. For n < 0, do we have (Class number 1)↔ (Condition P)?
(genera?)3. For n > 0, can we disprove Condition P directly?
Elementary proof of Baker-Heegner-Stark4. If Condition P fails, what can we salvage? Monoid?5. τ = 23 minimal with n > 0; τ = 229 minimal with n < 0.6. Non-principal forms, non-prime τ . . .
![Page 111: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/111.jpg)
Background Introduction Main results Connections Future Work? Bibliography
What Happens Next. . . ?
1. Paper with Dimabayao and Tigas2. For n < 0, do we have (Class number 1)↔ (Condition P)?
(genera?)3. For n > 0, can we disprove Condition P directly?
Elementary proof of Baker-Heegner-Stark4. If Condition P fails, what can we salvage? Monoid?5. τ = 23 minimal with n > 0; τ = 229 minimal with n < 0.6. Non-principal forms, non-prime τ . . .
![Page 112: Adventures in Binary Quadratic Forms - Vadim PonomarenkoMonoids and irreducibles make Vadim happy. Background Introduction Main results ConnectionsFuture Work?Bibliography My Entry](https://reader035.vdocument.in/reader035/viewer/2022071410/610501527fa61138e816171a/html5/thumbnails/112.jpg)
Background Introduction Main results Connections Future Work? Bibliography
For Further Reading
S. Chowla, J. Cowles, M. CowlesThe Least Prime Quadratic Residue and the Class NumberJ. Number Theory 22 (1986), pp. 1-3.
K. BahmanpourPrime numbers p with expression p = a2 ± ab ± b2
J. Number Theory 166 (2016), pp. 208-218.
J.T. Dimabayao, VP, O.J.Q. TigasOn Monic Binary Quadratic Formshttps://vadim.sdsu.edu/qf.pdf