Wiki
Wiki

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

Updated

Tijdeman 2002 rationality cantor ahmes series

../

corollary_4_1: States five growth conditions on positive integers a_n and b_n under which the sum of b_n over a_n is rational exactly when a_(n+1) equals b_(n+1) over b_n times a_n(a_n minus one) plus one eventually, the first being Badea's criterion; problem 243's hypothesis implies none of them.

corollary_4_2: States that if the sum of b_n over a_n is rational and a_(n+1) is at least b_(n+1)/b_n times a_n(A_n/A_(n-1) minus one) plus gcd(A_n, a_(n+1)) for all large n, with A_n the lcm of a_1 through a_n, then equality holds from some n_0 on; the paper calls it a refinement of Badea's result.

proposition_4_1: States that if b_n equals one and a_(n+1) equals a_n(A_n/A_(n-1) minus one) plus gcd(A_n, a_(n+1)) for all n, with infinitely many n where that gcd exceeds one, then the limsup of a_n squared over a_(n+1) exceeds one.

theorem_2_1: States that if a_n exceeds one, b_n is of order a_n and the ratios b_n over a_n have an irrational limit point, then the sum of b_n over a_1 through a_n is irrational, relaxing Oppenheim's condition that b_n lie between zero and a_n.

theorem_3_1: States the exact rationality test for the sum of b_n over a_1 through a_n when a_n is a monotonic integer sequence above one and b_(n+1) minus b_n is o(a_(n+1)); with a_n equal to n plus one it reproves the irrationality of the sum of p_n over n factorial.

theorem_4_1: States that for positive integers a_n and b_n with the sum of b_n over a_n convergent and the limsup of A_(n-1) times (b_(n+1)a_n/a_(n+1) minus b_n/a_n) at most zero, where A_n is the lcm of a_1 through a_n, the sum is rational exactly when a_(n+1) equals b_(n+1)/b_n times a_n(a_n minus one) plus one for large n.

theorem_4_3: States that for positive integers a_n and b_n with a_n b_(n+1) minus a_(n+1) b_n at most b_(n+1) minus b_n for all large n, the sum of b_n over a_1 through a_n is rational exactly when (a_n minus one) over b_n is constant from some n_0 on, without any monotonicity of a_n.

theorem_5_1: States that for an integer k above one and positive integers b_n with the sum of b_n k^(-n) convergent to T and b_n at most (1 minus 1/k)T_(n+1), every S in the interval from T/(k+1), excluded, to T, included, equals the sum of b_n over a_1 through a_n for some a_n in {k, ..., k^2}.


Robert Tijdeman and Pingzhi Yuan, On the rationality of Cantor and Ahmes series, Indag. Math. (N.S.) 13 (2002), no. 3, 407--418; Zbl 1018.11037; MSC 11J72.

Edition

The copy read for this card is the author-page PostScript preprint tijyua8.ps (dvips 5.92a, 2002, Type 1 fonts). Provenance: fetched from https://pub.math.leidenuniv.nl/~tijdemanr/tijyua8.ps on 2026-09-17 (UTC), 311,481 bytes. It was read as a PDF rendering of those bytes produced with ps2pdf (Ghostscript 10.07.1), not a separately fetched edition; the rendering has 14 pages. Its title page reads "On the rationality of Cantor and Ahmes series, Robert Tijdeman and Pingzhi Yuan", with the MSC and the note "The second author is responsible for the communication". Page numbers and labels below are the preprint's; the journal version (Elsevier) was not fetched and may differ. The text layer is reliable; the statements were checked on the rendered pages 1 to 13. The PostScript preprint carries no document copyright or license line (its only copyright strings are the embedded AMS font programs' notices, which concern the fonts, not the text), and the author's page it was fetched from (https://pub.math.leidenuniv.nl/~tijdemanr/, read 2026-10-02) states no copyright, license or terms; the term is unstated. The PDF rendering of those bytes, the authors' preprint rather than the journal edition, prints no notice; the version of record's publisher page could not be read on 2026-10-02 (ScienceDirect returned HTTP 403), and its Crossref record (DOI 10.1016/s0019-3577(02)80018-0) names only Elsevier's text-and-data-mining and open-archive user licenses, no Creative Commons license, none of which governs that manuscript; the term is unstated.

Contents

