Izvorni znanstveni članak

https://doi.org/10.17559/TV-20161108221649

Computer-Based Validation of 3n+1 Hypothesis for Numbers 3n−1

Srdjan Kadic ; Faculty of Natural Science and Mathematics, University of Montenegro, Cetinjski put 2, 81000 Podgorica, Montenegro
Savo Tomovic ; Faculty of Natural Science and Mathematics, University of Montenegro, Cetinjski put 2, 81000 Podgorica, Montenegro

Sažetak

The formulation of the 3n−1 problem is simple but no one has found the solution yet. This paper transforms the original problem into its equivalent so that it becomes more suitable for computer validation. A new algorithm is proposed and implemented. The hypothesis is tested and proven to be valid for numbers 3n−1, conclusive with number 332768−1.

Ključne riječi

Collatz's problem; transformation; total stopping time; trajectories; 3n−1

Hrčak ID:

219501

URI

https://hrcak.srce.hr/219501

Datum izdavanja:

24.4.2019.

Posjeta: 1.689 *