EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Parity-Based Level-Set Approach to the Collatz Conjecture

Selcuk Koyuncu, Thevasha Sathiyakumar, Praise Alayode, Christopher Ellis, Peyton Thomas

Mathematics · 20.05.2026 · 14 (10) · 1763

DOI: 10.3390/math14101763 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 20.05.2026. Verfasst von Selcuk Koyuncu und 4 weiteren Autor:innen. Die Arbeit nennt 12 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Coppin State University.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Förderung

  • Coppin State University

Zitieren

APA

Koyuncu, S., Sathiyakumar, T., Alayode, P., Ellis, C., & Thomas, P. (2026). Parity-Based Level-Set Approach to the Collatz Conjecture. Mathematics, 14(10), 1763. https://doi.org/10.3390/math14101763

Vancouver

Koyuncu S, Sathiyakumar T, Alayode P, Ellis C, Thomas P. Parity-Based Level-Set Approach to the Collatz Conjecture. Mathematics. 2026;14(10):1763. doi:10.3390/math14101763

BibTeX
@article{Koyuncu2026,
  author = {Koyuncu, Selcuk and Sathiyakumar, Thevasha and Alayode, Praise and Ellis, Christopher and Thomas, Peyton},
  title = {Parity-Based Level-Set Approach to the Collatz Conjecture},
  journal = {Mathematics},
  year = {2026},
  volume = {14},
  number = {10},
  pages = {1763},
  doi = {10.3390/math14101763}
}
Kostenlos starten →