An improved algorithm for checking the Collatz conjecture for all n < 2^N

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Angeltveit, Vigleik
Formato: Preprint
Publicado: 2026
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866912896748879872
author Angeltveit, Vigleik
author_facet Angeltveit, Vigleik
contents We describe a new algorithm for verifying the Collatz conjecture for all n < 2^N for some fixed N. The algorithm takes less than twice as long to verify convergence for all n < 2^{N+1} as it does to verify convergence for all n < 2^N. We also discuss verification of the analogue of the Collatz conjecture for negative numbers.
format Preprint
id arxiv_https___arxiv_org_abs_2602_10466
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle An improved algorithm for checking the Collatz conjecture for all n < 2^N
Angeltveit, Vigleik
Number Theory
11Y16
We describe a new algorithm for verifying the Collatz conjecture for all n < 2^N for some fixed N. The algorithm takes less than twice as long to verify convergence for all n < 2^{N+1} as it does to verify convergence for all n < 2^N. We also discuss verification of the analogue of the Collatz conjecture for negative numbers.
title An improved algorithm for checking the Collatz conjecture for all n < 2^N
topic Number Theory
11Y16
url https://arxiv.org/abs/2602.10466