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 and also in connection to the binary representations of real numbers between zero and one.[1] The constant named after Michael Somos. It is defined by:
\sigma=\sqrt{1\sqrt{2\sqrt{3\sqrt{4\sqrt{5 … }}}}}
which gives a numerical value of approximately:[2]
\sigma=1.661687949633594121295...
Somos' constant can be alternatively defined via the following infinite product:
infty | |
\sigma=\prod | |
k=1 |
1/2k | |
k |
=11/2 21/4 31/8 41/16...
This can be easily rewritten into the far more quickly converging product representation
\sigma=\left(
2 | |
1 |
\right)1/2\left(
3 | |
2 |
\right)1/4\left(
4 | |
3 |
\right)1/8\left(
5 | |
4 |
\right)1/16...
which can then be compactly represented in infinite product form by:
\sigma=
infty | |
\prod | |
k=1 |
\left(1+
1 | |
k |
1/2k | |
\right) |
\sigma=
n | |
\prod | |
k=0 |
(-1)k+n\binom{n | |
(k+1) |
{k}}
ln\sigma
ln\sigma=
infty | |
\sum | |
k=1 |
lnk | |
2k |
ln\sigma=
infty | |
\sum | |
k=1 |
(-1)k+1 | |
k |
Lik\left(\tfrac12\right)
ln
\sigma2 | |
= |
infty | |
\sum | |
k=1 |
1 | \left(ln\left(1+ | |
2k |
1 | \right)- | |
k |
1k\right) | |
Integrals for
ln\sigma
ln\sigma=
1 | |
\int | |
0 |
1-x | |
(x-2)lnx |
dx
ln\sigma=
1 | |
\int | |
0 |
1 | |
\int | |
0 |
-x | |
(2-xy)ln(xy) |
dxdy
The constant
\sigma
g0=1
gn=n
2, | |
g | |
n-1 |
n\ge1
with first few terms 1, 1, 2, 12, 576, 1658880, ... . This sequence can be shown to have asymptotic behaviour as follows:
gn\sim
2n | |
{\sigma |
\Phi(z,s,q)
ln\sigma=-
1 | |
2 |
\partial\Phi | |
\partials |
\left(1/2,0,1\right)
z=1
infty | |
\gamma(z)=\sum | |
n=1 |
zn-1\left(
1n | ln\left( | |
- |
n+1 | |
n |
\right)\right)
\gamma(\tfrac12)=2ln | 2 |
\sigma |
(0,1]
x\in(0,1]
0.01111...2
0.12
(ak)\sube\N
x
x=\langlea1,a2,a3,...\rangle
For example the fractional part of Pi we have:
\{\pi\}=0.141592653589793...=0.001001000011111...2
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:
\pi-3=\langle3,3,5,1,1,1,1...\rangle
This gives a bijective map
(0,1]\mapsto\N\N
x\in(0,1]
x=\langlea1,a2,a3,...\rangle:\Leftrightarrowx=\sum
infty | |
k=1 |
-(a1+...+ak) | |
2 |
It can now be proven that for almost all numbers
x\in(0,1]
ak
\sigma=\limn\toinfty\sqrt[n]{a1a2...an}
Somos' constant is universal for the "continued binary expansion" of numbers
x\in(0,1]
x\in\R
The generalized Somos' constants may be given by:
\sigmat=\prod
infty | |
k=1 |
1/tk | |
k |
=11/t
1/t2 | |
2 |
1/t3 | |
3 |
1/t4 | |
4 |
...
t>1
The following series holds:
ln\sigmat=\sum
infty | |
k=1 |
lnk | |
tk |
\gamma(\tfrac1t)=tln\left( | t | |||||
|
\right)
\gamma
\lim | |
t\to0+ |
t | |
t\sigma | |
t+1 |
=e-\gamma