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 k1k \geq 1, lcm(1,,pk+11)<pklcm(1,,pk)\operatorname{lcm}(1, \dots, p_{k+1}-1) < p_k \cdot \operatorname{lcm}(1, \dots, p_k)?

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:f58f2dd2a4f8f9ff679155569e6ec89b11cf75e33d62aa299318c9bda5a2ac30
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page