Number Theory

    

Collatz Problemi İspatı (Proof of the Collatz Problem)

Authors: Mesut Kavak

Pozitif bir tam sayı seçildiğinde, sayı çift ise 2'ye bölünür; aksi takdirde 3 ile çarpılır ve bundan sonra sonuca 1 eklenir. Sonucun tek veya çift olması şartından dolayı problemin gerekli seçeneği ile aynı işlem tekrarlandığında, 0 ve 1'den farklı olan her pozitif tamsayı 1'e indirgenebilir mi?

Choosing a positive integer is divisible by 2 if the number is even; otherwise it is multiplied by 3 and then 1 is added to the result. Can every positive integer other than 0 and 1 be reduced to 1 when the same operation is repeated with the required option of the problem, provided that the result is odd or even?

Comments: 4 Pages. In Turkish

Download: PDF

Submission history

[v1] 2023-06-13 01:29:47

Unique-IP document downloads: 528 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