How did Gauss conjecture there were nine Heegner numbers?How does topology enter Number theory and how we can grasp its essence?Irreducibility of cyclotomic polynomials via schemesShow that $mathbb Q(sqrt p) notsimeqmathbb Q(sqrt q)$Extending the set of algebraic numbersIntuition in studying splitting and ramification of prime idealsUsing quadratic reciprocity to motivate higher reciprocity laws?Euler prime generating polynomial and Heegner numbersIs Algebraic Number Theory still an active research field?Number of ways to sum two Egyptian fractions and satisfy a given inequality.How did Gauss find the units of the cubic field $Q[n^1/3]$?
After Brexit, will the EU recognize British passports that are valid for more than ten years?
Sort array by month and year
Is this Paypal Github SDK reference really a dangerous site?
Why do phishing e-mails use faked e-mail addresses instead of the real one?
Why aren't there more Gauls like Obelix?
Can I frame a new window without adding jack studs?
How to educate team mate to take screenshots for bugs with out unwanted stuff
Inorganic chemistry handbook with reaction lists
Are small insurances worth it?
Paper published similar to PhD thesis
Professor forcing me to attend a conference, I can't afford even with 50% funding
Geological Explanation for an Unusually Temperate Northern Mountain Valley
Why isn't P and P/poly trivially the same?
Short story about an infectious indestructible metal bar?
Rationale to prefer local variables over instance variables?
Use Mercury as quenching liquid for swords?
Should I apply for my boss's promotion?
What can I do if someone tampers with my SSH public key?
Short story about cities being connected by a conveyor belt
Has a sovereign Communist government ever run, and conceded loss, on a fair election?
I am the light that shines in the dark
Can I negotiate a patent idea for a raise, under French law?
How to install "rounded" brake pads
Tabular environment - text vertically positions itself by bottom of tikz picture in adjacent cell
How did Gauss conjecture there were nine Heegner numbers?
How does topology enter Number theory and how we can grasp its essence?Irreducibility of cyclotomic polynomials via schemesShow that $mathbb Q(sqrt p) notsimeqmathbb Q(sqrt q)$Extending the set of algebraic numbersIntuition in studying splitting and ramification of prime idealsUsing quadratic reciprocity to motivate higher reciprocity laws?Euler prime generating polynomial and Heegner numbersIs Algebraic Number Theory still an active research field?Number of ways to sum two Egyptian fractions and satisfy a given inequality.How did Gauss find the units of the cubic field $Q[n^1/3]$?
$begingroup$
Coming from someone not very knowledgable in algebraic number theory it seems odd. At the time they didn't have the computing power to determine whether very high values (>>163) were Heegner numbers; so, why even assume there was a finite amount rather than infinite (let alone exactly the nine there are)?
algebraic-number-theory
$endgroup$
add a comment |
$begingroup$
Coming from someone not very knowledgable in algebraic number theory it seems odd. At the time they didn't have the computing power to determine whether very high values (>>163) were Heegner numbers; so, why even assume there was a finite amount rather than infinite (let alone exactly the nine there are)?
algebraic-number-theory
$endgroup$
add a comment |
$begingroup$
Coming from someone not very knowledgable in algebraic number theory it seems odd. At the time they didn't have the computing power to determine whether very high values (>>163) were Heegner numbers; so, why even assume there was a finite amount rather than infinite (let alone exactly the nine there are)?
algebraic-number-theory
$endgroup$
Coming from someone not very knowledgable in algebraic number theory it seems odd. At the time they didn't have the computing power to determine whether very high values (>>163) were Heegner numbers; so, why even assume there was a finite amount rather than infinite (let alone exactly the nine there are)?
algebraic-number-theory
algebraic-number-theory
asked yesterday
Joshua FarrellJoshua Farrell
654219
654219
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Gauss had plenty of computing power. He calculated class numbers up to 2000, and found they got scarcer as he climbed higher, with none at all after 163. That seemed enough to conjecture there weren't any more.
Gauss was working with quadratic forms, rather than quadratic fields, and the bigger the discriminant, the easier it was to find inequivalent forms, so it stood to reason that eventually there would be no discriminants with just one class of forms.
$endgroup$
$begingroup$
So other than just simply computing a lot there was no strong evidence to suggest there couldn't be another?
$endgroup$
– Joshua Farrell
yesterday
add a comment |
$begingroup$
The first answer is that he did not. Gauss worked with binary quadratic forms with even middle coefficient (the determinant of a form $Ax^2 + 2Bxy + Cy^2$ is $B^2 - AC$), so some of his class numbers actually are ring class numbers modulo $2$ (equal to $3h$, where $h$ is the usual class number). In the Disquisitiones (art. 303) he gives a list, of which I give an extract here:
$$ beginarrayc
h & rm determinant \ hline
1 & 1, 2, 3, 4, 7 \
3 & 11, 19, 23, 27, 31, 43, 67, 163
endarray $$
It is of course easy to transfer this to our usual class numbers,
which is where the nine value up to $163$ are coming from.
In Gauss's case, proving that there are only finitely many determinants
with Gauss class number $1$ is actually quite easy; the difficult
part is showing that those with Gauss class number $3$ are finite.
Gauss also observed that there seem to be only finitely many determinants with given small class numbers.
In addition to computational evidence Gauss also knew that the class number of his forms gros asymptotically as
$$ gamma sqrtD - delta, $$
where $gamma = 2pi/7e$ and $delta = 2/pi^2$ (art. 302).
$endgroup$
$begingroup$
I was hoping you would come to this question!
$endgroup$
– Gerry Myerson
yesterday
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3138747%2fhow-did-gauss-conjecture-there-were-nine-heegner-numbers%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Gauss had plenty of computing power. He calculated class numbers up to 2000, and found they got scarcer as he climbed higher, with none at all after 163. That seemed enough to conjecture there weren't any more.
Gauss was working with quadratic forms, rather than quadratic fields, and the bigger the discriminant, the easier it was to find inequivalent forms, so it stood to reason that eventually there would be no discriminants with just one class of forms.
$endgroup$
$begingroup$
So other than just simply computing a lot there was no strong evidence to suggest there couldn't be another?
$endgroup$
– Joshua Farrell
yesterday
add a comment |
$begingroup$
Gauss had plenty of computing power. He calculated class numbers up to 2000, and found they got scarcer as he climbed higher, with none at all after 163. That seemed enough to conjecture there weren't any more.
Gauss was working with quadratic forms, rather than quadratic fields, and the bigger the discriminant, the easier it was to find inequivalent forms, so it stood to reason that eventually there would be no discriminants with just one class of forms.
$endgroup$
$begingroup$
So other than just simply computing a lot there was no strong evidence to suggest there couldn't be another?
$endgroup$
– Joshua Farrell
yesterday
add a comment |
$begingroup$
Gauss had plenty of computing power. He calculated class numbers up to 2000, and found they got scarcer as he climbed higher, with none at all after 163. That seemed enough to conjecture there weren't any more.
Gauss was working with quadratic forms, rather than quadratic fields, and the bigger the discriminant, the easier it was to find inequivalent forms, so it stood to reason that eventually there would be no discriminants with just one class of forms.
$endgroup$
Gauss had plenty of computing power. He calculated class numbers up to 2000, and found they got scarcer as he climbed higher, with none at all after 163. That seemed enough to conjecture there weren't any more.
Gauss was working with quadratic forms, rather than quadratic fields, and the bigger the discriminant, the easier it was to find inequivalent forms, so it stood to reason that eventually there would be no discriminants with just one class of forms.
answered yesterday
Gerry MyersonGerry Myerson
147k8149302
147k8149302
$begingroup$
So other than just simply computing a lot there was no strong evidence to suggest there couldn't be another?
$endgroup$
– Joshua Farrell
yesterday
add a comment |
$begingroup$
So other than just simply computing a lot there was no strong evidence to suggest there couldn't be another?
$endgroup$
– Joshua Farrell
yesterday
$begingroup$
So other than just simply computing a lot there was no strong evidence to suggest there couldn't be another?
$endgroup$
– Joshua Farrell
yesterday
$begingroup$
So other than just simply computing a lot there was no strong evidence to suggest there couldn't be another?
$endgroup$
– Joshua Farrell
yesterday
add a comment |
$begingroup$
The first answer is that he did not. Gauss worked with binary quadratic forms with even middle coefficient (the determinant of a form $Ax^2 + 2Bxy + Cy^2$ is $B^2 - AC$), so some of his class numbers actually are ring class numbers modulo $2$ (equal to $3h$, where $h$ is the usual class number). In the Disquisitiones (art. 303) he gives a list, of which I give an extract here:
$$ beginarrayc
h & rm determinant \ hline
1 & 1, 2, 3, 4, 7 \
3 & 11, 19, 23, 27, 31, 43, 67, 163
endarray $$
It is of course easy to transfer this to our usual class numbers,
which is where the nine value up to $163$ are coming from.
In Gauss's case, proving that there are only finitely many determinants
with Gauss class number $1$ is actually quite easy; the difficult
part is showing that those with Gauss class number $3$ are finite.
Gauss also observed that there seem to be only finitely many determinants with given small class numbers.
In addition to computational evidence Gauss also knew that the class number of his forms gros asymptotically as
$$ gamma sqrtD - delta, $$
where $gamma = 2pi/7e$ and $delta = 2/pi^2$ (art. 302).
$endgroup$
$begingroup$
I was hoping you would come to this question!
$endgroup$
– Gerry Myerson
yesterday
add a comment |
$begingroup$
The first answer is that he did not. Gauss worked with binary quadratic forms with even middle coefficient (the determinant of a form $Ax^2 + 2Bxy + Cy^2$ is $B^2 - AC$), so some of his class numbers actually are ring class numbers modulo $2$ (equal to $3h$, where $h$ is the usual class number). In the Disquisitiones (art. 303) he gives a list, of which I give an extract here:
$$ beginarrayc
h & rm determinant \ hline
1 & 1, 2, 3, 4, 7 \
3 & 11, 19, 23, 27, 31, 43, 67, 163
endarray $$
It is of course easy to transfer this to our usual class numbers,
which is where the nine value up to $163$ are coming from.
In Gauss's case, proving that there are only finitely many determinants
with Gauss class number $1$ is actually quite easy; the difficult
part is showing that those with Gauss class number $3$ are finite.
Gauss also observed that there seem to be only finitely many determinants with given small class numbers.
In addition to computational evidence Gauss also knew that the class number of his forms gros asymptotically as
$$ gamma sqrtD - delta, $$
where $gamma = 2pi/7e$ and $delta = 2/pi^2$ (art. 302).
$endgroup$
$begingroup$
I was hoping you would come to this question!
$endgroup$
– Gerry Myerson
yesterday
add a comment |
$begingroup$
The first answer is that he did not. Gauss worked with binary quadratic forms with even middle coefficient (the determinant of a form $Ax^2 + 2Bxy + Cy^2$ is $B^2 - AC$), so some of his class numbers actually are ring class numbers modulo $2$ (equal to $3h$, where $h$ is the usual class number). In the Disquisitiones (art. 303) he gives a list, of which I give an extract here:
$$ beginarrayc
h & rm determinant \ hline
1 & 1, 2, 3, 4, 7 \
3 & 11, 19, 23, 27, 31, 43, 67, 163
endarray $$
It is of course easy to transfer this to our usual class numbers,
which is where the nine value up to $163$ are coming from.
In Gauss's case, proving that there are only finitely many determinants
with Gauss class number $1$ is actually quite easy; the difficult
part is showing that those with Gauss class number $3$ are finite.
Gauss also observed that there seem to be only finitely many determinants with given small class numbers.
In addition to computational evidence Gauss also knew that the class number of his forms gros asymptotically as
$$ gamma sqrtD - delta, $$
where $gamma = 2pi/7e$ and $delta = 2/pi^2$ (art. 302).
$endgroup$
The first answer is that he did not. Gauss worked with binary quadratic forms with even middle coefficient (the determinant of a form $Ax^2 + 2Bxy + Cy^2$ is $B^2 - AC$), so some of his class numbers actually are ring class numbers modulo $2$ (equal to $3h$, where $h$ is the usual class number). In the Disquisitiones (art. 303) he gives a list, of which I give an extract here:
$$ beginarrayc
h & rm determinant \ hline
1 & 1, 2, 3, 4, 7 \
3 & 11, 19, 23, 27, 31, 43, 67, 163
endarray $$
It is of course easy to transfer this to our usual class numbers,
which is where the nine value up to $163$ are coming from.
In Gauss's case, proving that there are only finitely many determinants
with Gauss class number $1$ is actually quite easy; the difficult
part is showing that those with Gauss class number $3$ are finite.
Gauss also observed that there seem to be only finitely many determinants with given small class numbers.
In addition to computational evidence Gauss also knew that the class number of his forms gros asymptotically as
$$ gamma sqrtD - delta, $$
where $gamma = 2pi/7e$ and $delta = 2/pi^2$ (art. 302).
edited 16 hours ago
answered yesterday
franz lemmermeyerfranz lemmermeyer
7,19422047
7,19422047
$begingroup$
I was hoping you would come to this question!
$endgroup$
– Gerry Myerson
yesterday
add a comment |
$begingroup$
I was hoping you would come to this question!
$endgroup$
– Gerry Myerson
yesterday
$begingroup$
I was hoping you would come to this question!
$endgroup$
– Gerry Myerson
yesterday
$begingroup$
I was hoping you would come to this question!
$endgroup$
– Gerry Myerson
yesterday
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3138747%2fhow-did-gauss-conjecture-there-were-nine-heegner-numbers%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown