Skip to content

Erdős problem 458

Let lcm⁡(1,…,n)\operatorname{lcm}(1, \dots, n) denote the least common multiple of {1,…,n}\{1, \dots, n\}. Let pkp_k be the kk-th prime. Is it true that for all k≥1k \geq 1, lcm⁡(1,…,pk+1−1)<pk⋅lcm⁡(1,…,pk)\operatorname{lcm}(1, \dots, p_{k+1}-1) < p_k \cdot \operatorname{lcm}(1, \dots, p_k)?

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:9647f207c44b25c17bc955f6c583ea86a98e0bc4e6f1760911dfc8f73f2640d8
Metadata
sha256:c7e2501a64daa26fec5c215619ea61a1a4c3eb4a1a879e501c1bad5d6ddc4c3e
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:f58f2dd2a4f8f9ff679155569e6ec89b11cf75e33d62aa299318c9bda5a2ac30
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb