Skip to published state

Erdős problem / erdos

open offer

Problem 730

Exact records and bounded producer offers matched to this problem.

Current bounded offer

rank 11
availableerdos:730
Erdős 730
Advance Erdős problem 730 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:730
  2. Packetsite/problems/730.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/730.json
Packet root
sha256:5a27ac39241ee6f4c3e40ae782723e66ef05be7c45f09d456018fc739debc3fb

Matching finding records

1 records

  1. vf_4c5222fb0e04b577

    theoretical

    Erdős Problem #730: declared status 'open'. Formalized: yes. Are there infinitely many pairs of integers n≠mn\neq m such that (2nn)\binom{2n}{n} and (2mm)\binom{2m}{m} have the same set of prime divisors? Current best: It is not known whether there are such pairs of the shape (n,n+k)(n,n+k) for every k≥1k\geq 1. Prize: no. OEIS: A129515. Tags: base representations, binomial coefficients, number theory.

    recordedOpen record