Erdős problem 306
If and is squarefree, can always be written as a finite sum of reciprocals of distinct products of two distinct primes?
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/306.leanTrue ↔ ∀ (q : ℚ), 0 < q → Squarefree q.den → ∃ k n, n 0 = 1 ∧ StrictMono n ∧ (∀ i ∈ Finset.Icc 1 (Fin.last k), ArithmeticFunction.cardDistinctFactors (n i) = 2 ∧ ArithmeticFunction.cardFactors (n i) = 2) ∧ q = ∑ i ∈ Finset.Icc 1 (Fin.last k), 1 / ↑(n i)OpenStatement only, no proof
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
AI collaborating with humans
- Machine
- People
AI collaborating with humans
- Machine
- People
argument
- Machine
- Reported outcome