Erdős problem 1106 · problems.science

Let $p(n)$ be the partition number of $n$ and $F(n)$ be the number of distinct prime factors of $∏_{i= 1} ^ {n} p(n)$ , then $F(n)$ tends to infinity when $n$ tends to infinity.

Sources

Browse retained paths and inspect the exact material available for this Problem.

2 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

1106.lean

Retained formal statement1 of 2

Let $p(n)$ be the partition number of $n$ and $F(n)$ be the number of distinct prime factors of $∏_{i= 1} ^ {n} p(n)$ , then $F(n)$ tends to infinity when $n$ tends to infinity.

FormalConjectures/ErdosProblems/1106.leanErdos1106.erdos_1106.parts.i1 lineExact file

1True ↔ Filter.Tendsto (fun n => (∏ i ∈ Finset.Icc 1 n, Erdos1106.p i).primeFactors.card) Filter.atTop Filter.atTop

OpenStatement only, no proof

Sources

Search problems.science