Notation (p. 2): S=∑n≥1bn/(a1⋯an)S=\sum_{n\ge1}b_n/(a_1\cdots a_n) for integer sequences with an>0a_n>0, RN=∑n≥Nbn/(aN⋯an)R_N=\sum_{n\ge N}b_n/(a_N\cdots a_n); convergence is assumed whenever rationality is discussed.

  • Lemma 2.1 (p. 3, from Hančl–Tijdeman [5]): (i) if bn=c(an−1)b_n=c(a_n-1) for n≥n0n\ge n_0 then S∈QS\in\mathbb{Q}; (ii) if S=r/qS=r/q then qRn∈ZqR_n\in\mathbb{Z} for all nn. Lemma 2.2 and Proposition 2.1 (p. 3) give the sufficiency and, for RnR_n bounded below with small increments, the necessity of Rnk=Rnk+1R_{n_k}=R_{n_{k+1}} eventually.
  • Theorem 2.1 (p. 4): if an>1a_n>1, bn=O(an)b_n=O(a_n) and bn/anb_n/a_n has an irrational limit point, then SS is irrational (Oppenheim's theorem without 0≤bn<an0\le b_n<a_n).
  • Theorem 3.1 (p. 5; proof pp. 5--6): for a monotonic integer sequence an>1a_n>1 and integers bnb_n with bn+1−bn=o(an+1)b_{n+1}-b_n=o(a_{n+1}), SS is rational exactly when bn/(an−1)b_n/(a_n-1) is eventually constant. Theorem 3.2 (p. 6) is the variant for positive bnb_n with lim sup⁡(bn+1−bn)/an≤0\limsup(b_{n+1}-b_n)/a_n\le0; Example 3.1 (p. 6): ∑(n+1)!/(2n)!∉Q\sum(n+1)!/(2n)!\notin\mathbb{Q}.
  • Section 4 (positive bnb_n, ana_n not necessarily monotone): Theorem 4.1 (p. 6) is a criterion for ∑bn/an\sum b_n/a_n in terms of An=lcm⁡(a1,…,an)A_n=\operatorname{lcm}(a_1,\ldots,a_n), and Corollary 4.1 (p. 7) lists five growth conditions under which ∑bn/an\sum b_n/a_n is rational exactly when an+1=bn+1bnan(an−1)+1a_{n+1}=\frac{b_{n+1}}{b_n}a_n(a_n-1)+1 for large nn, refining Sylvester, Badea and Erdős–Straus 1964. Theorem 4.2 (p. 8) is a Cantor-series variant for ultimately monotonic ana_n; Theorem 4.3 (p. 9) drops monotonicity under anbn+1−an+1bn≤bn+1−bna_nb_{n+1}-a_{n+1}b_n\le b_{n+1}-b_n; Corollary 4.2 (pp. 9--10) is an lcm and gcd refinement of Badea's criterion, and Proposition 4.1 (p. 10) shows that for bn=1b_n=1 its equality case with lim sup⁡an2/an+1≤1\limsup a_n^2/a_{n+1}\le1 has the gcd eventually 11.
  • Section 5 (pp. 11--13): constructions showing that the criteria need growth restrictions: for every integer k>1k>1 and every nondecreasing sequence of positive integers bnb_n with ∑bnk−n\sum b_nk^{-n} convergent there are an∈{k,…,k2}a_n\in\{k,\ldots,k^2\} representing every xx in an interval as ∑bn/(a1⋯an)\sum b_n/(a_1\cdots a_n) (Theorem 5.1 with Remark 5.1, p. 11); Theorem 5.2 (p. 11) and Examples 5.1--5.2 (p. 12) restrict ana_n to two consecutive values, and for d>c>1d>c>1 Example 5.3 (p. 13) gives a sequence bnb_n with the same property for an∈{c,d}a_n\in\{c,d\}. Section 5 ends with two open questions (p. 13).

References (pp. 13--14) include Badea 1987 and 1993, Erdős–Straus 1974 ([3]) and 1964 ([4]), Hančl–Tijdeman "On the irrationality of Cantor series, preprint" ([5], the paper filed as hancl_2004_irrationality_cantor_series), Oppenheim 1954 and Sylvester 1880.

Relations

With an=na_n=n (shifted by one index so that an>1a_n>1), Theorem 3.1 is an exact rationality test for factorial series ∑bn/n!\sum b_n/n! with bn+1−bn=o(n)b_{n+1}-b_n=o(n); for bn=pnb_n=p_n it reproves the irrationality of ∑pn/n!\sum p_n/n! from the gap bound pn+1−pn=o(n)p_{n+1}-p_n=o(n), since pn/(n−1)p_n/(n-1) is not eventually constant; this is the case k=1k=1 of Erdős 1958. Corollary 4.1(i), Badea's criterion for Ahmes series, is a result under a hypothesis that problem 243's hypothesis does not imply: it settles the problem only for sequences that also satisfy it. The same holds for Theorem 4.1 with bn=1b_n=1 and for Corollary 4.2 with Proposition 4.1, whose limsup condition the problem's hypothesis does meet but whose lower bound on an+1a_{n+1} it does not imply. The paper contains nothing on ∑pn/2n\sum p_n/2^n or on the bounded-shift series of problem 264.

Compiled scope

Statements read on the rendered pages; proofs of Theorem 2.1 and Theorem 3.1 read for structure and summarized; sections 4 and 5 read for their statements, with proof pointers on the result pages. No proof is rewritten in full and none has been independently reviewed.

Bears on. #251 (context: Theorem 3.1 reproves the k=1k=1 theorem cited on the problem page), #243 (context: Corollary 4.1(i) is Badea's criterion, and Theorem 4.1 with bn=1b_n=1 and Corollary 4.2 with Proposition 4.1 give the problem's recurrence, each under a hypothesis the problem's does not imply).

No file of this source is held: no license on record permits its redistribution, and the card cites the edition it names above.