Somos' quadratic recurrence constant

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematical analysis and number theory, Somos' quadratic recurrence constant or simply Somos' constant is a constant defined as an expression of infinitely many nested square roots. It arises when studying the asymptotic behaviour of a certain sequence[1] and also in connection to the binary representations of real numbers between zero and one.[2] The constant named after Michael Somos. It is defined by:

σ=12345⋯

which gives a numerical value of approximately:[3]

σ=1.661687949633594121295… Template:OEIS.

Sums and products

Somos' constant can be alternatively defined via the following infinite product:

σ=∏k=1∞k1/2k=11/221/431/841/16…

This can be easily rewritten into the far more quickly converging product representation

σ=(21)1/2(32)1/4(43)1/8(54)1/16…

which can then be compactly represented in infinite product form by:

σ=∏k=1∞(1+1k)1/2k

Another product representation is given by:[4]

σ=∏n=1∞∏k=0n(k+1)(−1)k+n(nk)

Expressions for ln⁡σ Template:OEIS include:[4][5]

ln⁡σ=∑k=1∞ln⁡k2k
ln⁡σ=∑k=1∞(−1)k+1kLik(12)
ln⁡σ2=∑k=1∞12k(ln⁡(1+1k)−1k)

Integrals

Integrals for ln⁡σ are given by:[4][6]

ln⁡σ=∫011−x(x−2)ln⁡xdx
ln⁡σ=∫01∫01−x(2−xy)ln⁡(xy)dxdy

Other formulas

The constant σ arises when studying the asymptotic behaviour of the sequence[1]

g0=1
gn=ngn−12,n≥1

with first few terms 1, 1, 2, 12, 576, 1658880, ... Template:OEIS. This sequence can be shown to have asymptotic behaviour as follows:[4]

gn∼σ2n(n+2−n−1+4n−2−21n−3+138n−4+O(n−5))−1

Guillera and Sondow give a representation in terms of the derivative of the Lerch transcendent Φ(z,s,q):[6]

ln⁡σ=−12∂Φ∂s(1/2,0,1)

If one defines the Euler-constant function (which gives Euler's constant for z=1) as:

γ(z)=∑n=1∞zn−1(1n−ln⁡(n+1n))

one has:[7][8][9]

γ(12)=2ln⁡2σ

Universality

One may define a "continued binary expansion" for all real numbers in the set (0,1], similarly to the decimal expansion or simple continued fraction expansion. This is done by considering the unique base-2 representation for a number x∈(0,1] which does not contain an infinite tail of 0's (for example write one half as 0.01111...2 instead of 0.12). Then define a sequence (ak)⊆ℕ which gives the difference in positions of the 1's in this base-2 representation. This expansion for x is now given by:[10]

x=⟨a1,a2,a3,...⟩

The geometric means of the terms of Pi and e appear to tend to Somos' constant.

For example the fractional part of Pi we have:

{π}=0.141592653589793...=0.001001000011111...2 Template:OEIS

The first 1 occurs on position 3 after the radix point. The next 1 appears three places after the first one, the third 1 appears five places after the second one, etc. By continuing in this manner, we obtain:

π−3=⟨3,3,5,1,1,1,1...⟩ Template:OEIS

This gives a bijective map (0,1]↦ℕℕ, such that for every real number x∈(0,1] we uniquely can give:[10]

x=⟨a1,a2,a3,...⟩:⇔x=∑k=1∞2−(a1+...+ak)

It can now be proven that for almost all numbers x∈(0,1] the limit of the geometric mean of the terms ak converges to Somos' constant. That is, for almost all numbers in that interval we have:[2]

σ=limn→∞a1a2...ann

Somos' constant is universal for the "continued binary expansion" of numbers x∈(0,1] in the same sense that Khinchin's constant is universal for the simple continued fraction expansions of numbers x∈ℝ.

Generalizations

The generalized Somos' constants may be given by:

σt=∏k=1∞k1/tk=11/t21/t231/t341/t4…

for t>1.

The following series holds:

ln⁡σt=∑k=1∞ln⁡ktk

We also have a connection to the Euler-constant function:[8]

γ(1t)=tln⁡(t(t−1)σtt−1)

and the following limit, where γ is Euler's constant:

limt→0+tσt+1t=e−γ

See also

References

Template:Reflist