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.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:43726d51fff594694a95c80364e77529a42acb33b81c37533bddc48dc5adf755
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb