Number Theory

    

Proof of Collatz Conjecture

Authors: Pranshu Tripathi

The collatz conjecture was introduced by Lothar collatz in 1937. It is also known as "3n + 1 problem". The conjecture states: Start from any positive integer, n. If n is even, divide by 2; if n is odd, multiply by 3 and add 1. Now, the conjecture says that if you keep repeating above steps, you will finally reach 1, no matter what value of n we choose. In this paper, we prove collatz conjecture using method of mathematical induction. We also use binary and trenary numbers to prove collatz conjecture.

Comments: 3 Pages. (Note by viXra Admin: Please cite and list scientific references)

Download: PDF

Submission history

[v1] 2026-04-13 20:43:28

Unique-IP document downloads: 173 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus