Search results
Results from the WOW.Com Content Network
[7] Jeffrey Lagarias stated in 2010 that the Collatz conjecture "is an extraordinarily difficult problem, completely out of reach of present day mathematics". [8] However, though the Collatz conjecture itself remains open, efforts to solve the problem have led to new techniques and many partial results. [8] [9]
This page was last edited on 15 November 2024, at 11:43 (UTC).; Text is available under the Creative Commons Attribution-ShareAlike 4.0 License; additional terms may apply.
In the original Collatz sequence, the successor of n is either n / 2 (for even n) or 3n + 1 (for odd n). The value 3n + 1 is clearly even for odd n, hence the next term after 3n + 1 is surely 3n + 1 / 2 . In the sequence computed by the tag system below we skip this intermediate step, hence the successor of n is 3n + 1 / 2 ...
For n ≥ 2, a(n) is the prime that is finally reached when you start with n, concatenate its prime factors (A037276) and repeat until a prime is reached; a(n) = −1 if no prime is ever reached. A037274
The following other wikis use this file: Usage on ca.wikipedia.org Conjectura de Collatz; Usage on eu.wikipedia.org Collatzen aierua; Usage on fr.wikipedia.org
Main page; Contents; Current events; Random article; About Wikipedia; Contact us
The following other wikis use this file: Usage on ca.wikipedia.org Conjectura de Collatz; Usage on eu.wikipedia.org Collatzen aierua; Usage on fi.wikipedia.org
"The Collatz conjecture is a conjecture in mathematics that concerns a sequence defined as follows: start with any positive integer n. Then 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.