Skip to content

Erdős problem 69

Start work

Is ∑n≥2ω(n)2n \sum_{n\geq 2}\frac{\omega(n)}{2^n} irrational? (Here ω(n)\omega(n) counts the number of distinct prime divisors of nn.)

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:47631a7ecb8430dd73807b29c5cb6f0acfc64e2824958127f762a50683feb3a8
Metadata
sha256:756f18187878829ea2c9e04a277a430c499bdb882b51afea1e5cac560afe7488
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:6f179057b8feb9cf68df0c5addfee4f628c20d5b2e9af540ded794a4bdbe09de
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON