Skip to content

Erdős problem 646

Start work

Let p1,…,pkp_1,\ldots,p_k be distinct primes. Are there infinitely many nn such that n!n! is divisible by an even power of each of the pip_i?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:088e5678d982e089d09c5b850f1fd26a80033c6539cd81d03399cb2562490166
Metadata
sha256:8c2c9d0d7b9f3bc07c1f2c080f7f17fc091c0358b381fa641c945db84ca0201b
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:9354ef16b4395624fbb0b77a2f710a9bcb662a1463094bb4965088f949dffafb
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON