RECURRENCE AND STRUCTURING OF SEQUENCES OF TRANSFORMATIONS 3N + 1 AS ARGUMENTS FOR CONFIRMATION OF THE СOLLATZ HYPOTHESIS
Computer Design Systems. Theory and Practice · 2023
DOI: 10.23939/cds2023.01.028 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer Design Systems. Theory and Practice, 2023. Verfasst von Petro Kosobutskyy und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 13 Literaturangaben.
Abstract (Originalsprache)
It is shown that infinites of the subsequence of odd numbers is not a counterargument of the violation of the Collatz hypothesis, but a universal characteristic of transformations of natural numbers by the 3n + 1 algorithm. A recurrent relationship is established between the parameters of the sequence of Collatz transformations of an arbitrary pair of natural numbers n and 2n.
Zitieren
APA
Kosobutskyy, P., & Karkulovskyy, V. (2023). RECURRENCE AND STRUCTURING OF SEQUENCES OF TRANSFORMATIONS 3N + 1 AS ARGUMENTS FOR CONFIRMATION OF THE СOLLATZ HYPOTHESIS. Computer Design Systems. Theory and Practice. https://doi.org/10.23939/cds2023.01.028
Vancouver
Kosobutskyy P, Karkulovskyy V. RECURRENCE AND STRUCTURING OF SEQUENCES OF TRANSFORMATIONS 3N + 1 AS ARGUMENTS FOR CONFIRMATION OF THE СOLLATZ HYPOTHESIS. Computer Design Systems. Theory and Practice. 2023. doi:10.23939/cds2023.01.028
BibTeX
@article{Kosobutskyy2023,
author = {Kosobutskyy, Petro and Karkulovskyy, Volodymyr},
title = {RECURRENCE AND STRUCTURING OF SEQUENCES OF TRANSFORMATIONS 3N + 1 AS ARGUMENTS FOR CONFIRMATION OF THE СOLLATZ HYPOTHESIS},
journal = {Computer Design Systems. Theory and Practice},
year = {2023},
doi = {10.23939/cds2023.01.028}
}
EUVIMED