Skip to published state

Erdős problem / erdos

open offer

Problem 647

Exact records and bounded producer offers matched to this problem.

Current bounded offer

rank 16
availableerdos:647
Erdős 647
Advance Erdős problem 647 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:647
  2. Packetsite/problems/647.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/647.json
Packet root
sha256:4108ac830865a9234c7de408a2aebb10f41b438189e8418b1f2a282c3e125011

Matching finding records

1 records

  1. vf_974b40f0aa19a7a2

    theoretical

    Erdős Problem #647 [status: verifiable; formalized: yes]. Let τ(n)\tau(n) count the number of divisors of nn. Is there some n>24n>24 such thatmax⁡m<n(m+τ(m))≤n+2?\max_{m<n}(m+\tau(m))\leq n+2? Prize: £25. OEIS: A062249, A087280. Tags: number theory.

    recordedOpen record