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.

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:95d704c809dc94a2d3fc027a342cd7922a65f28d2e785352bfd72ad62fcd4cab
Metadata
sha256:70c4c77423105fc080165dea41d7926b845efafd68b470257fb873903f6c3094
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:43726d51fff594694a95c80364e77529a42acb33b81c37533bddc48dc5adf755
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page