Computer-Based Validation of 3n+1 Hypothesis for Numbers 3n−1
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 f...
Main Authors: | Srdjan Kadic, Savo Tomovic |
---|---|
Format: | Article |
Language: | English |
Published: |
Faculty of Mechanical Engineering in Slavonski Brod, Faculty of Electrical Engineering in Osijek, Faculty of Civil Engineering in Osijek
2019-01-01
|
Series: | Tehnički Vjesnik |
Subjects: | |
Online Access: | https://hrcak.srce.hr/file/320395 |
Similar Items
-
Modified Collatz conjecture or (3a + 1) + (3b + 1)I Conjecture for Neutrosophic Numbers 〈Z ∪ I〉
by: W. B. Vasantha Kandasamy, et al.
Published: (2016-12-01) -
En introduktion till 3x+1 problemet och dess matematiska omfång
by: Reimers, Jens
Published: (2021) -
About two countable families in the finite sets of the Collatz Conjecture
by: Michele Ventrone
Published: (2021-07-01) -
Online Computation of Time-Optimization-Based, Smooth and Path-Consistent Stop Trajectories for Robots
by: Giusti, A., et al.
Published: (2022) -
A mathematical approach for creative graphics design
by: Panchanand Jha, et al.
Published: (2020-06-01)