Documentation

FormalConjectures.ErdosProblems.«252»

Erdős Problem 252 #

References:

noncomputable def Erdos252.erdos_252_sum (k : ) :

The series ∑ σ k n / n!.

Equations
Instances For
    theorem Erdos252.erdos_252 :
    sorry k1, Irrational (erdos_252_sum k)

    ∑ σ 0 n / n! is irrational. This is proved in [ErSt71].

    ∑ σ 1 n / n! is irrational. This is proved in [ErSt74].

    ∑ σ 2 n / n! is irrational. This is proved in [ErKa54].

    ∑ σ 3 n / n! is irrational. This is proved in [ScPu06] and [FLC07].

    ∑ σ 4 n / n! is irrational. This is proved in [Pr22].

    For a fixed k ≥ 5, is ∑ σ k n / n! irrational?.

    theorem Erdos252.erdos_252.variants.schinzel (hs : ∀ (fs : Finset (Polynomial )), (∀ ffs, BunyakovskyCondition f)SchinzelCondition fsInfinite {n : | ffs, Prime (Polynomial.eval n f).natAbs}) (k : ) :

    If Schinzel's conjecture is true, then ∑ σ k n / n! is irrational for all k. This is proved in [ScPu06].

    theorem Erdos252.erdos_252.variants.prime_tuples {k : } (hk : 4 k) (hp : ∀ (a : Fin kℕ+) (b : Fin k), (∀ (p : ), Nat.Prime p∃ (n : ), ¬p i : Fin k, ((a i) * n + b i)){n : | ∀ (i : Fin k), Nat.Prime ((a i) * n + b i)}.Infinite) :

    If the prime k-tuples conjecture is true, then ∑ σ k n / n! is irrational. This is proved in [FLC07].