A Clustering Perspective of the Collatz Conjecture

Thumbnail Image

Files

2021_mathematics_tenreiro_clustering.pdf (3.32 MB)
Identifiers
URI: http://hdl.handle.net/10347/24434
E-ISSN: 2227-7390
DOI: 10.3390/math9040314

Publication date

2021

Authors

Advisors

Tutors

Editors

Journal Title

Journal ISSN

Volume Title

Publisher

MDPI
Metrics
Google Scholar
lacobus
Export

Research Projects

Organizational Units

Journal Issue

Abstract

This manuscript focuses on one of the most famous open problems in mathematics, namely the Collatz conjecture. The first part of the paper is devoted to describe the problem, providing a historical introduction to it, as well as giving some intuitive arguments of why is it hard from the mathematical point of view. The second part is dedicated to the visualization of behaviors of the Collatz iteration function and the analysis of the results

Description

Keywords

Multidimensional scaling| Collatz conjecture| Clustering methods

Bibliographic citation

Mathematics 2021, 9(4), 314; https://doi.org/10.3390/math9040314

Relation

Has part

Has version

Is based on

Is part of

Is referenced by

Is version of

Requires

Sponsors

The work of D. Cao Labora was partially supported by grant number MTM2016-75140-P (AEI/FEDER, UE)

Rights

© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/)
Atribución 4.0 Internacional

Collections

Estatística, Análise Matemática e Optimización