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)?

Erdős Problems records this as falsifiable.

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutionfalsifiable
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Where the source files it579 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.