Vela

Let and be the maximum value of , where ranges over all subsets of which contain no subset of size with the same pairwise least common multiple.Estimate .

Worked, still open.

number theory · open · possible · 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

Write (A\subseteq [N]:={1,\dots,N}). Call $A$ **LCM-$k$-free** if it contains no distinct (a_1,\dots,a_k) such that $ \mathrm{lcm}(a_i,a_j)\ \text{ is the same for all }1\le i<j\le k . $ Your (f_k(N)) is exactly the extremal “harmonic weight” of an LCM-$k$-free set.

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

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

candidate solution ↗

status

open

notary

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

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.