Skip to published state

Erdős problem / erdos

open offer

Problem 458

Exact records and bounded producer offers matched to this problem.

Current bounded offer

rank 5
availableerdos:458
Erdős 458
Advance Erdős problem 458 from its pinned statement, theorem and proof records, attempts, residual obligations, dependency context, and source locks; produce one decision-relevant artifact or an informative negative result without repeating banked routes.
  1. Targeterdos:458
  2. Packetsite/problems/458.json
  3. Verifiererdos-frontier.problem-work.v1
Inspect ranked work
Exact offer contractPacket, root, and verifier profile
Verifier
erdos-frontier.problem-work.v1
Packet
site/problems/458.json
Packet root
sha256:dec800737dacd90c8d29821af4ed17b1273e259cdb3165a7c2160f4ab56fe219

Matching finding records

1 records

  1. vf_d4aeef530de46e80

    theoretical

    Erdős Problem #458 [status: falsifiable; formalized: yes]. Let [1,…,n][1,\ldots,n] denote the least common multiple of {1,…,n}\{1,\ldots,n\}. Is it true that, for all k≥1k\geq 1,[1,…,pk+1−1]<pk[1,…,pk]?[1,\ldots,p_{k+1}-1]< p_k[1,\ldots,p_k]? Prize: no. OEIS: A056604. Tags: number theory, primes.

    recordedOpen record