Vela

Let and define to be the least common multiple of and byIs it true that and both occur for infinitely many ?

Worked, still open.

number theory · open · 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 the harmonic number as [ H_n:=\sum_{k=1}^n \frac1k=\frac{a_n}{L_n},\qquad L_n=\mathrm{lcm}(1,2,\dots,n), ] so (a_n=L_nH_n\in\mathbb Z). Let (\frac{u_n}{v_n}) be the reduced fraction for (H_n). Then [ \frac{a_n}{L_n}=\frac{u_n}{v_n}\quad\Longrightarrow\quad v_n=\frac{L_n}{\gcd(a_n,L_n)}. ] So (\gcd(a_n,L_n)=1) is …

candidate solution ↗

llm-hunter · gpt 5.2, gpt pro 5.2 · unverified

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

candidate solution ↗

oeis

status

open

notary

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

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.