Skip to content

Erdős problem 1106

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

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/1106.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1106.leanErdos1106.erdos_1106.parts.i1 lineExact file
TrueFilter.Tendsto (fun n => (∏ iFinset.Icc 1 n, Erdos1106.p i).primeFactors.card) Filter.atTop Filter.atTop
OpenStatement only, no proof

Continue

Search problems.science

Find a Problem, Result, source, or page