几类无理数的无理测度

梁志斌,  王煜伦

Irrationality measures of several types of irrational numbers

LIANG Zhibin,  WANG Yulun

梁志斌, 王煜伦. 几类无理数的无理测度 [J]. 首都师范大学学报(自然科学版), 2024, 45(1): 116-123. DOI: 10.19789/j.1004-9398.2024.01.011
引用本文: 梁志斌, 王煜伦. 几类无理数的无理测度 [J]. 首都师范大学学报(自然科学版), 2024, 45(1): 116-123. DOI: 10.19789/j.1004-9398.2024.01.011
LIANG Zhibin, WANG Yulun. Irrationality measures of several types of irrational numbers [J]. Journal of Capital Normal University (Natural Science Edition), 2024, 45(1): 116-123. DOI: 10.19789/j.1004-9398.2024.01.011
Citation: LIANG Zhibin, WANG Yulun. Irrationality measures of several types of irrational numbers [J]. Journal of Capital Normal University (Natural Science Edition), 2024, 45(1): 116-123. DOI: 10.19789/j.1004-9398.2024.01.011

几类无理数的无理测度

  • 中图分类号: O156.6

Irrationality measures of several types of irrational numbers

doi: 10.19789/j.1004-9398.2024.01.011
More Information
  • 摘要: 本文使用广义连分数去逼近$\mathrm{e}^r, \tan (r), \tanh (r), r \in \mathbf{Q}^* $, 判定他们是无理数, 以及计算出其无理性测度为2。

     

    Abstract: This paper uses generalized continued fractions to approximate $\mathrm{e}^r, \tan (r), \tanh (r), r \in \mathbf{Q}^* $ and shows that they are irrational numbers, and their irrationality measures are 2.

     

  • To measure 'irrationality' of an irrational number $ \xi $, we define irrationality measure of $ \xi $ by $ \mu =\mu \left(\xi \right) $:

    $$ \begin{gathered} \mu =\mathrm{i}\mathrm{n}\mathrm{f}\left\{v:\left|\xi -\frac{p}{q}\right|\le {q}^{-v}\mathrm{h}\mathrm{o}\mathrm{l}\mathrm{d}\mathrm{s}\ \mathrm{o}\mathrm{n}\mathrm{l}\mathrm{y}\ \mathrm{f}\mathrm{o}\mathrm{r}\ \mathrm{a}\ \mathrm{f}\mathrm{i}\mathrm{n}\mathrm{i}\mathrm{t}\mathrm{e}\ \mathrm{n}\mathrm{u}\mathrm{m}\mathrm{b}\mathrm{e}\mathrm{r}\right.\\ \left.\mathrm{o}\mathrm{f}\ \mathrm{r}\mathrm{a}\mathrm{t}\mathrm{i}\mathrm{o}\mathrm{n}\mathrm{a}\mathrm{l}\ \mathrm{n}\mathrm{u}\mathrm{m}\mathrm{b}\mathrm{e}\mathrm{r}\frac{p}{q}\right\}. \end{gathered} $$

    To obtain the irrationality measure of $ {\mathrm{e}}^{r} $, Bundschuh[1] used Hypergeometric series

    $$ {}_{1}{F}_{1}(a;b;x)=\sum\limits_{j=0}^{\mathrm{\infty }}\frac{{x}^{j}}{j!}{\prod }_{i=0}^{j=1}\frac{a+i}{b+i} . $$

    It satisfies

    $$ {}_{1}{F}_{1}(a;b;x)={\mathrm{e}}_{1}^{x}{F}_{1}(b-a;b;-x) . $$ (1)

    He defined

    $$ {P}_{r}\left(x\right)=\sum\limits_{j=0}^{r}\left(\begin{array}{c}2r-j\\ r\end{array}\right)\frac{{(-x)}^{j}}{j!}, {Q}_{r}\left(x\right)={P}_{r}(-x), $$
    $$ {R}_{2r+1}\left(x\right)=\frac{{(-1)}^{r}}{2}\sum\limits_{j=2r+1}^{\mathrm{\infty }}\left(\begin{array}{c}j-r-1\\ r\end{array}\right)\frac{{(-x)}^{j}}{j!}, $$
    $$ {S}_{2r+1}\left(x\right)={\mathrm{e}}^{-x}{R}_{2r+1}(-x)-{R}_{2r+1}\left(x\right). $$

    Using equation (1) with $ a=-r, b=2a $, he got an equality

    $$ {P}_{r}\left(x\right)-{\mathrm{e}}^{-x}{Q}_{r}\left(x\right)={S}_{2r+1}\left(x\right), $$

    where $ {S}_{2r+1}\left(x\right)=\frac{{(-1)}^{r}{x}^{2r+1}}{(2r+1)!}+\mathrm{h}\mathrm{i}\mathrm{g}\mathrm{h}\mathrm{e}\mathrm{r} $ $ \mathrm{o}\mathrm{r}\mathrm{d}\mathrm{e}\mathrm{r} $. Hence he got the rational relation of $ {P}_{r}\left(x\right) $ and $ {Q}_{r}\left(x\right) $. Consequently, he obtained a rational approximation of $ {\mathrm{e}}^{r} $. Then he used the rational approximation to show the irrationality measure of $ {\mathrm{e}}^{r}(r\in {\mathbf{Q}}^{\mathrm{*}}) $ is 2. Actually, one has the following theorem.

    Theorem 1 For each $ r\in {\mathbf{Q}}^{\mathrm{*}} $, $ {\mathrm{e}}^{r} $ is irrational, and the irrationality measure of $ {\mathrm{e}}^{r} $ is 2.

    In order to obtain the irrational measure of a number, it is necessary to give its good rationality approximation. Continued fraction is a tool for good rational approximations of real numbers. In fact, continued fraction can provide the best rational approximation. However, it is difficult to obtain the continued fraction expansion of $ {\mathrm{e}}^{r} $ with $ r\in {\mathbf{Q}}^{\mathrm{*}} $.

    Hence we turn to generalized continued fraction. We define GCF by

    $$ {b}_{0}+\frac{{a}_{1}}{{b}_{1}+\frac{{a}_{2}}{{b}_{2}+\frac{{a}_{3}}{{b}_{3}+\cdots }}}. $$

    And we also write

    $$ {b}_{0}+\frac{{a}_{1}}{{b}_{1}}+\frac{{a}_{2}}{{b}_{2}}+\frac{{a}_{3}}{{b}_{3}}+\cdots . $$

    Let $ {P}_{n} $ and $ {Q}_{n} $ be the numerator and denominator of the $ n\mathrm{t}\mathrm{h} $ convergent, respectively. We say that the general continued fraction is convergent if $ \underset{n\to \mathrm{\infty }}{\mathrm{l}\mathrm{i}\mathrm{m}}\frac{{P}_{n}}{{Q}_{n}} $ exists and is finite. GCF degenerates into continued fraction when $ {a}_{1}={a}_{2}=\cdots =1 $. Therefore, GCF can be regarded as a generalization of continued fraction. But this generalization is not trivial.

    GCF was first proposed by Euler[2]. He regarded GCF as a supplementary of infinite series. Lambert used GCF of $ \mathrm{t}\mathrm{a}\mathrm{n}x $ to prove that $ \mathrm{\pi } $ is irrational[3]. Lagrange proposed a method for the solution of differential equations with the help of GCF[4]. Gauss[5] derived from complex-valued hypergeometric functions that are now called Gauss's continued fractions. They can be used to express many elementary functions and some more advanced functions. Apréy[6] proved that $ \xi \left(3\right) $ is irrational using a fast convergent GCF of $ \xi \left(3\right) $.

    Actually, we can get the GCF of $ {\mathrm{e}}^{r} $ with $ r\in {\mathbf{Q}}^{\mathrm{*}} $ through some less difficult steps. For example, an essential version using recursive formula of linear differential equation can be viewed in reference [4]. For the sake of brevity in this paper, we use a trick using the Bessel function $ {J}_{v}\left(x\right) $ which we will define in Section 2. Then we get the GCF of $ {\mathrm{e}}^{r} $. The above results show that GCF is not an ordinary generalization of continued fraction since it is difficult to get the continued fraction of $ {\mathrm{e}}^{r} $.

    Meanwhile, we recall for the nth convergent $ \frac{{P}_{n}}{{Q}_{n}} $ in continued fraction that

    $$ \left|\alpha -\frac{{P}_{n}}{{Q}_{n}}\right| < \frac{1}{{Q}_{n}{Q}_{n+1}}, $$

    where α is a real number. Similarly, in GCF, we have

    $$ \left|\alpha -\frac{{P}_{n}}{{Q}_{n}}\right| < \frac{{a}_{1}{a}_{2}\cdots {a}_{n+1}}{{Q}_{n}{Q}_{n+1}}. $$

    Actually, $ {a}_{n} $ in the GCF of $ {\mathrm{e}}^{r} $ is far less than $ {Q}_{n} $. Exactly, $ \frac{{a}_{1}{a}_{2}\cdots {a}_{n+1}}{{Q}_{n}{Q}_{n+1}} $ is approximately equal to $ \frac{1}{{Q}_{n}{Q}_{n+1}} $ in the GCF of $ {\mathrm{e}}^{r} $. The fact makes sure that we can treat the GCF of $ {\mathrm{e}}^{r} $ as continued fraction approximately. Hence it is not hard to get the good rational approximation of $ {\mathrm{e}}^{r} $. This shows the similarity between GCF and continued fraction.

    By using GCF instead of hypergeometric series used by Bundschuh, we reprove Theorem 0.1 due to the fact that the GCF of $ {\mathrm{e}}^{r} $ converges quickly. Incidentally, we get their rationality measures of tanr, tanhr with $ r\in {\mathbf{Q}}^{\mathrm{*}} $. Significantly, our fast convergence GCF of $ {\mathrm{e}}^{r} $, $ \mathrm{t}\mathrm{a}\mathrm{n}r $, $ \mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}r $ can directly derive irrationality due to Lemma 1 which means rational number cannot be well approximated by rational number. Actually we have the following theorem.

    Theorem 2 For $ r\in {\mathbf{Q}}^{\mathrm{*}} $ we have

    (1) tanr is irrational, whose irrationality measure is 2,

    (2) tanhr is irrational, whose irrationality measure is 2.

    Outline We provide necessary results for irrationality measures in Section 1. We give basic properties of GCF in Section 2. In this section we also give the GCF of $ {\mathrm{e}}^{r} $, $ \mathrm{t}\mathrm{a}\mathrm{n}r $ and $ \mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}r $. We prove our main theorem in Section 3.

    Lemma 1 Let $ \theta $ be a real number. If there are infinitely many rational $ \frac{{p}_{n}}{{q}_{n}}(n=\mathrm{1, 2}, \cdots ) $ such that $ {q}_{n}\theta -{p}_{n}\ne 0 $ and $ {q}_{n}\theta -{p}_{n}\to 0 $(when $ n\to \mathrm{\infty } $). Then $ \theta $ is irrational.

    Proof Our argument comes from reference [7], and we have organized it for the convenience of readers. Assume $ \theta $ is rational. Let $ d $ be the denominator of $ \theta $. Then $ d\left({q}_{n}\theta -{p}_{n}\right)\in \mathbf{Z} $. It means $ d\left|{q}_{n}\theta -{p}_{n}\right|\ge 1 $, which contradicts $ {q}_{n}\theta -{p}_{n}\to 0 $(when $ n\to \mathrm{\infty } $).

    Lemma 2 If there is an integer $ {q}_{0} > 0 $ such that

    $$ \left|\xi -\frac{p}{q}\right| > C{q}^{-a} . $$

    When $ q > {q}_{0} $, then $ \mu \left(\xi \right)\le a $.

    Proof The proof process can be found in reference [7], and we have organized it for the convenience of readers. If $ C\ge 1 $, then there are only a finite number of rational $ \frac{p}{q} $ satisfying

    $$ \left|\xi -\frac{p}{q}\right|\le {q}^{-a} . $$

    It implies $ \mu \left(\xi \right)\le a $.

    If $ C\le 1 $, we take an arbitrary $ \varepsilon $ such that $ {q}_{0} > {C}^{{}^{-1}\!\!\diagup\!\!{}_{\varepsilon}\;} $. Then there are only a finite number of rational $ \frac{p}{q} $ satisfying

    $$ \left|\xi -\frac{p}{q}\right|\le {q}^{-(a+\varepsilon )} . $$

    It implies $ \mu \left(\xi \right)\le a+\varepsilon $. Since $ \varepsilon $ is arbitrary, $ \mu \left(\xi \right)\le a $.

    Lemma 3 If $ \xi $ is irrational, then $ \mu \left(\xi \right)\ge 2 $.

    Proof The proof process can be found in reference [7], and we have organized it for the convenience of readers. Let $ Q > 1 $ be an integer. Divide [0, 1] into $ Q $ subintervals:

    $$ \left[0, \frac{1}{Q}\right), \left[\frac{1}{Q}, \frac{2}{Q}\right), \dots , \left[\frac{Q-1}{Q}, 1\right]. $$

    By the pigeonhole principle, at least two of the $ Q+1 $ real numbers $ 0, \left\{\xi \right\}, \left\{2\xi \right\}, \cdots , \left\{\left(Q-1\right)\xi \right\} $ are in the same subinterval. Denote them by $ a, b $. Write $ a={r}_{1}\xi +{s}_{1}, b={r}_{2}\xi +{s}_{2} $ with $ {r}_{1}, {r}_{2}\in \left\{\mathrm{0, 1}, \cdots , Q-1\right\} $. Then

    $$ \left|a-b\right|=\left|\left({r}_{1}-{r}_{2}\right)\xi -({s}_{2}-{s}_{1})\right|\le \frac{1}{Q}. $$

    Assume $ {r}_{1} > {r}_{2} $. Put $ q={r}_{1}-{r}_{2} $ and $ q={s}_{1}-{s}_{2}. $ Then $ 0 < q < Q $ and

    $$ \left|\xi -\frac{p}{q}\right|\le {q}^{-(a+\varepsilon )}. $$

    We claim that there are infinitely many rational $ \frac{p}{q}, (p, q)=1 $, and

    $$ \left|\xi -\frac{p}{q}\right|\le \frac{1}{Qq} < \frac{1}{{q}^{2}}. $$ (2)

    If not, $ \xi =\frac{p}{q} $ when $ Q\to +\mathrm{\infty } $, contradicting that $ \xi $ is an irrational number. It means $ \mu \left(\xi \right)\ge 2 $ due to (2).

    Theorem 3 Given $ \alpha \in \mathbf{R} $, assume that there exists a constant $ h\ge 1 $, an increasing function $ g:\mathbf{N}\to {\mathbf{R}}_{+}^{\mathrm{*}} $ and a rational sequence $ \frac{{p}_{n}}{{q}_{n}} $ of diophantine approximation of $ \alpha $ satisfying

    $$ \forall n\in \mathbf{{\rm N}}, {q}_{n}{p}_{n+1}-{q}_{n+1}{p}_{n}\ne 0, $$ (3)
    $$ \forall n\in \mathbf{N}, \left|{q}_{n}\alpha -{p}_{n}\right|\ll 1/g\left(n\right), $$ (4)
    $$ \forall n\in \mathbf{N}, \left|{q}_{n}\alpha -{p}_{n}\right|\ll 1/g\left(n\right), $$ (5)
    $$ g\left(0\right)=1, \underset{n\to +\mathrm{\infty }}{\mathrm{l}\mathrm{i}\mathrm{m}}g\left(n\right)=+\mathrm{\infty }, $$ (6)
    $$ \forall n\in \mathbf{N}, g(n+1)\ll (g{\left(n\right))}^{h}. $$ (7)

    Then we have:

    (1) for every rational $ \frac{p}{q} $ with $ q > 0 $,

    $$ \left|\alpha -\frac{p}{q}\right|\gg \frac{1}{{q}^{\mu }}, $$

    where $ \mu =a{h}^{2}+1. $

    (2) the irrationality measure of $ \alpha $ satisfies $ \mu \left(\alpha \right)\le a{h}^{2}+1. $

    Proof (1) Our argument is essentially identical to reference [8]. We give the detail for completeness. Let $ (p, q)\in \mathbf{Z}\times {\mathbf{N}}^{\mathrm{*}} $ be given. Let $ v $ be the smallest integer satisfying $ q\left|{q}_{v}\alpha -{p}_{v}\right|\ll \frac{q}{g\left(v\right)} < \frac{\mathrm{1}}{\mathrm{2}}. $ This can be done because of equations(5), (6) and the fact $ g\left(n\right) $ is increasing. From equation(4) we deduce that $ g\left(v\right)\ll {q}^{h} $. Using equation(4) again we obtain

    $$ g\left(v\right) < g(v+1)\ll {q}^{{h}^{2}}. $$ (8)

    Now we consider the determinant

    $$ {\varDelta }_{v}=\left|\begin{array}{cc}{q}_{v}& {p}_{v}\\ {q}_{v+1}& {p}_{v+1}\end{array}\right|. $$

    From equation (3) we get $ {\varDelta }_{\mathrm{v}}\ne 0 $ which means the vectors $ ({q}_{v}, {p}_{v}) $ and $ ({q}_{v+1}, {p}_{v+1}) $ form a basis of $ {\mathbf{R}}^{2} $. Thus at least one of the two determinants

    $$ \left|\begin{array}{cc}{q}_{v}& {p}_{v}\\ q& p\end{array}\right|, \left|\begin{array}{cc}{q}_{v+1}& {p}_{v+1}\\ q& p\end{array}\right| $$

    is not equal to 0. Let $ m=v $ or $ v+1 $ be such that $ {\delta }_{m}=\left|\begin{array}{cc}{q}_{m}& {p}_{m}\\ q& p\end{array}\right|\ne 0. $ Obviously $ {\delta }_{m}\in \mathbf{Z}, $so $ \left|\delta \right|\ge 1 $ which means $ \left|p{q}_{m}-q{p}_{m}\right|\ge 1. $ Thus

    $$ \left|q({q}_{m}\alpha -{p}_{m})-{q}_{m}(q\alpha -p)\right|\ge 1. $$

    By the triangle inequality,

    $$ q\left|\left({q}_{m}\alpha -{p}_{m}\right)\right|+\left|{q}_{m}\right|\left|(q\alpha -p)\right|\ge 1. $$

    By the definitions of $ v $ and $ m $, we have

    $$ \left|{q}_{m}\right|\left|(q\alpha -p)\right| > \frac{1}{2}. $$ (9)

    By equations (5) and (8), we obtain $ \left|{q}_{m}\right|\ll (g{\left(m\right))}^{a}\ll $ $ {q}^{a{h}^{2}}. $ By equation (9) we have

    $$ \left|\alpha -\frac{p}{q}\right|\gg \frac{1}{{q}^{\mu }}, $$

    where $ \mu =a{h}^{2}+1. $

    (2) It can be deduced from Lemma 2.

    Proposition 1 For GCF

    $$ {b}_{0}+\frac{{a}_{1}}{{b}_{1}}+\frac{{a}_{2}}{{b}_{2}}+\frac{{a}_{3}}{{b}_{3}}+\cdots , $$

    we have

    (1) $ {P}_{n}={b}_{n}{P}_{n-1}+{a}_{n}{P}_{n-2}, {Q}_{n}={b}_{n}{Q}_{n-1}+{a}_{n}{Q}_{n-2}, (n\ge 2), $

    (2) $ {P}_{n}{Q}_{n-1}-{Q}_{n}{P}_{n-1}={(-1)}^{n+1}{a}_{1}{a}_{2}\cdots {a}_{n}, (n\ge 1), $

    (3) $ \frac{{P}_{n}}{{Q}_{n}}-\frac{{P}_{n-1}}{{Q}_{n-1}}={(-1)}^{n+1}\frac{{a}_{1}{a}_{2}\cdots {a}_{n}}{{Q}_{n-1}{Q}_{n}}, $

    (4) $ \frac{{P}_{k}}{{Q}_{k}}=\frac{{P}_{0}}{{Q}_{0}}+\frac{{a}_{1}}{{Q}_{0}{Q}_{1}}-\frac{{a}_{1}{a}_{2}}{{Q}_{1}{Q}_{2}}+\cdots +{(-1)}^{k+1}\frac{{a}_{1}{a}_{2}\cdots {a}_{k}}{{Q}_{k-1}{Q}_{k}}.$

    Proof (1) Immediately,

    $$ \frac{{P}_{0}}{{Q}_{0}}=\frac{{b}_{0}}{1}, \frac{{P}_{1}}{{Q}_{1}}=\frac{{b}_{0}{b}_{1}+{a}_{1}}{{b}_{1}} \text{,} $$
    $$ \frac{{P}_{2}}{{Q}_{2}}=\frac{{b}_{0}{b}_{1}{b}_{2}+{b}_{0}{a}_{2}+{a}_{1}{b}_{2}}{{b}_{1}{b}_{2}+{a}_{2}}=\frac{{b}_{2}{P}_{1}+{a}_{2}{P}_{0}}{{b}_{2}{Q}_{1}+{a}_{2}{Q}_{0}} . $$

    Now we use an inductive argument. Assume equation(1) is correct for $ n $. Then

    $$ \begin{array}{c}\frac{{P}_{n+1}}{{Q}_{n+1}}=\frac{\left({b}_{n}+\frac{{a}_{n+1}}{{b}_{n+1}}\right){P}_{n-1}+{a}_{n}{P}_{n-2}}{\left({b}_{n}+\frac{{a}_{n+1}}{{b}_{n+1}}\right){Q}_{n-1}+{a}_{n}{Q}_{n-2}}=\\ \frac{{b}_{n+1}\left({b}_{n}{P}_{n-1}+{a}_{n}{P}_{n-2}\right)+{a}_{n+1}{P}_{n-1}}{{b}_{n+1}\left({b}_{n}{Q}_{n-1}+{a}_{n}{Q}_{n-2}\right)+{a}_{n+1}{Q}_{n-1}}=\\ \frac{{b}_{n+1}{P}_{n}+{a}_{n+1}{P}_{n-1}}{{b}_{n+1}{Q}_{n}+{a}_{n+1}{Q}_{n-1}}.\end{array} $$

    (2) Immediately, $ {P}_{1}{Q}_{0}-{Q}_{1}{P}_{0}={a}_{1}. $ Assume equation(1) is correct for $ n $. Then

    $$ \begin{array}{c}{P}_{n+1}{Q}_{n}-{Q}_{n+1}{P}_{n}=\\ \left({b}_{n+1}{P}_{n}+{a}_{n+1}{P}_{n-1}\right){Q}_{n}-\left({b}_{n+1}{Q}_{n}+{a}_{n+1}{Q}_{n-1}\right){P}_{n}=\\ -{a}_{n+1}\left({P}_{n}{Q}_{n-1}-{Q}_{n}{P}_{n-1}\right)=\\ {(-1)}^{n+2}{a}_{1}{a}_{2}\dots {a}_{n+1}.\end{array} $$

    (3) Use equation(2).

    (4) Add the equalities in equation(3) from $ n=1 $ to $ n=k $.

    Lemma 4 For GCF

    $$ \alpha ={b}_{0}+\frac{{a}_{1}}{{b}_{1}}+\frac{{a}_{2}}{{b}_{2}}+\frac{{a}_{3}}{{b}_{3}}+\cdots , $$

    we have

    $$ \alpha ={b}_{0}+\frac{{p}_{1}{a}_{1}}{{p}_{1}{b}_{1}}+\frac{{p}_{1}{p}_{2}{a}_{2}}{{p}_{2}{b}_{2}}+\cdots +\frac{{p}_{n-1}{p}_{n}{a}_{n}}{{p}_{n}{b}_{n}}+\cdots . $$

    Proof $ \alpha ={b}_{0}+\frac{{p}_{1}{a}_{1}}{{p}_{1}{b}_{1}}+\frac{{p}_{1}{a}_{2}}{{b}_{2}}+\frac{{a}_{3}}{{b}_{3}}+\cdots = $

    $$ \begin{array}{c}{b}_{0}+\frac{{p}_{1}{a}_{1}}{{p}_{1}{b}_{1}}+\frac{{p}_{1}{p}_{2}{a}_{2}}{{p}_{2}{b}_{2}}+\frac{{p}_{2}{a}_{3}}{{b}_{3}}+\cdots =\\ \cdots \cdots \\ {b}_{0}+\frac{{p}_{1}{a}_{1}}{{p}_{1}{b}_{1}}+\frac{{p}_{1}{p}_{2}{a}_{2}}{{p}_{2}{b}_{2}}+\cdots +\frac{{p}_{n-1}{p}_{n}{a}_{n}}{{p}_{n}{b}_{n}}+\cdots .\end{array} $$

    We define the Bessel function $ {J}_{v}\left(x\right)(x\in \mathbf{C}) $ for every $ v > -\ 1 $ by

    $$ {J}_{v}\left(x\right)={\left(\frac{x}{2}\right)}^{v}\sum\limits_{k=0}^{+\mathrm{\infty }}\frac{{(-1)}^{k}}{k!\mathrm{\Gamma }(v+k+1)}{\left(\frac{x}{2}\right)}^{2k} \text{,} $$

    where $ \mathrm{\Gamma }\left(v\right) $ is the gamma function.

    Proposition 2 For the Bessel function $ {J}_{v} $, we have

    (1) ${J}_{\frac{1}{2}}\left(x\right)=\sqrt{\frac{2}{\mathrm{\pi }}}{x}^{-\frac{1}{2}}\mathrm{s}\mathrm{i}\mathrm{n}x, $

    (2) ${J}_{-\frac{1}{2}}\left(x\right)=\sqrt{\frac{2}{\mathrm{\pi }}}{x}^{-\frac{1}{2}}\mathrm{c}\mathrm{o}\mathrm{s}x, $

    (3) $ {J}_{v-1}\left(x\right)-{J}_{v+1}\left(x\right)=\left(\frac{2v}{x}\right){J}_{v}\left(x\right), $ for $ x\ne 0 $ and $ v > 0, $

    (4) $ {J}_{v}\left(x\right)\sim {\left(\frac{x}{2}\right)}^{v}/\mathrm{\Gamma }(v+1). $ In particular, $ {J}_{v}\left(x\right)\ne 0(v > -\ 1) $ for $ x\ne 0. $

    Proof This can be referred to reference [3], but it does not give full details. We provide a complete proof here.

    (1) By the definitions of the Bessel function $ {J}_{v} $, observing $ \mathrm{\Gamma }(v+1)=v\mathrm{\Gamma }\left(v\right), $ $ \mathrm{\Gamma }\left(\frac{1}{2}\right)=\sqrt{\mathrm{\pi }} $ and $ \mathrm{\Gamma }(k+\frac{3}{2})=(2k+1)!\ !\sqrt{\mathrm{\pi }}/{2}^{k+1} $ with $ k\in \mathbf{N}, $ we obtain

    $$ \begin{array}{c}{J}_{\frac{1}{2}}\left(x\right)={\left(\frac{x}{2}\right)}^{\frac{1}{2}}\sum\limits_{k=0}^{+\mathrm{\infty }}\frac{{(-1)}^{k}}{k!\mathrm{\Gamma }(k+\frac{3}{2})}{\left(\frac{x}{2}\right)}^{2k}=\\ {x}^{-\frac{1}{2}}\sqrt{\frac{2}{\mathrm{\pi }}}\sum\limits_{k=0}^{+\mathrm{\infty }}\frac{{(-1)}^{k}}{\left(2k\right)!!(2k+1)!!}{x}^{2k+1}=\\ {x}^{-\frac{1}{2}}\sqrt{\frac{2}{\mathrm{\pi }}}\mathrm{s}\mathrm{i}\mathrm{n}x.\end{array} $$

    (2) By the definition of the Bessel function $ {J}_{v} $, observing $ \mathrm{\Gamma }(k+\frac{1}{2})=(2k-1)!!\sqrt{\mathrm{\pi }}/{2}^{k} $ with $ k\in \mathbf{N}, $ we obtain

    $$ \begin{array}{c}{J}_{-\frac{1}{2}}\left(x\right)={\left(\frac{x}{2}\right)}^{-\frac{1}{2}}\sum\limits_{k=0}^{+\mathrm{\infty }}\frac{{(-1)}^{k}}{k!\mathrm{\Gamma }(k+\frac{1}{2})}{\left(\frac{x}{2}\right)}^{2k}=\\ {x}^{-\frac{1}{2}}\sqrt{\frac{2}{\mathrm{\pi }}}\sum\limits_{k=0}^{+\mathrm{\infty }}\frac{{(-1)}^{k}}{\left(2k\right)!!(2k-1)!!}{x}^{2k}=\\ {x}^{-\frac{1}{2}}\sqrt{\frac{2}{\mathrm{\pi }}}\mathrm{c}\mathrm{o}\mathrm{s}x.\end{array} $$

    (3) Observing $ \mathrm{\Gamma }(v+k+1)=(v+k)\mathrm{\Gamma }(v+k), $ we have

    $$ {J}_{v-1}\left(x\right)={\left(\frac{x}{2}\right)}^{v-1}\sum\limits_{k=0}^{+\mathrm{\infty }}\frac{{(-1)}^{k}}{k!\mathrm{\Gamma }(v+k)}{\left(\frac{x}{2}\right)}^{2k}= $$
    $$ {\left(\frac{x}{2}\right)}^{v-1}\sum\limits_{k=0}^{+\mathrm{\infty }}\frac{{(-1)}^{k}(v+k)}{k!\mathrm{\Gamma }(v+k+1)}{\left(\frac{x}{2}\right)}^{2k}= $$
    $$ v{\left(\frac{x}{2}\right)}^{v-1}\sum\limits_{k=0}^{+\mathrm{\infty }}\frac{{(-1)}^{k}}{k!\mathrm{\Gamma }(v+k+1)}{\left(\frac{x}{2}\right)}^{2k}+ $$
    $$ {\left(\frac{x}{2}\right)}^{v-1}\sum\limits_{k=0}^{+\mathrm{\infty }}\frac{{(-1)}^{k}k}{k!\mathrm{\Gamma }(v+k+1)}{\left(\frac{x}{2}\right)}^{2k}= $$
    $$ \frac{2v}{x}{J}_{v}\left(x\right)+{\left(\frac{x}{2}\right)}^{v-1}\sum\limits_{k=1}^{+\mathrm{\infty }}\frac{{(-1)}^{k}}{(k-1)!\mathrm{\Gamma }(v+k+1)}{\left(\frac{x}{2}\right)}^{2k}= $$
    $$ \frac{2v}{x}{J}_{v}\left(x\right)-{\left(\frac{x}{2}\right)}^{v+1}\sum\limits_{k=0}^{+\mathrm{\infty }}\frac{{(-1)}^{k}}{k!\mathrm{\Gamma }(v+k+2)}{\left(\frac{x}{2}\right)}^{2k}= $$
    $$ \frac{2v}{x}{J}_{v}\left(x\right)-{J}_{v+1}\left(x\right), $$

    where $ x\ne 0. $

    (4) By the definitions of the Bessel function $ {J}_{v} $,

    $$ {J}_{v}\left(x\right)/{\left(\frac{x}{2}\right)}^{v}=\frac{1}{\mathrm{\Gamma }(v+1)}+\left(-\frac{1}{1!\mathrm{\Gamma }(v+2)}{\left(\frac{x}{2}\right)}^{2}+\frac{1}{2!\mathrm{\Gamma }(v+3)}{\left(\frac{x}{2}\right)}^{4}+\dots \right)\text{,} $$ (10)

    denote the series of parentheses in the above equation by $ A $. Noting that $ \mathrm{\Gamma }(v+1)=v\mathrm{\Gamma }\left(v\right) $ with $ v > 0 $ since $ \mathrm{\Gamma }(v+1)=v\mathrm{\Gamma }\left(v\right) $ and denoting $ {\left(\frac{\left|x\right|}{2}\right)}^{2} $ by $ t $, we have

    $$ \begin{array}{c}\left|A\right|\le \frac{1}{\mathrm{\Gamma }(v+2)}\frac{1}{1!}t+\frac{1}{\mathrm{\Gamma }(v+2)}\frac{1}{2!}{t}^{2}+\\ \frac{1}{\mathrm{\Gamma }(v+2)}\frac{1}{3!}{t}^{3}+\cdots =\\ \frac{1}{\mathrm{\Gamma }(v+2)}({\mathrm{e}}^{t}-1)=\frac{1}{(v+1)\mathrm{\Gamma }(v+1)}({\mathrm{e}}^{t}-1).\end{array} $$

    The final equality is due to

    $$ \mathrm{\Gamma }(v+2)=(v+1)\mathrm{\Gamma }(v+1). $$

    By equation (10),

    $$ {J}_{v}\left(x\right)\sim{\left(\frac{x}{2}\right)}^{v}/\mathrm{\Gamma }(v+1), $$

    Then

    $$ \frac{{J}_{v+1}\left(x\right)}{{J}_{v}\left(x\right)}\sim\frac{x}{2(v+1)}. $$ (11)

    Furthermore, assume $ {J}_{v}\left(x\right)\ne 0 $ for some $ x\ne 0 $ and $ v={v}_{0}-1 > -\ \ \ \ 1. $ By equation(3), we have

    $$ {J}_{{v}_{0}+1}\left(x\right)=\frac{2{v}_{0}}{x}{J}_{{v}_{0}}\left(x\right). $$

    Using equation(3) again, we have

    $$ \begin{gathered} {J}_{{v}_{0}+2}\left(x\right)=\frac{2\left({v}_{0}+1\right)}{x}{J}_{{v}_{0}+1}\left(x\right)-{J}_{{v}_{0}}\left(x\right)=\\ \left(\frac{2\left({v}_{0}+1\right)}{x}\frac{2{v}_{0}}{x}-1\right){J}_{{v}_{0}}\left(x\right). \end{gathered} $$

    We can deduce that

    $$ \frac{{J}_{v+1}\left(x\right)}{{J}_{v}\left(x\right)}\sim\frac{2v}{x} , $$

    contradicting with equation (11).

    Lemma 5

    (1) $ \mathrm{t}\mathrm{a}\mathrm{n}x=\frac{x}{1}-\frac{{x}^{2}}{3}-\frac{{x}^{2}}{5}-\cdots -\frac{{x}^{2}}{2n+1}-\cdots , $

    (2) For $ r=\frac{u}{v}, \mathrm{t}\mathrm{a}\mathrm{n}r=\frac{u}{v}-\frac{{u}^{2}}{3v}-\frac{{u}^{2}}{5v}-\cdots -\frac{{u}^{2}}{(2n+1)v}-\cdots . $

    Proof (1) The method of proof is attributed to reference [8], but it is only sketched in the place cited. For completeness, we provide a complete proof. Using equations(3) and (4) of Proposition 2, for $ x\ne 0 $, we have

    $$ \frac{{J}_{v-1}\left(x\right)}{{J}_{v}\left(x\right)}=\frac{2v}{x}-\frac{{J}_{v+1}\left(x\right)}{{J}_{v}\left(x\right)}. $$

    Hence

    $$ \frac{{J}_{v}\left(x\right)}{{J}_{v-1}\left(x\right)}=\frac{1}{\frac{2v}{x}-\frac{{J}_{v+1}\left(x\right)}{{J}_{v}\left(x\right)}}, $$

    then

    $$ \frac{{J}_{v}\left(x\right)}{{J}_{v-1}\left(x\right)}=\frac{1}{\frac{2v}{x}}-\frac{1}{\frac{2(v+1)}{x}}-\frac{1}{\frac{2(v+2)}{x}}-\cdots . $$

    Using Lemma 4 and putting $ {p}_{1}={p}_{2}={p}_{3}=\cdots =x, $ we obtain

    $$ \frac{{J}_{v}\left(x\right)}{{J}_{v-1}\left(x\right)}=\frac{x}{2v}-\frac{{x}^{2}}{2v+2}-\frac{{x}^{2}}{2v+4}-\cdots . $$

    Setting $ v=\frac{1}{2} $ in above equation and using equations (1) and (2) of Proposition 2, we get

    $$ \mathrm{t}\mathrm{a}\mathrm{n}x=\frac{x}{1}-\frac{{x}^{2}}{3}-\frac{{x}^{2}}{5}-\cdots \frac{{x}^{2}}{2n+1}-\cdots . $$

    (2) Use Lemma 4 and put $ {p}_{1}={p}_{2}={p}_{3}=\cdots =v. $

    Lemma 6

    (1) $ \mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}x=\frac{x}{1}+\frac{{x}^{2}}{3}+\frac{{x}^{2}}{5}+\cdots +\frac{{x}^{2}}{2n+1}+\cdots , $

    (2) For $ r=\frac{u}{v}, $ $ \mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}r=\frac{u}{v}+\frac{{u}^{2}}{3v}+\frac{{u}^{2}}{5v}+\cdots + \frac{{u}^{2}}{(2n+1)v}+\cdots . $

    Proof (1) Replace $ x $ by $ \frac{x}{\mathrm{i}} $ in Lemma 2.4 and observe $ \mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}x=\mathrm{i}\mathrm{t}\mathrm{a}\mathrm{n}\left(\frac{x}{\mathrm{i}}\right). $

    (2) Use Lemma 2.2 and put $ {p}_{1}={p}_{2}={p}_{3}=\cdots =v. $

    Lemma 7

    (1) $ {\mathrm{e}}^{x}=1+\frac{2x}{2-x}+\frac{{x}^{2}}{6}+\frac{{x}^{2}}{10}+\cdots +\frac{{x}^{2}}{4n+2}+\cdots , $

    (2) For $ r=\frac{u}{v},{\mathrm{e}}^{x}=1+\frac{2u}{2v-u}+\frac{{u}^{2}}{6v}+\frac{{u}^{2}}{10v}+\cdots + \frac{{u}^{2}}{(4n+2)v}+\cdots . $

    Proof (1) By $ {\mathrm{e}}^{r}=\frac{1}{1}-\frac{1}{2}-\frac{1}{\mathrm{i}\mathrm{t}\mathrm{a}\mathrm{n}\left(\frac{\mathrm{i}x}{2}\right)}, $ Nathan[9] obtained

    $$ {\mathrm{e}}^{x}=1+\frac{-2x}{2+x}+\frac{{x}^{2}}{6}+\frac{{x}^{2}}{10}+\cdots +\frac{{x}^{2}}{4n+2}+\cdots . $$

    We give another GCF for $ {\mathrm{e}}^{x} $ through the equation between $ {\mathrm{e}}^{x} $ and $ \mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}x $. Recall that $ \mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}x=\left({\mathrm{e}}^{x}-{\mathrm{e}}^{-x}\right)/ $ $ \left({\mathrm{e}}^{x}+{\mathrm{e}}^{-x}\right)=\left({\mathrm{e}}^{2x}-1\right)/\left({\mathrm{e}}^{2x}+1\right) $. Then

    $$ {\mathrm{e}}^{2x}=1+\frac{2}{-1+\frac{1}{\mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}x}}. $$ (12)

    Replacing $ x $ by $ \frac{x}{2} $ in Lemma 6, we get

    $$ \mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}\left(\frac{x}{2}\right)=\frac{x/2}{1}+\frac{{x}^{2}/4}{3}+\frac{{x}^{2}/4}{5}+\cdots +\frac{{x}^{2}/4}{2n+1}+\cdots . $$

    Putting $ {p}_{1}={p}_{2}=\cdots =2 $ in Lemma 4, we obtain

    $$ \mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}\left(\frac{x}{2}\right)=\frac{x}{2}+\frac{{x}^{2}}{6}+\frac{{x}^{2}}{10}+\cdots +\frac{{x}^{2}}{4n+2}+\cdots . $$

    By equation (12), then

    $$ \begin{aligned}{\mathrm{e}}^{x}=&1+\frac{2}{-1+\frac{1}{\frac{x}{2+\frac{{x}^{2}}{6+\frac{{x}^{2}}{10+\cdots }}}}}=\\& 1+\frac{2x}{-x+\frac{1}{\frac{1}{2+\frac{{x}^{2}}{6+\frac{{x}^{2}}{10+\cdots }}}}}=\\& 1+\frac{2x}{2-x+\frac{{x}^{2}}{6+\frac{{x}^{2}}{10+\cdots }}}.\end{aligned} $$

    (2) Use Lemma 4 and put $ {p}_{1}={p}_{2}={p}_{3}=\cdots =v. $

    Lemma 8 For an integer sequence $ \left\{{a}_{n}\right\}, {a}_{n+1}=n{a}_{n}+s{a}_{n-1} $ with $ {a}_{n}\in {\mathbf{Z}}^{\mathrm{*}} $ and $ s\in \mathbf{Z}, $ we have the following conclusions.

    (1) $ \left\{{a}_{n}\right\} $ is unbounded.

    (2) There are infinitely many $ n $ such that $ \left|{a}_{n+1}\right| > \left|{a}_{n}\right|. $

    (3) There exists $ {n}_{0} $ such that $ \left|{a}_{n+1}\right| > \left|{a}_{n}\right| $ when $ n > {n}_{0} $.

    (4) There exists $ {c}_{1} $ such that $ \left|{a}_{n}\right|\ge {c}_{1}(n-\left|s\right|)!. $

    (5) There exists $ {c}_{2} $ such that $ \left|{a}_{n}\right|\le {c}_{2}(n+\left|s\right|)!. $

    (6) For arbitrary $ {\varepsilon }_{1} > 0 $ and $ {\varepsilon }_{2} > 0 $, $ {(n!)}^{1-{\varepsilon }_{1}}\ll $ $ \left|{a}_{n}\right|\ll {(n!)}^{1+{\varepsilon }_{2}}. $

    Proof ((1) ⇒ (2) ⇒ (3) ⇒ (4), (5) ⇒ (6))

    (1) If not, then there exists $ c $ such that $ \left|{a}_{n}\right| < c. $ When $ n\ge \left|s\right|c+c, $ we have

    $$ \left|{a}_{n+1}\right|=\left|n{a}_{n}+s{a}_{n-1}\right|\ge n\left|{a}_{n}\right|-\left|s\right|c\ge n-\left|s\right|c\ge c, $$

    contradicting with $ \left|{a}_{n}\right| < c. $

    (2) Use (1).

    (3) By (2), there exists $ {n}_{0}\ge \left|s\right|+1 $ such that $ \left|{a}_{{n}_{0}}\right| > \left|{a}_{{n}_{0}-1}\right|. $ Then

    $$ \begin{array}{c}\left|{a}_{{n}_{0}+1}\right|=\left|{n}_{0}{a}_{{n}_{0}}+s{a}_{{n}_{0}-1}\right|\ge \\ {n}_{0}\left|{a}_{{n}_{0}}\right|-\left|s\right|\left|{a}_{{n}_{0}-1}\right|=\\ \left({n}_{0}-\left|s\right|\right)\left|{a}_{{n}_{0}}\right|+\left|s\right|\left(\left|{a}_{{n}_{0}}\right|-\left|{a}_{{n}_{0}-1}\right|\right) > \\ \left({n}_{0}-\left|s\right|\right)\left|{a}_{{n}_{0}}\right|\text{,}\end{array} $$ (13)

    and $ \left|{a}_{{n}_{0}+1}\right| > \left({n}_{0}-\left|s\right|\right)\left|{a}_{{n}_{0}}\right|\ge \left|{a}_{{n}_{0}}\right|. $

    (4) By equation (13) in (3), there exists $ {n}_{0} $ such that $ \left|{a}_{n+1}\right| > \left(n-\left|s\right|\right)\left|{a}_{n}\right| $ when $ n\ge {n}_{0} $. Then

    $$ \begin{array}{c}\left|{a}_{n+1}\right| > \left(n-\left|s\right|\right)\left|{a}_{n}\right| > \\ \left(n-\left|s\right|\right)\left(n-\left|s\right|-1\right)\cdots \left({n}_{0}-\left|s\right|\right)\left|{a}_{{n}_{0}}\right|=\\ {c}_{1}\left(n-\left|s\right|\right)!, \end{array} $$

    where $ {c}_{1}=\frac{\left|{a}_{{n}_{0}}\right|}{\left({n}_{0}-\left|s\right|-1\right)!}. $

    (5) From (3), there exists $ {n}_{0} > \left|s\right| $ such that $ \left|{a}_{n}\right| > \left|{a}_{n-1}\right| $ when $ \ge {n}_{0} $. Then

    $$ \begin{array}{c}\left|{a}_{n+1}\right|\le \left(n+\left|s\right|\right)\left|{a}_{n}\right|\le \\ \left(n+\left|s\right|\right)\left(n+\left|s\right|-1\right)\cdots \left({n}_{0}+\left|s\right|\right)\left|{a}_{{n}_{0}}\right|=\\ {c}_{2}\left(n-\left|s\right|\right)!, \end{array} $$

    where $ {c}_{2}=\frac{\left|{a}_{{n}_{0}}\right|}{\left({n}_{0}+\left|s\right|-1\right)!}. $

    (6) Use (4) and (5).

    Lemma 9 For an integer sequence $ \left\{{a}_{n}\right\}, {a}_{n+1}= $ $ \pm \left(an+b\right){a}_{n}+s{a}_{n-1} $ with $ {a}_{n}, a\in {\mathbf{Z}}^{\mathrm{*}} $ and $ s, b\in \mathbf{Z} $, we have the following.

    (1) There exists $ {n}_{0} $ such that $ \left|{a}_{n}\right| > \left|{a}_{n-1}\right| $ when $ n > {n}_{0} $,

    (2) For arbitrary $ {\varepsilon }_{1} > 0 $ and $ {\varepsilon }_{2} > 0 $, $ {\left(n!\right)}^{1-{\varepsilon }_{1}}\ll \left|{a}_{n}\right|\ll {\left(n!\right)}^{1+{\varepsilon }_{2}}. $

    Proof The argument is similar to the proof of Lemma 8.

    Proposition 3 A meromorphic function $ f\left(x\right)=\frac{{x}^{2}}{a+b}+\frac{{x}^{2}}{2a+b}+\cdots +\frac{{x}^{2}}{{a}_{n}+b} $ for $ a\in {\mathbf{Z}}^{\mathrm{*}} $, converges except for the poles of $ f\left(x\right). $

    Proof By Proposition 1(1),

    $$ {Q}_{n}=\left(an+b+a\right){Q}_{n-1}+{x}^{2}{Q}_{n-2}. $$

    And by Lemma 9, for arbitrary $ {\varepsilon }_{1} > 0 $ and $ {\varepsilon }_{2} > 0 $,

    $$ {\left(n!\right)}^{1-{\varepsilon }_{1}}\ll \left|{Q}_{n}\right|\ll {\left(n!\right)}^{1+{\varepsilon }_{2}}. $$

    Then by Proposition 1 (4), for $ x $ not belonging to the poles of $ f\left(x\right), $

    $$ \begin{array}{c}\left|f\left(x\right)-\frac{{P}_{k}}{{Q}_{k}}\right|\le \left|{\left(-1\right)}^{k+1}\frac{{x}^{2k}}{{Q}_{k-1}{Q}_{k}}+{\left(-1\right)}^{k+2}\frac{{x}^{2k+2}}{{Q}_{k}{Q}_{k+1}}+\cdots \right|\le \\ \frac{\left|{x}^{2k}\right|}{\left|{Q}_{k-1}{Q}_{k}\right|}+\frac{\left|{x}^{2k+2}\right|}{\left|{Q}_{k}{Q}_{k+1}\right|}+\cdots \ll \\ \frac{1}{{\left(k!\right)}^{1-{\varepsilon }_{1}}}+\frac{1}{{\left(\left(k+1\right)!\right)}^{1-{\varepsilon }_{1}}}+\cdots \le \\ \frac{1}{{\left(k!\right)}^{1-{\varepsilon }_{1}}}\left(1+\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\cdots \right)=\\ \frac{2}{{\left(k!\right)}^{1-{\varepsilon }_{1}}}\to 0.\end{array} $$

    Remark 1 Proposition 3 means the GCFs in Lemmas 5, 6 and 7 converge except for the poles of $ \mathrm{t}\mathrm{a}\mathrm{n}x, \mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}x. $

    Proof of Theorem 1 (1) Using Lemma 7 (2) and Proposition 1 (1), we have

    $$ {Q}_{n}=\left(\right(4n+2\left)v\right){Q}_{n-1}+{u}^{2}{Q}_{n-2}. $$

    And by Lemma 9, for arbitrary $ {\varepsilon }_{1} > 0 $ and $ {\varepsilon }_{2} > 0 $,

    $$ {(n!)}^{1-{\varepsilon }_{1}}\ll \left|{Q}_{n}\right|\ll {(n!)}^{1+{\varepsilon }_{2}}. $$

    By Proposition 1 (4) and the fact that the GCF in Lemma 7 converges in the complex plane following form Proposition 3, letting $ k\to +\mathrm{\infty }, $ we obtain

    $$ {\mathrm{e}}^{r}=\frac{{P}_{0}}{{Q}_{0}}+\frac{{a}_{1}}{{Q}_{0}{Q}_{1}}-\frac{{a}_{1}{a}_{2}}{{Q}_{1}{Q}_{2}}+\cdots +{(-1)}^{k+1}\frac{{a}_{1}{a}_{2}\dots {a}_{k}}{{Q}_{k-1}{Q}_{k}}+\cdots . $$

    And using Proposition 2 (4) again, we obtain

    $$ {\mathrm{e}}^{r}-\frac{{P}_{k}}{{Q}_{k}}={(-1)}^{k+1}\frac{{a}_{1}{a}_{2}\dots {a}_{k}}{{Q}_{k-1}{Q}_{k}}+\cdots . $$

    It means

    $$ \begin{array}{c}\left|{Q}_{k}{\mathrm{e}}^{r}-{P}_{k}\right|\le \frac{\left|{a}_{1}{a}_{2}\cdots {a}_{k+1}\right|}{\left|{Q}_{k+1}\right|}+\frac{\left|{a}_{1}{a}_{2}\cdots {a}_{k+2}\right|}{\left|{Q}_{k+2}\right|}+\cdots =\\ \frac{\left|{u}^{2k+2}\right|}{\left|{Q}_{k+1}\right|}+\frac{\left|{u}^{2k+4}\right|}{\left|{Q}_{k+2}\right|}+\cdots \ll \frac{1}{{(k!)}^{1-2{\varepsilon }_{1}}}.\end{array} $$ (14)

    And by Lemma 1, we have $ {Q}_{k}{\mathrm{e}}^{r}-{P}_{k}\ne 0 $ since the continued fraction of $ {\mathrm{e}}^{r} $ is endless, then $ {\mathrm{e}}^{r} $ is irrational.

    Furthermore, observing equation(14), we can choose $ g\left(n\right)={\left(n!\right)}^{1-2{\varepsilon }_{1}}, a=\frac{1+{\varepsilon }_{2}}{1-2{\varepsilon }_{1}}, h=1+\varepsilon $ to make sure that they meet the conditions of Theorem 3, where $ \varepsilon , {\varepsilon }_{1}, {\varepsilon }_{2} $ are arbitrary positive numbers. Using Theorem 3(2), we obtain

    $$ \mu \left({\mathrm{e}}^{r}\right)\le a{h}^{2}+1=\frac{1+{\varepsilon }_{2}}{1-2{\varepsilon }_{1}}{(1+\varepsilon )}^{2}+1. $$

    Since $ \varepsilon , {\varepsilon }_{1}, {\varepsilon }_{2} $ are arbitrary positive numbers, $ \mu \left({\mathrm{e}}^{r}\right)\le 2. $ By Lemma 3, $ \mu \left({\mathrm{e}}^{r}\right)=2. $

    Remark 2 Theorem 2 can be similarly proven.

    Remark 3 By $ \mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}x=\mathrm{i}\mathrm{t}\mathrm{a}\mathrm{n}\left(\frac{x}{\mathrm{i}}\right) $ and equation(12), we can conclude that $ {\mathrm{e}}^{r} $, $ \mathrm{t}\mathrm{a}\mathrm{n}r $ and $ \mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}r $ are rationally related. So the irrationality measures of $ {\mathrm{e}}^{r} $, $ \mathrm{t}\mathrm{a}\mathrm{n}r $ and $ \mathrm{t}\mathrm{a}\mathrm{n}\mathrm{h}r $ are 2.

  • [1] BUNDSCHUH P. Irrational itätsmaβe für ea, a ≠ 0 rational oderliouville-zahl[J]. Mathematische Annalen, 1971, 192: 229-242. doi: 10.1007/BF02052875
    [2] EULER L. Introduction to analysis of the infinite[M]. New York: Springer, 1988.
    [3] HAVIL J. The irrationals: a story of the numbers you can't count on[M]. Princeton: Princeton University Press, 2012.
    [4] KHOVANSKII A N. The application of continued fractions and their generalizations to problems in approximation theory[M]. Groningen: Pieter Noordhoff Limited, 1963.
    [5] GAUSS C F. Disquisition es generales circa seriem infinitam 1 + αβ/γx + ···[J]. Gesammelte Werke, 1812, 3: 1866-1929.
    [6] APRÉY. Irrationalité de ζ(2) et ζ(3)[J]. Astérisque, 1979, 61: 11-13.
    [7] ZHU Y C. Introduction to irrational numbers[M]. Hefei: Press of University of Science and Technology of China, 2012.
    [8] DUVERNEY D. Number theory: an elementary introduction through diophantine problems[M]. Singapore: World Scientific Publishing Company Private Limited, 2010.
    [9] NATHAN A J. The irrationality of ex for nonzero rational x[J]. The American Mathematical. Monthly, 1998, 105(8): 762-763.
WeChat 点击查看大图
出版历程
  • 收稿日期:  2023-09-16

目录

    /

    返回文章
    返回