go-v.orgdoi

Parity-Based Level-Set Approach to the Collatz Conjecture

Selcuk Koyuncu, Thevasha Sathiyakumar, Praise Alayode, Christopher Ellis, Peyton Thomas · Mathematics · 2026

  • DOI 10.3390/math14101763
  • Publisher Multidisciplinary Digital Publishing Institute
  • Type article
  • Issued 2026

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

Mathematics · Multidisciplinary Digital Publishing Institute · article · 2026

Abstract

The Collatz conjecture concerns the iteration of the map f(n)=3n+1 for odd n and f(n)=n/2 for even n. In this paper, we study the level sets lx={n∈N∣L(n)=x}, where L(n) denotes the Collatz length. Using the parity representation of Collatz trajectories, we partition each lx according to the number of odd steps and analyze the corresponding means μx,k. Under a natural scaling assumption, these means satisfy an approximate geometric progression, so that logμx,k is approximately linear in k. Computations for n≤100,000 and 10≤x≤50 show highly stable regression parameters and near-perfect linear fits.

Open the resolved locator · 10.3390/math14101763

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 10:29 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://doi.org/10.3390/math14101763
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.