×

Collatz Conjecture

In Collatz Conjecture's sequence,

                             f(n)= n/2 ( if n is even)
3n+1 ( if n is odd)


Finally, we reach to the awesome number 1. This is the property of oneness.

The thing i want to say through this note is that, instead of 3n+1, we can also use n+1/2, which we also lead to the awesome number 1.

Note by Sudhir Aripirala
2 years, 7 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

The sequence in which $$f(n)=\frac{n+1}{2}$$ for odd $$n$$ is strictly decreasing, and will always reach $$1$$.

- 2 years, 7 months ago

Then what about 3n+1 @Alex Li

- 2 years, 7 months ago

The actual $$3n+1$$ problem is still unsolved, but it has been tested and verified for all values up to $$5.76\times10^{18}$$.

- 2 years, 7 months ago

We can also use n+1 @Alex Li

- 2 years, 7 months ago

Thanks @Alex Li for the solution!!!!

- 2 years, 7 months ago