leanprover-community / leanprover-community/mathlib4
Euler-Lehmer sequences
Open
Nobody has claimed this yet.
- Dominant language
- Lean
- Stars
- 4.2k
- Forks
- 1.7k
- PR merge metrics
- No merged PRs in 30d
Description
While working on the formal-conjectures project, there was a need to make a convergence proof for Euler-Lehmer sequences. Pull 147
noncomputable def eulerLehmerSeq (a : ℕ) (q : ℕ+) (n : ℕ) : ℝ :=
letI S (x : ℕ) := ∑ k in (Finset.Icc 1 x).filter (· ≡ a [MOD (q : ℕ)]), (1 : ℝ) / k
S n - log n / q
Should this be added to the mathlib and how best to fit it into the existing architecture?
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Review the Euler-Lehmer sequence definition in the issue and the linked formal-conjectures Pull 147, then inspect mathlib's existing architecture for related sequences and convergence results. Done means establishing whether this belongs in mathlib and documenting or implementing a clear placement and scope.
Written by the indexing model from the issue text.
Assessment
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100