Radon measure: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Daqu
Clarified statement about locally finite implying finite on compact sets
 
Line 1: Line 1:
In [[number theory]], a '''Heegner number''' is a [[Square-free integer|square-free positive integer]] ''d'' such that the imaginary [[quadratic field]] '''Q'''({{sqrt|−''d''}}) has [[ideal class group|class number]] 1. Equivalently, its [[ring of integers]] has [[unique factorization]].<ref>{{cite book
Eusebio Stanfill is what's blogged on my birth records although it is n't the name on particular birth certificate. Vermont can be where my home was. Software making has been my 24-hour period job for a despite. To farrenheit is the only hobby my wife doesn't agree to. You can believe my website here: http://circuspartypanama.com<br><br>Stop by my webpage: [http://circuspartypanama.com clash of clans hack tool]
  | last = Conway
  | first = John Horton
  | authorlink = John Horton Conway
  | coauthors = Guy, Richard K.
  | title = The Book of Numbers
  | publisher = Springer
  | year = 1996
  | page = 224
  | isbn = 0-387-97993-X }}
</ref>
 
The determination of such numbers is a special case of the [[class number problem]], and they underlie several striking results in number theory.
 
According to the [[Stark–Heegner theorem]] there are precisely nine Heegner numbers:
:{{num|1}}, {{num|2}}, {{num|3}}, {{num|7}}, {{num|11}}, {{num|19}}, {{num|43}}, {{num|67}}, {{num|163}}.
This result was conjectured by [[Carl Friedrich Gauss|Gauss]] and proven by [[Kurt Heegner]] in 1952.
 
==Euler's prime-generating polynomial==
Euler's [[Formula for primes#Prime formulas and polynomial functions|prime-generating polynomial]]
 
:<math>n^2 - n + 41, \, </math>,
 
which gives (distinct) primes for ''n''&nbsp;=&nbsp;1,&nbsp;...,&nbsp;40, is related to the Heegner number 163&nbsp;=&nbsp;4&nbsp;·&nbsp;41&nbsp;−&nbsp;1.
 
Euler's formula, with <math>n</math> taking the values  1,... 40 is equivalent to
:<math>n^2 + n + 41, \, </math>
 
with <math>n</math> taking the values  0,... 39, and Rabinowitz<ref>Rabinowitz, G. "Eindeutigkeit der Zerlegung in Primzahlfaktoren in quadratischen Zahlkörpern." Proc. Fifth Internat. Congress Math. (Cambridge) 1, 418–421, 1913.</ref> proved that
:<math>n^2 + n + p \, </math>
gives primes for <math>n=0,\dots,p-2</math> if and only if its discriminant <math>1-4p</math> equals minus a Heegner number.
 
(Note that <math>p-1</math> yields <math>p^2</math>, so <math>p-2</math> is maximal.)
1, 2, and 3 are not of the required form, so the Heegner numbers that work are <math>7, 11, 19, 43, 67, 163</math>, yielding prime generating functions of Euler's form for <math>2,3,5,11,17,41</math>; these latter numbers are called ''[[lucky numbers of Euler]]'' by [[François Le Lionnais|F. Le Lionnais]].<ref>Le Lionnais, F. Les nombres remarquables. Paris: Hermann, pp. 88 and 144, 1983.</ref>
 
