Cahen's constant

From testwiki
Revision as of 16:46, 11 November 2024 by imported>Dyspophyr (Continued fraction expansion: link -> simple continued fraction, and link earlier)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description In mathematics, Cahen's constant is defined as the value of an infinite series of unit fractions with alternating signs:

C=i=0(1)isi1=1112+16142+118060.643410546288... Template:OEIS

Here (si)i0 denotes Sylvester's sequence, which is defined recursively by

s0=2;si+1=1+j=0isj for i0.

Combining these fractions in pairs leads to an alternative expansion of Cahen's constant as a series of positive unit fractions formed from the terms in even positions of Sylvester's sequence. This series for Cahen's constant forms its greedy Egyptian expansion:

C=1s2i=12+17+11807+110650056950807+

This constant is named after Template:Ill (also known for the Cahen–Mellin integral), who was the first to introduce it and prove its irrationality.Template:Sfnp

Continued fraction expansion

The majority of naturally occurring[1] mathematical constants have no known simple patterns in their continued fraction expansions.Template:Sfnp Nevertheless, the complete continued fraction expansion of Cahen's constant C is known: it is C=[a02;a12,a22,a32,a42,]=[0;1,1,1,4,9,196,16641,] where the sequence of coefficients Template:Bi is defined by the recurrence relation a0=0,a1=1,an+2=an(1+anan+1)n0. All the partial quotients of this expansion are squares of integers. Davison and Shallit made use of the continued fraction expansion to prove that C is transcendental.Template:Sfnp

Alternatively, one may express the partial quotients in the continued fraction expansion of Cahen's constant through the terms of Sylvester's sequence: To see this, we prove by induction on n1 that 1+anan+1=sn1. Indeed, we have 1+a1a2=2=s0, and if 1+anan+1=sn1 holds for some n1, then

1+an+1an+2=1+an+1an(1+anan+1)=1+anan+1+(anan+1)2=sn1+(sn11)2=sn12sn1+1=sn,where we used the recursion for (an)n0 in the first step respectively the recursion for (sn)n0 in the final step. As a consequence, an+2=ansn1 holds for every n1, from which it is easy to conclude that

C=[0;1,1,1,s02,s12,(s0s2)2,(s1s3)2,(s0s2s4)2,].

Best approximation order

Cahen's constant C has best approximation order q3. That means, there exist constants K1,K2>0 such that the inequality 0<|Cpq|<K1q3 has infinitely many solutions (p,q)×, while the inequality 0<|Cpq|<K2q3 has at most finitely many solutions (p,q)×. This implies (but is not equivalent to) the fact that C has irrationality measure 3, which was first observed by Template:Harvtxt.

To give a proof, denote by (pn/qn)n0 the sequence of convergents to Cahen's constant (that means, qn1=an for every n1).[2]

But now it follows from an+2=ansn1and the recursion for (sn)n0 that

an+2an+12=ansn1an12sn22=anan12sn22sn2+1sn12=anan12(11sn1+1sn12)

for every n1. As a consequence, the limits

α:=limnq2n+1q2n2=n=0(11s2n+1s2n2) and β:=limnq2n+2q2n+12=2n=0(11s2n+1+1s2n+12)

(recall that s0=2) both exist by basic properties of infinite products, which is due to the absolute convergence of n=0|1sn1sn2|. Numerically, one can check that 0<α<1<β<2. Thus the well-known inequality

1qn(qn+qn+1)|Cpnqn|1qnqn+1

yields

|Cp2n+1q2n+1|1q2n+1q2n+2=1q2n+13q2n+2q2n+12<1q2n+13 and |Cpnqn|1qn(qn+qn+1)>1qn(qn+2qn2)13qn3

for all sufficiently large n. Therefore C has best approximation order 3 (with K1=1 and K2=1/3), where we use that any solution (p,q)× to

0<|Cpq|<13q3

is necessarily a convergent to Cahen's constant.

Notes

Template:Reflist

References

Template:Irrational number

  1. A number is said to be naturally occurring if it is *not* defined through its decimal or continued fraction expansion. In this sense, e.g., Euler's number e=limn(1+1n)n is naturally occurring.
  2. Template:Cite OEIS