Erdős Problem #414 (n + τ(n)): structural lemmas, a bound on the number of trajectories, and computations to 10^16

{"Let":[0],"h(n)":[1],"=":[2,70,170,178],"n":[3,129,136],"+":[4,75,83,98,172,222,224],"τ(n),":[5],"where":[6],"τ(n)":[7],"is":[8,141,164,342,363],"the":[9,26,48,61,64,100,105,110,161,167,180,197,256,281,297,324,334,355,361],"number":[10],"of":[11,13,28,63,109,182,187,280,302,333,360],"divisors":[12],"n.":[14],"Erdős":[15,36,111],"and":[16,45,119,160,290,305,357],"Graham":[17],"(and,":[18],"earlier,":[19],"C.":[20],"Spiro":[21],"in":[22,57,192,244],"1977)":[23],"asked":[24],"whether":[25,208],"h-orbits":[27],"any":[29],"two":[30],"starting":[31,52],"points":[32],"eventually":[33],"meet":[34],"—":[35,234],"Problem":[37,112],"#414.":[38],"This":[39,195,344],"note":[40],"collects":[41],"elementary":[42],"structural":[43],"observations":[44],"computations":[46],"on":[47,154,174],"problem.":[49],"(i)":[50],"Every":[51],"point":[53],"below":[54,90],"10^16":[55,71],"lies":[56],"a":[58,113,142,144,235,240,263,309],"single":[59],"component:":[60],"orbits":[62],"38":[65],"\\"frontier\\"":[66],"integers":[67,176],"at":[68,218,231],"N":[69,80,91,97],"(the":[72],"values":[73],"m":[74,78,82,158,171],"τ(m)":[76,173],"with":[77,157,239,312],"<":[79],"≤":[81,130,276],"τ(m),":[84],"through":[85],"which":[86,323],"every":[87,209],"orbit":[88],"from":[89],"must":[92],"pass)":[93],"all":[94,128,350],"merge":[95,306,329],"within":[96],"3.8·10^9;":[99],"same":[101],"method":[102],"reproduces":[103],"exactly":[104,153],"verification":[106],"to":[107,166,207,293,322],"10^10":[108],"Day":[114],"report":[115],"(White–Claude,":[116],"July":[117],"2026),":[118,250],"an":[120],"independent":[121],"full":[122],"forward":[123],"pass":[124],"confirms":[125],"merging":[126,204],"for":[127,203,270,278,291],"10^9.":[131],"(ii)":[132],"The":[133],"residue":[134,266],"class":[135],"≡":[137],"2":[138],"(mod":[139],"4)":[140],"trap:":[143],"trajectory":[145,181],"there":[146],"cannot":[147],"change":[148],"parity":[149,198,335],"until":[150],"it":[151],"lands":[152],"some":[155],"2m²":[156],"odd,":[159],"trapped":[162],"dynamics":[163],"conjugate":[165],"map":[168],"g(m)":[169],"odd":[175,214,303],"(h(2m)":[177],"2g(m));":[179],"1":[183],"spends":[184],"97.8":[185],"%":[186],"its":[188],"first":[189],"560,000":[190],"steps":[191],"this":[193],"class.":[194,267],"reduces":[196],"question":[199],"(necessary,":[200],"not":[201],"sufficient,":[202],"across":[205],"parities)":[206],"g-orbit":[210],"meets":[211],"infinitely":[212],"many":[213],"squares.":[215],"(iii)":[216],"Unconditionally":[217],"most":[219],"log":[220,316],"Y":[221,233],"2γ":[223],"o(1)":[225],"distinct":[226],"trajectories":[227],"can":[228],"be":[229],"alive":[230],"height":[232],"bound":[236],"that":[237],"appears,":[238],"sharper":[241],"error":[242],"term,":[243],"E.":[245],"Li's":[246],"preprint":[247],"arXiv:2606.17926":[248],"(June":[249],"whose":[251],"\\"lower-runner":[252],"races\\"":[253],"also":[254],"cover":[255],"braid":[257],"structure":[258],"described":[259],"here;":[260],"we":[261],"add":[262],"refinement":[264],"by":[265,354],"(iv)":[268],"Scans":[269],"further":[271],"congruence":[272],"obstructions":[273,292],"(all":[274],"moduli":[275],"36),":[277],"invariants":[279],"pair":[282],"(position,":[283],"gap)":[284],"modulo":[285],"8,":[286],"16,":[287],"24,":[288],"32,":[289],"collisions":[294],"find":[295],"only":[296],"mod-4":[298],"structure;":[299],"hitting":[300],"rates":[301],"squares":[304],"hazards":[307],"match":[308],"random":[310],"model":[311],"step":[313],"size":[314],"≍":[315],"n;":[317],"adjacent":[318],"pairs":[319],"(n,":[320],"n+1),":[321],"conjecture":[325,362],"reduces,":[326],"almost":[327],"never":[328],"quickly":[330],"precisely":[331],"because":[332],"mechanism.":[336],"Code":[337],"(C,":[338],"segmented":[339],"divisor":[340],"sieve)":[341],"included.":[343],"work":[345],"was":[346],"AI-assisted":[347],"(Claude,":[348],"Anthropic);":[349],"statements":[351],"were":[352],"checked":[353],"author,":[356],"no":[358],"proof":[359],"claimed.":[364]}

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-14
DOI
https://doi.org/10.5281/zenodo.22757689
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

