/- Copyright 2025 The Formal Conjectures Authors. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. -/ module public import FormalConjecturesUtil

Erdős Problem 257

Reference: erdosproblems.com/257

@[expose] public sectionnamespace Erdos257

Let $A\subseteq\mathbb{N}$ be an infinite set. Is $$ \sum_{n\in A} \frac{1}{2^n - 1} $$ irrational?

@[category research open, question, AMS 11] theorem erdos_257 : ∀ (A : Set ℕ), A.Infinite → Irrational (∑' n : A, (1 : ℝ) / (2 ^ n.1 - 1)) := ⊢ ∀ (A : Set ℕ), A.Infinite → Irrational (∑' (n : ↑A), 1 / (2 ^ ↑n - 1)) All goals completed! 🐙

Show that $$ \sum_{n} \frac{1}{2^n - 1} = \sum_{n} \frac{d(n)}{2^n}, $$ where $d(n)$ is the number of divisors of $n$.

hr:‖1 / 2‖ < 1hpos:∀ (n : ℕ), 0 < n → 2 ≤ 2 ^ nkey:∑' (n : ℕ+), 1 / (2 ^ ↑n - 1) = ∑' (n : ℕ+), ↑(↑n).divisors.card / 2 ^ ↑nhsummL:Summable fun n ↦ 1 / (2 ^ n - 1)hsummR:Summable fun n ↦ ↑n.divisors.card / 2 ^ n⊢ 1 / (2 ^ 0 - 1) + ∑' (n : ℕ+), 1 / (2 ^ ↑n - 1) = ↑(Nat.divisors 0).card / 2 ^ 0 + ∑' (n : ℕ+), ↑(↑n).divisors.card / 2 ^ ↑n All goals completed! 🐙

Show that $$ \sum_{n} \frac{d(n)}{2^n} $$ is irrational.

[Er48] Erdős, P., On arithmetical properties of Lambert series. J. Indian Math. Soc. (N.S.) (1948), 63-66.

@[category research solved, AMS 11, formal_proof using lean4 at "https://github.com/wcook04/plectis-erdos-lean/blob/c4eab2571b4692ee9c08d3ec138176f7fbfa09a9/verification/FCMergedIntegerAdapters/research/adapters/FormalConjecturesAdapter.lean#L121-L134"] theorem erdos_257.variants.tsum_top : Irrational <| ∑' n, n.divisors.card / (2 ^ n : ℝ) := ⊢ Irrational (∑' (n : ℕ), ↑n.divisors.card / 2 ^ n) All goals completed! 🐙

Let $A \subseteq \mathbb{N}$ be infinite with $\sum_{a \in A} 1/a < \infty$. For every integer base $b \ge 2$, the series $$ \sum_{a \in A} \frac{1}{b^a - 1} $$ is irrational. No pairwise coprimality assumption is needed. Exponent zero contributes zero under Lean's real-division convention.

Erdős stated the coprimality-free result in On the irrationality of certain series, Math. Student 36 (1968), p. 222. A proof and formalisation appear in W. Cook, Reciprocal Mersenne Subseries: https://github.com/wcook04/plectis-erdos/blob/598cd7bac8b73dcfef3687f46922c1ef6da766ae/docs/papers/full-text/erdos257-mersenne-reasoning-surface.md

@[category research solved, AMS 11, formal_proof using lean4 at "https://github.com/wcook04/plectis-erdos-lean/blob/ec92e5ce12c6117a24e4b532ea565ba332a1df7b/verification/FC257ReciprocalSupport/verification/Solutions/FC257Subtype.lean#L10-L17"] theorem erdos_257.variants.summable_reciprocal_support (b : ℕ) (A : Set ℕ) (hb : 2 ≤ b) (hA : A.Infinite) (hsum : Summable fun a : A => 1 / (a : ℝ)) : Irrational (∑' n : A, 1 / ((b : ℝ) ^ (n : ℕ) - 1)) := b:ℕA:Set ℕhb:2 ≤ bhA:A.Infinitehsum:Summable fun a ↦ 1 / ↑↑a⊢ Irrational (∑' (n : ↑A), 1 / (↑b ^ ↑n - 1)) All goals completed! 🐙end Erdos257