<h2>What is it?</h2>
The Collatz Conjecture can be defined simply as:
<div class="math math-display"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>F</mi><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo><mo>=</mo><mrow><mo fence="true">{</mo><mtable rowspacing="0.36em" columnalign="left left" columnspacing="1em"><mtr><mtd><mstyle scriptlevel="0" displaystyle="false"><mstyle displaystyle="true" scriptlevel="0"><mfrac><mi>n</mi><mn>2</mn></mfrac></mstyle></mstyle></mtd><mtd><mstyle scriptlevel="0" displaystyle="false"><mrow><mtext>if </mtext><mi>n</mi><mo>≡</mo><mn>0</mn></mrow></mstyle></mtd></mtr><mtr><mtd><mstyle scriptlevel="0" displaystyle="false"><mrow><mn>3</mn><mi>n</mi><mo>+</mo><mn>1</mn></mrow></mstyle></mtd><mtd><mstyle scriptlevel="0" displaystyle="false"><mrow><mtext>if </mtext><mi>n</mi><mo>≡</mo><mn>1</mn></mrow></mstyle></mtd></mtr></mtable></mrow></mrow><annotation encoding="application/x-tex">F(x) =
 \begin{cases}
 \dfrac{n}{2} &#x26;\text{if }{n} \equiv 0 \\
 3{n}+1 &#x26;\text{if }{n} \equiv 1 \\
 \end{cases}</annotation></semantics></math>F(x)={2n​3n+1​if n≡0if n≡1​</div>
With any number being passed in recursivly converging on 1 (apparently). [[cout-vs-printf]] C++ cout VS printf
Still unsolved, but verified for everynumber under 268, so gotta start around 3 quintillion.
By adding 1 to your number x, you shuffle its prime factors in a certain way. Its easy to see that x and x+1 share no factors in common, but what else can you say about the factors of x+1 by looking at the factors of x? This, I believe, is the main issue at heart here. The issue of "what the fuck does addition of 1 do to the prime factorization of a number".
there's a pretty shitty "proof" <a href="https://deepthoughtnews.wordpress.com/2019/12/13/solved-the-collatz-conjecture/">here</a>, written in C#, obviously.
Pretty much, someone thought they were smart by finding out that x must eventually hit some kind of 2k, good read if you're looking for some satire though.

## What is it?

The Collatz Conjecture can be defined simply as:

$$
F(x) =
 \begin{cases}
 \dfrac{n}{2} &\text{if }{n} \equiv 0 \\
 3{n}+1 &\text{if }{n} \equiv 1 \\
 \end{cases}
$$

With any number being passed in recursivly converging on 1 (apparently). [[cout-vs-printf]] C++ cout VS printf

Still unsolved, but verified for everynumber under 268, so gotta start around 3 quintillion.

By adding 1 to your number x, you shuffle its prime factors in a certain way. Its easy to see that x and x+1 share no factors in common, but what else can you say about the factors of x+1 by looking at the factors of x? This, I believe, is the main issue at heart here. The issue of "what the fuck does addition of 1 do to the prime factorization of a number".

there's a pretty shitty "proof" [here](https://deepthoughtnews.wordpress.com/2019/12/13/solved-the-collatz-conjecture/), written in C#, obviously.

Pretty much, someone thought they were smart by finding out that x must eventually hit some kind of 2k, good read if you're looking for some satire though.