Erdős Problem #414 (n + τ(n)): structural lemmas, a bound on the number of trajectories, and computations to 10^16

Elie Szczupak
Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
preprint

Erdős Problem #414 (n + τ(n)): structural lemmas, a bound on the number of trajectories, and computations to 10^16

Elie Szczupak
preprint en

Abstract

Let h(n) = n + τ(n), where τ(n) is the number of divisors of n. Erdős and Graham (and, earlier, C. Spiro in 1977) asked whether the h-orbits of any two starting points eventually meet — Erdős Problem #414. This note collects elementary structural observations and computations on the problem. (i) Every starting point below 10^16 lies in a single component: the orbits of the 38 "frontier" integers at N = 10^16 (the values m + τ(m) with m < N ≤ m + τ(m), through which every orbit from below N must pass) all merge within N + 3.8·10^9; the same method reproduces exactly the verification to 10^10 of the Erdős Problem a Day report (White–Claude, July 2026), and an independent full forward pass confirms merging for all n ≤ 10^9. (ii) The residue class n ≡ 2 (mod 4) is a trap: a trajectory there cannot change parity until it lands exactly on some 2m² with m odd, and the trapped dynamics is conjugate to the map g(m) = m + τ(m) on odd integers (h(2m) = 2g(m)); the trajectory of 1 spends 97.8 % of its first 560,000 steps in this class. This reduces the parity question (necessary, not sufficient, for merging across parities) to whether every g-orbit meets infinitely many odd squares. (iii) Unconditionally at most log Y + 2γ + o(1) distinct trajectories can be alive at height Y — a bound that appears, with a sharper error term, in E. Li's preprint arXiv:2606.17926 (June 2026), whose "lower-runner races" also cover the braid structure described here; we add a refinement by residue class. (iv) Scans for further congruence obstructions (all moduli ≤ 36), for invariants of the pair (position, gap) modulo 8, 16, 24, 32, and for obstructions to collisions find only the mod-4 structure; hitting rates of odd squares and merge hazards match a random model with step size ≍ log n; adjacent pairs (n, n+1), to which the conjecture reduces, almost never merge quickly precisely because of the parity mechanism. Code (C, segmented divisor sieve) is included. This work was AI-assisted (Claude, Anthropic); all statements were checked by the author, and no proof of the conjecture is claimed.

Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.