daliondev / collatz-conjeture

This repository seeks to somehow "prove" the Collatz conjecture using different languages.

collatz-conjetura

The conjecture asks whether repeating two simple arithmetic operations will eventually transform every positive integer into 1. It concerns sequences of integers in which each term is obtained from the previous term as follows: if the previous term is even, the next term is one half of the previous term. If the previous term is odd, the next term is 3 times the previous term plus 1.

About repo

This repository seeks to recreate the collatz conjecture in a pure way in different languages, using only dependencies that the language brings with it.

must meet 2 fundamental parameters which are

• Each number passed by should be added to a list

• You must create a search engine that returns the largest number that was reached with the number that was given as input

Number to adjust your program