Vela

Let , the sum of divisors function, and . Is it true that, for every , there exist some such that ?

Worked, still open.

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

* For every (n>1) we have (\sigma(n)\ge 1+n), hence (\sigma(n)>n). So each forward orbit [ n,\ \sigma(n),\ \sigma_2(n),\ \sigma_3(n),\dots ] is a **strictly increasing** infinite sequence. * Therefore, if (\sigma_i(m)=\sigma_j(n)) ever happens, then the two orbits **merge forever after** (all subsequent iterates are eq…

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_412 : answer(sorry) ↔ ∀ᵉ (m ≥ 2) (n ≥ 2), ∃ i j, (σ 1)^[i] m = (σ 1)^[j] n
formal-conjectures/412.lean ↗

oeis

status

open

notary

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

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.