Density of integers which are discriminants of cyclic fields of odd prime degree (Q704967): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00013-004-1043-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2167561466 / rank | |||
Normal rank | |||
Latest revision as of 01:19, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Density of integers which are discriminants of cyclic fields of odd prime degree |
scientific article |
Statements
Density of integers which are discriminants of cyclic fields of odd prime degree (English)
0 references
20 January 2005
0 references
Let \(q\) be an odd prime. The authors obtain an asymptotic formula for the number of integers \(\leq x\) which are product of distinct primes \(\equiv1\bmod\;q\). This is used to show that the number of discriminants \(\leq x\) of cyclic fields of degree \(q\) is asymptotically equal to \(E(q)x/\log^cx\) with a rather complicated constant \(E(q)\) and \(c=(q-2)/(q-1)\).
0 references
cyclic fields
0 references
discriminants
0 references
