Vela

Is it true that in any finite colouring of the integers there exists a monochromatic solution towith distinct ?

Worked, still open.

number theory · solved · formalized (Lean) · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

formal

AMS 5 11 · solved (literature)

theorem erdos_303 :
    answer(True) ↔
    -- For any finite colouring of the integers
    ∀ (𝓒 : ℤ → ℤ), (Set.range 𝓒).Finite →
      -- There exists integers `a, b, c`
      ∃ (a b c : ℤ),
      -- that are non-zero and distinct.
      [a, b, c, 0].Nodup ∧
      -- `a, b, c` satisfy the equation
      (1/a : ℝ) = 1/b + 1/c ∧
      -- `a, b, c` have the same color
      (𝓒 '' {a, b, c}).Subsingleton
formal-conjectures/303.lean ↗

status

solved

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 517513c7c2c8e1917dbb11d639b08fe52db017214848905bd5636378f9227e7e

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.