Robin Nag

Addendum: A Short Elementary Proof of the Unprovability of the Collatz Conjecture

Robin Nag · Journal of Advances in Mathematics and Computer Science · 2014

Addendum for British Journal of Mathematics & Computer Science, 4(21), 3023-3027, 2014   It has been drawn to the journal's attention that there is an addendum for following section of the published paper.: (1) Formulation of Hasses Algorithm  Therefore, following the 'SDI Co...

Open access Research Article 10.9734/BJMCS/2015/12538

A Short Elementary Proof of the Unprovability of the Collatz Conjecture

Robin Nag · Journal of Advances in Mathematics and Computer Science · 2014

Consider any positive integer n. If n is even, halve it. If n is odd, multiply it by 3 and add 1. This algorithm is then repeated indefinitely. It has been conjectured by Collatz that this process, which is also known as Hasse’s algorithm, eventually reaches 1. A new perspective...

Open access Research Article 10.9734/BJMCS/2014/12538