Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. C. Badea, The irrationality of certain infinite series, Glasgow Math. J. 29 (1987), no. 2, 221--228, doi:10.1017/S0017089500006868. The Theorem is stated on p. 222 (Section 2, "Main result") and proved on pp. 222--223. Bibliographic details are on the source card.

Statement

Theorem (p. 222). Let (bn)(b_n) and (an)(a_n), n≥1n\ge1, be sequences of positive integers such that

an+1>bn+1bn an2−bn+1bn an+1a_{n+1}>\frac{b_{n+1}}{b_n}\,a_n^2-\frac{b_{n+1}}{b_n}\,a_n+1

(the paper's (1)) holds for every large nn. Then ∑n≥1bn/an\sum_{n\ge1}b_n/a_n is irrational.

The paper assumes throughout that the series it treats converge, or alternatively adopts the convention that ∞\infty counts as irrational (Section 1, p. 221); the Theorem is read under that convention.

The remark after the proof (pp. 223--224) notes that the same argument would give the Theorem for positive real ana_n and bnb_n if Froda's generalization of Brun's criterion held, and states that Froda's generalization is false, citing the author's counterexample. The Theorem is stated and proved only for positive integers.

Proof pointer

Pp. 222--223. With Pn=a1⋯anP_n=a_1\cdots a_n and An=∑j≤nbjPn/ajA_n=\sum_{j\le n}b_jP_n/a_j, the partial sums are An/PnA_n/P_n, an increasing sequence of rationals. Brun's criterion (the paper's reference [3]) gives irrationality of the limit of an increasing sequence yn/xny_n/x_n of quotients of positive integers when the difference quotients (yn+1−yn)/(xn+1−xn)(y_{n+1}-y_n)/(x_{n+1}-x_n) decrease strictly for all large nn. Using An+1=an+1An+bn+1PnA_{n+1}=a_{n+1}A_n+b_{n+1}P_n, the paper reduces that condition for yn=Any_n=A_n, xn=Pnx_n=P_n to inequality (1).

Read depth. Claims checked: the statement and its hypotheses were read clause by clause on p. 222 of the print; the proof was read for structure only.

Dependencies

Brun's irrationality criterion (V. Brun, 1910, the paper's reference [3]), used as a black box.

Bears on

  • Problem 267: through Corollary 1 the paper derives Corollary 4, the irrationality of ∑n≥11/F2n+1\sum_{n\ge1}1/F_{2^n+1}, which is the single instance nk=2k+1n_k=2^k+1 of the problem. The Theorem states nothing about other index sequences.
  • Problem 243: through Corollary 1, a sequence of positive integers with rational reciprocal sum has an+1≤an2−an+1a_{n+1}\le a_n^2-a_n+1 for infinitely many nn; the paper does not give the problem's conclusion.
  • Problem 263: context only. The problem page records a thread remark calling the Theorem a stronger classical irrationality criterion; the paper addresses neither of the problem's questions.