Wiki
Wiki

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

Updated


Source. Printed p. 103, physical PDF p. 2, the paragraph beginning "I further proved", read on the page image; the bibliography on printed p. 109 (physical PDF p. 8) for the references.

Statement, verbatim

"I further proved that if p1<p2<…p_1<p_2<\ldots is the sequence of primes then ∑n=1∞pnk/n!\sum_{n=1}^{\infty}p_n^k/n! is irrational for every kk [4]. I could not prove that ∑pnk/2n\sum p_n^k/2^n is irrational for every kk. This is probably very difficult already for k=1k=1. It seems reasonable to expect that if gn≥2g_n\ge2, gn/pn→0g_n/p_n\to0 then

∑n=1∞pn/g1…gn(2)\sum_{n=1}^{\infty}p_n/g_1\ldots g_n\qquad(2)

is irrational, but I can prove the irrationality of (2) only under much more restrictive conditions; gn=pn+1g_n=p_n+1 shows that some growth condition is needed for the irrationality of (2)."

Reference [4] is "P. Erdős, Sur certaines series a valeur irrationnelle, Enseignement Math. 4 (1958), 93--100", filed as erdos_1958_sur_certaines_series_valeur_irrationnelle_french.

Notes

  • The first sentence overstates the 1958 paper. That paper proves ∑pn/n!\sum p_n/n! irrational and asserts the cases k≥2k\ge2 without proof (its main theorem). The first published proof for k≥2k\ge2 is Schlage-Puchta 2007, Theorem 3. Nothing here attributes the cases k≥2k\ge2 to Erdős.
  • The second and third sentences are problem 251 for k=1k=1; the site's page states the expectation for every kk as a remark citing this page.
  • The expectation about (2) assumes only gn≥2g_n\ge2 and gn=o(pn)g_n=o(p_n), with no monotonicity. The paper does not say which "much more restrictive conditions" it means. Two theorems that prove (2) irrational under such conditions are in papers it cites: the 1958 section 3 theorem (its [4]: nondecreasing qnq_n with the growth hypothesis (5), the sum rational only when qn=qpn+1q_n=qp_n+1 eventually) and Erdős–Straus 1974, Theorem 3.1 (its [3]: monotone ana_n with pn=o(an2)p_n=o(a_n^2) and lim inf⁡an/pn=0\liminf a_n/p_n=0). The 2026 Kovač note claims an explicit sequence gn≥2g_n\ge2 with gn=o(pn)g_n=o(p_n), not monotone, whose sum (2) is exactly 11; it is a claimed counterexample to the expectation as stated here, non-refereed, with no independent review filed in this library. The monotone theorems (Erdős 1958 section 3; Hančl–Tijdeman 2004, Theorem 5.1 and Theorem 6.1) are not affected.
  • The example gn=pn+1g_n=p_n+1 gives sum 11 by telescoping (pn/(g1⋯gn)=1/(g1⋯gn−1)−1/(g1⋯gn)p_n/(g_1\cdots g_n)=1/(g_1\cdots g_{n-1})-1/(g_1\cdots g_n)); it is the case q=1q=1 of the rational family qn=qpn+1q_n=qp_n+1 in the 1958 theorem.

Bears on. #251.