Skip to content

Commit d30a571

Browse files
author
André Bermudes Viana
authored
Added txt
1 parent b1977a2 commit d30a571

File tree

1 file changed

+24
-0
lines changed

1 file changed

+24
-0
lines changed
Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
Collatz Conjecture
2+
3+
The Collatz Conjecture says that if you take any number and follow the following steps, you will never be stuck in a loop.
4+
5+
If the number is even -> number = number/2;
6+
If the number is odd -> number = 3*number + 1;
7+
8+
If you continue to do this, at some point your number will be equal to 1.
9+
10+
Example: number = 26
11+
1 Step - number = 26/2 = 13
12+
2 Step - number = 13*3 + 1 = 40
13+
3 Step - number = 40/2 = 20
14+
4 Step - number = 20/2 = 10
15+
5 Step - number = 10/2 = 5
16+
6 Step - number = 3*5 + 1 = 16
17+
7 Step - number = 16/2 = 8
18+
8 Step - number = 8/2 = 4
19+
9 Step - number = 4/2 = 2
20+
10 Step - number = 2/2 = 1
21+
22+
For the number 26, 10 steps are needed, create a solution that calculates the number of steps for a given N number,
23+
and the biggest value the number had during the steps.
24+

0 commit comments

Comments
 (0)