==Almost integers and Ramanujan's constant==
'''Ramanujan's constant''' is the [[transcendental number]]<ref>{{MathWorld|title=Transcendental Number|urlname=TranscendentalNumber}} gives <math>e^{\pi\sqrt{d}}, d \in Z^*</math>, based on
Nesterenko, Yu. V. "On Algebraic Independence of the Components of Solutions of a System of Linear Differential Equations." Izv. Akad. Nauk SSSR, Ser. Mat. 38, 495–512, 1974. English translation in Math. USSR 8, 501–518, 1974.</ref>
<math>e^{\pi \sqrt{163}}</math>, which is an [[almost integer]], in that it is [[Mathematical coincidence#Containing pi or e and number 163|very close]] to an [[integer]]:
 
:<math>e^{\pi \sqrt{163}} = 262{,}537{,}412{,}640{,}768{,}743.99999999999925... </math><ref>[http://mathworld.wolfram.com/RamanujanConstant.html Ramanujan Constant – from Wolfram MathWorld<!-- Bot-generated title -->]</ref> <math>\approx 640320^3+744.</math>
 
This number was discovered in 1859 by the mathematician [[Charles Hermite]].<ref>{{cite book
  | last = Barrow
  | first = John D
  | title = The Constants of Nature
  | publisher = Jonathan Cape
  | year = 2002
  | location = London
  | isbn = 0-224-06135-6 }}
</ref>
In a 1975 [[April Fools' Day|April Fool]] article in ''[[Scientific American]]'' magazine,<ref>{{cite journal
  | last = Gardner
  | first = Martin
  | title = Mathematical Games
  | journal = Scientific American
  | volume = 232
  | issue = 4
  | page = 127
  | date = April 1975
  | publisher = Scientific American, Inc }}
</ref> "Mathematical Games" columnist [[Martin Gardner]] made the (hoax) claim that the number was in fact an integer, and that the Indian mathematical genius [[Srinivasa Ramanujan]] had predicted it—hence its name.
 
This coincidence is explained by [[complex multiplication]] and the [[q-expansion|''q''-expansion]] of the [[j-invariant]].
 
===Detail===
Briefly, <math>j((1+\sqrt{-d})/2)</math> is an integer for&nbsp;''d'' a Heegner number, and <math>e^{\pi \sqrt{d}} \approx -j((1+\sqrt{-d})/2) + 744</math> via the ''q''-expansion.
 
If <math>\tau</math> is a quadratic irrational, then the ''j''-invariant is an [[algebraic integer]] of degree <math>|\mbox{Cl}(\mathbf{Q}(\tau))|</math>, the [[Class number (number theory)|class number]] of <math>\mathbf{Q}(\tau)</math> and the minimal (monic integral) polynomial it satisfies is called the '''Hilbert class polynomial'''.  Thus if the imaginary quadratic extension <math>\mathbf{Q}(\tau)</math> has class number 1 (so ''d'' is a Heegner number), the ''j''-invariant is an integer.
 
The [[Q-expansion|''q''-expansion]] of ''j'', with its [[Fourier series]] expansion written as a [[Laurent series]] in terms of <math>q=\exp(2 \pi i \tau)</math>, begins as:
 
:<math>j(q) = \frac{1}{q} + 744 + 196884 q + \cdots.</math><!-- don't put thousands separators under <math>! -->
 
The coefficients <math>c_n</math> asymptotically grow as <math>\ln(c_n) \sim 4\pi \sqrt{n} + O(\ln(n))</math>, and the low order coefficients grow more slowly than <math>200000^n</math>, so for <math>q \ll 1/200000</math>, ''j'' is very well approximated by its first two terms.  Setting <math>\tau = (1+\sqrt{-163})/2</math> yields <math>q=-\exp(-\pi \sqrt{163})</math> or equivalently, <math>\frac{1}{q}=-\exp(\pi \sqrt{163})</math>.  Now <math>j((1+\sqrt{-163})/2)=(-640320)^3</math>, so,
:<math>(-640320)^3=-e^{\pi \sqrt{163}}+744+O\left(e^{-\pi \sqrt{163}}\right).</math><!-- don't put thousands separators under <math>! -->
Or,
:<math>e^{\pi \sqrt{163}}=640320^3+744+O\left(e^{-\pi \sqrt{163}}\right)</math>
where the linear term of the error is,
:<math>-196884/e^{\pi \sqrt{163}} \approx 196884/(640320^3+744)
\approx -0.00000000000075</math><!-- don't put thousands separators under <math>! -->
explaining why <math>e^{\pi \sqrt{163}}</math> is within approximately the above of being an integer.
 
==Other Heegner numbers==
For the four largest Heegner numbers, the approximations one obtains<ref>These can be checked by computing <math>\sqrt[3]{e^{\pi\sqrt{d}}-744}</math> on a calculator, and
<math>196884/e^{\pi\sqrt{d}}</math> for the linear term of the error.</ref> are as follows.
 
:<math>\begin{align}
e^{\pi \sqrt{19}}  &\approx 96^3+744-0.22\\
e^{\pi \sqrt{43}}  &\approx 960^3+744-0.00022\\
e^{\pi \sqrt{67}}  &\approx 5280^3+744-0.0000013\\
e^{\pi \sqrt{163}} &\approx 640320^3+744-0.00000000000075
\end{align}
</math><!-- don't put thousands separators under <math>! -->
 
Alternatively,<ref>http://groups.google.com.ph/group/sci.math.research/browse_thread/thread/3d24137c9a860893?hl=en#</ref>
:<math>\begin{align}
e^{\pi \sqrt{19}}  &\approx 12^3(3^2-1)^3+744-0.22\\
e^{\pi \sqrt{43}}  &\approx 12^3(9^2-1)^3+744-0.00022\\
e^{\pi \sqrt{67}}  &\approx 12^3(21^2-1)^3+744-0.0000013\\
e^{\pi \sqrt{163}} &\approx 12^3(231^2-1)^3+744-0.00000000000075
\end{align}
</math>
where the reason for the squares is due to certain [[Eisenstein series]].  For Heegner numbers <math>d < 19</math>, one does not obtain an almost integer; even <math>d = 19</math> is not noteworthy.<ref>The absolute deviation of a random real number (picked uniformly from [[unit interval|{{closed-closed|0,1|size=120%}}]], say) is a uniformly distributed variable on {{closed-closed|0, 0.5|size=120%}}, so it has [[absolute average deviation]] and [[median absolute deviation]] of 0.25, and a deviation of 0.22 is not exceptional.</ref>  The integer ''j''-invariants are highly factorisable, which follows from the <math>12^3(n^2-1)^3=(2^2\cdot 3 \cdot (n-1) \cdot (n+1))^3</math> form, and factor as,
 
:<math>\begin{align}
j((1+\sqrt{-19})/2) &= 96^3 =(2^5 \cdot 3)^3\\
j((1+\sqrt{-43})/2) &= 960^3=(2^6 \cdot 3 \cdot 5)^3\\
j((1+\sqrt{-67})/2) & =5280^3=(2^5 \cdot 3 \cdot 5 \cdot 11)^3\\
j((1+\sqrt{-163})/2) &=640320^3=(2^6 \cdot 3 \cdot 5 \cdot 23 \cdot 29)^3.
\end{align}
</math><!-- don't put thousands separators under <math>! -->
 
These [[transcendental numbers]], in addition to being closely approximated by integers, (which are simply [[algebraic numbers]] of degree&nbsp;1), can also be closely approximated by algebraic numbers of degree&nbsp;3,<ref>{{cite web|url=http://sites.google.com/site/tpiezas/001|title=Pi Formulas}}</ref>
 
:<math>\begin{align}
e^{\pi \sqrt{19}}  &\approx x^{24}-24; x^3-2x-2=0\\
e^{\pi \sqrt{43}}  &\approx x^{24}-24; x^3-2x^2-2=0\\
e^{\pi \sqrt{67}}  &\approx x^{24}-24; x^3-2x^2-2x-2=0\\
e^{\pi \sqrt{163}} &\approx x^{24}-24; x^3-6x^2+4x-2=0
\end{align}
</math>
 
The [[root of a function|roots]] of the cubics can be exactly given by quotients of the [[Dedekind eta function]] ''η''(''τ''), a modular function involving a 24th root, and which explains the 24 in the approximation.  In addition, they can also be closely approximated by algebraic numbers of degree 4,<ref>{{cite web|url=http://sites.google.com/site/tpiezas/ramanujan|title=Extending Ramanujan's Dedekind Eta Quotients}}</ref>
 
:<math>\begin{align}
e^{\pi \sqrt{19}}  &\approx 3^5 \left(3-\sqrt{2(-3+1\sqrt{3\cdot19})} \right)^{-2}-12.00006\dots\\
e^{\pi \sqrt{43}}  &\approx 3^5 \left(9-\sqrt{2(-39+7\sqrt{3\cdot43})} \right)^{-2}-12.000000061\dots\\
e^{\pi \sqrt{67}}  &\approx 3^5 \left(21-\sqrt{2(-219+31\sqrt{3\cdot67})} \right)^{-2}-12.00000000036\dots\\
e^{\pi \sqrt{163}}  &\approx 3^5 \left(231-\sqrt{2(-26679+2413\sqrt{3\cdot163})} \right)^{-2}-12.00000000000000021\dots
\end{align}
</math>
 
Note the reappearance of the integers <math>n = 3, 9, 21, 231</math> as well as the fact that,
 
:<math>\begin{align}
&2^6 \cdot 3(-3^2+3 \cdot 19 \cdot 1^2) = 96^2\\
&2^6 \cdot 3(-39^2+3 \cdot 43 \cdot 7^2) = 960^2\\
&2^6 \cdot 3(-219^2+3 \cdot 67 \cdot 31^2) = 5280^2\\
&2^6 \cdot 3(-26679^2+3 \cdot 163 \cdot 2413^2) = 640320^2
\end{align}
</math><!-- don't put thousands separators under <math>! -->
 
which, with the appropriate fractional power, are precisely the j-invariants.  As well as for algebraic numbers of degree&nbsp;6,
 
:<math>\begin{align}
e^{\pi \sqrt{19}}  &\approx (5x)^3-6.000010\dots\\
e^{\pi \sqrt{43}}  &\approx (5x)^3-6.000000010\dots\\
e^{\pi \sqrt{67}}  &\approx (5x)^3-6.000000000061\dots\\
e^{\pi \sqrt{163}} &\approx (5x)^3-6.000000000000000034\dots
\end{align}
</math>
 
where the ''x''s are given respectively by the appropriate root of the [[sextic equation]]s,
 
:<math>\begin{align}
&5x^6-96x^5-10x^3+1=0\\
&5x^6-960x^5-10x^3+1=0\\
&5x^6-5280x^5-10x^3+1=0\\
&5x^6-640320x^5-10x^3+1=0
\end{align}
</math><!-- don't put thousands separators under <math>! -->
 
with the j-invariants appearing again.  These sextics are not only algebraic, they are also [[Solvable group|solvable]] in [[Nth root|radicals]] as they factor into two [[Cubic equation|cubics]] over the extension <math>\mathbb{Q}\sqrt{5}</math> (with the first factoring further into two [[Quadratic equation|quadratics]]). These algebraic approximations can be ''exactly'' expressed in terms of Dedekind eta quotients. As an example, let <math>\tau = (1+\sqrt{-163})/2</math>, then,
 
:<math>\begin{align}
e^{\pi \sqrt{163}} &= \left( \frac{e^{\pi i/24} \eta(\tau)}{\eta(2\tau)} \right)^{24}-24.00000000000000105\dots\\
e^{\pi \sqrt{163}} &= \left( \frac{e^{\pi i/12} \eta(\tau)}{\eta(3\tau)} \right)^{12}-12.00000000000000021\dots\\
e^{\pi \sqrt{163}} &= \left( \frac{e^{\pi i/6} \eta(\tau)}{\eta(5\tau)} \right)^{6}-6.000000000000000034\dots
\end{align}
</math>
 
where the eta quotients are the algebraic numbers given above.
 
==Consecutive primes==
Given an odd prime&nbsp;''p'', if one computes <math>k^2 \pmod{p}</math> for <math>k=0,1,\dots,(p-1)/2</math> (this is sufficient because <math>(p-k)^2\equiv k^2 \pmod{p}</math>), one gets consecutive composites, followed by consecutive primes, if and only if ''p'' is a Heegner number.<ref>http://www.mathpages.com/home/kmath263.htm</ref>
 
For details, see "Quadratic Polynomials Producing Consecutive Distinct Primes and Class Groups of Complex Quadratic Fields" by Richard Mollin.
 
==Notes and references==
<references />
 
==External links==
* {{MathWorld|title=Heegner Number|urlname=HeegnerNumber}}
* {{SloanesRef |sequencenumber=A003173|name=Heegner numbers: imaginary quadratic fields with unique factorization}}
* [http://www.ams.org/bull/1985-13-01/S0273-0979-1985-15352-2/S0273-0979-1985-15352-2.pdf Gauss' Class Number Problem for Imaginary Quadratic Fields, by Dorian Goldfeld]: Detailed history of problem.
* {{cite web|last=Clark|first=Alex|title=163 and Ramanujan Constant|url=http://www.numberphile.com/videos/163.html|work=Numberphile|publisher=[[Brady Haran]]}}
 
[[Category:Algebraic number theory]]

Latest revision as of 01:25, 17 October 2014

Eusebio Stanfill is what's blogged on my birth records although it is n't the name on particular birth certificate. Vermont can be where my home was. Software making has been my 24-hour period job for a despite. To farrenheit is the only hobby my wife doesn't agree to. You can believe my website here: http://circuspartypanama.com

Stop by my webpage: clash of clans hack tool