Vela

Let be a finite set of primes with and let . Is the sumwhere is the lowest common multiple of , irrational?

Worked, still open.

irrationality · open · formalized (Lean) · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

Let $P$ be a finite set of primes, (|P|\ge 2), and let (a_1<a_2<\cdots) be the increasing list of $P$-smooth numbers [[nomath]](i.e. all $n\in\mathbb N$ whose prime divisors lie in $P$)[[/nomath]]. Write [ L_n=[a_1,\dots,a_n]. ]

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

candidate solution ↗

formal

AMS 11 · open (literature)

theorem erdos_269.variants.rational : answer(sorry) ↔
    ∀ᵉ (P : Finset ℕ) (h : ∀ p ∈ P, p.Prime) (h_card : P.card ≥ 2),
    ∃ (q : ℚ), q = (series (P : Set ℕ))
formal-conjectures/269.lean ↗

status

open

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 03fd354753964d7d9050d25251ee42dbb733286f73dc73773d5903dc9e4cb198

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.