Skip to content

Erdős problem 315

Let u1=1u_1=1 and un+1=un(un+1)u_{n+1}=u_n(u_n+1), so that ∑k≥11uk+1\sum_{k\geq 1}\frac{1}{u_k+1} and uk=⌊c02k+1⌋u_k=\lfloor c_0^{2^k}+1\rfloor for k≥1k\geq 1, where c0=lim⁡un1/2n=1.264085⋯ .c_0=\lim u_n^{1/2^n}=1.264085\cdots. Let a1<a2<⋯a_1<a_2<\cdots be any other sequence with ∑1ak=1\sum \frac{1}{a_k}=1. Is it true that lim inf⁡an1/2n<c0=1.264085⋯?\liminf a_n^{1/2^n}<c_0=1.264085\cdots?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:5060b97efebde9eba7ad44a2d8563e48b051a7c28b48966ed51c2753d1a7e4ff
Metadata
sha256:8f5737ee8489b5413cb01230701c6676c6a56568cbe01b1bce5a4c3ca8ee5b79
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:4854bcc7704b37d893a67ac87fc613e8181e95f2f05d17b6b1774d1aeb42542a
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb