Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Theorem 2 of John B. Friedlander, Florian Luca and Mihai Stoiciu, On the irrationality of a divisor function series, Integers 7 (2007), #A31, 9 pp., states that the prime -tuples conjecture implies that
is irrational, stated for every positive integer and proved in the
paper's Section 3 for , the cases being covered by its
Theorem 1 and the short proofs for in its introduction; the abstract
phrases the result as holding for . This would answer
Problem 252 yes for every .
The claim is conditional: the hypothesis is the paper's Conjecture 1,
Dickson's form of the prime -tuples conjecture for linear polynomials,
that for , integers and such that no prime divides
for every , infinitely many positive make every
prime; it is unproven, so this page derives nothing for the
problem's standing. The source card
friedlander_2007_irrationality_divisor_function_series
holds the journal's PDF (the first paper link; the second is the journal's
Zenodo deposit). The unconditional Theorem 1, the case , is the partial
claim on
its own page;
Schlage-Puchta proved a parallel conditional theorem under Schinzel's
Hypothesis H
(his conditional page),
as the paper's note added in March 2007 records. formal-conjectures tags its
variant erdos_252.variants.prime_tuples, which takes the conjecture as an
explicit hypothesis for , research solved, citing this paper.
Acceptance. Refereed: Integers, volume 7 (2007), article A31, received
8 December 2006, revised 20 March 2007, accepted 12 June 2007 and published
3 July 2007, as the paper's header prints; Integers is a refereed electronic
journal. The site labels the problem OPEN, so its curator's remark that the
sum is irrational for every under Dickson's conjecture by this paper is
commentary on an open problem and not acceptance, and no reviewed evidence
is listed. The proof is not checked here.
Depends on. Nothing in this wiki.