Skip to published state

Erdős problem / erdos

open offer

Problem 686

Exact records and bounded producer offers matched to this problem.

Current bounded offer

rank 19
availableerdos:686
Erdős 686
Advance Erdős problem 686 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:686
  2. Packetsite/problems/686.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/686.json
Packet root
sha256:d801598823d12eb6e504c08ab91a7d285a68ca9385b7ae776c8a156da13cf9b9

Matching finding records

1 records

  1. vf_d8218ce87084620c

    theoretical

    Erdős Problem #686: declared status 'open'. Formalized: yes. Can every integer N≥2N\geq 2 be written asN=∏1≤i≤k(m+i)∏1≤i≤k(n+i)N=\frac{\prod_{1\leq i\leq k}(m+i)}{\prod_{1\leq i\leq k}(n+i)}for some k≥2k\geq 2 and m≥n+km\geq n+k? Prize: no. Tags: number theory.

    recordedOpen record