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...

Full description

Bibliographic Details
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
_version_ 1797207514635304960
author Srdjan Kadic
Savo Tomovic
author_facet Srdjan Kadic
Savo Tomovic
author_sort Srdjan Kadic
collection DOAJ
description 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.
first_indexed 2024-04-24T09:24:07Z
format Article
id doaj.art-f0c1b56bbf6a4317879f0b618b9b3d26
institution Directory Open Access Journal
issn 1330-3651
1848-6339
language English
last_indexed 2024-04-24T09:24:07Z
publishDate 2019-01-01
publisher Faculty of Mechanical Engineering in Slavonski Brod, Faculty of Electrical Engineering in Osijek, Faculty of Civil Engineering in Osijek
record_format Article
series Tehnički Vjesnik
spelling doaj.art-f0c1b56bbf6a4317879f0b618b9b3d262024-04-15T15:29:49ZengFaculty of Mechanical Engineering in Slavonski Brod, Faculty of Electrical Engineering in Osijek, Faculty of Civil Engineering in OsijekTehnički Vjesnik1330-36511848-63392019-01-0126228929310.17559/TV-20161108221649Computer-Based Validation of 3n+1 Hypothesis for Numbers 3n−1Srdjan Kadic0Savo Tomovic1Faculty of Natural Science and Mathematics, University of Montenegro, Cetinjski put 2, 81000 Podgorica, MontenegroFaculty of Natural Science and Mathematics, University of Montenegro, Cetinjski put 2, 81000 Podgorica, MontenegroThe 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.https://hrcak.srce.hr/file/320395Collatz's problemtransformationtotal stopping timetrajectories3n−1
spellingShingle Srdjan Kadic
Savo Tomovic
Computer-Based Validation of 3n+1 Hypothesis for Numbers 3n−1
Tehnički Vjesnik
Collatz's problem
transformation
total stopping time
trajectories
3n−1
title Computer-Based Validation of 3n+1 Hypothesis for Numbers 3n−1
title_full Computer-Based Validation of 3n+1 Hypothesis for Numbers 3n−1
title_fullStr Computer-Based Validation of 3n+1 Hypothesis for Numbers 3n−1
title_full_unstemmed Computer-Based Validation of 3n+1 Hypothesis for Numbers 3n−1
title_short Computer-Based Validation of 3n+1 Hypothesis for Numbers 3n−1
title_sort computer based validation of 3n 1 hypothesis for numbers 3n 1
topic Collatz's problem
transformation
total stopping time
trajectories
3n−1
url https://hrcak.srce.hr/file/320395
work_keys_str_mv AT srdjankadic computerbasedvalidationof3n1hypothesisfornumbers3n1
AT savotomovic computerbasedvalidationof3n1hypothesisfornumbers3n1