# A bound regarding the Collatz conjecture from Wikipedia [closed]

Rigorous bounds
Although it is not known rigorously whether all positive numbers eventually reach one according to the Collatz iteration, it is known that many numbers do so. In particular, Krasikov and Lagarias showed that the number of integers in the interval $[1,x]$ that eventually reach one is at least proportional to $x^{0.84}$.

Would anyone know where I can learn more about this bound (why $0.84$?) or where the paper was published (is it online?). Cheers

## closed as off-topic by Did, Dietrich Burde, Michael Grant, user91500, JMPJan 4 '17 at 11:21

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Did, Dietrich Burde, Michael Grant, user91500, JMP
If this question can be reworded to fit the rules in the help center, please edit the question.

• I entered Krasikov and Lagarias in Google, and voila (click me)... – barak manos Jan 2 '17 at 16:16
• Two clicks search: arxiv.org/abs/math/0205002 Quote: "By computer aided proof we show that at least x^{0.84} of the integers below x contain 1 in their forward orbit under the 3x+1 map". – Did Jan 2 '17 at 16:16
• The bibliography at the bottom of that Wiki page has the original references. See [19] there. – B. Goddard Jan 2 '17 at 16:18
• Why $0.84$? Well, more precisely why $\log_2(\lambda)=0.84175\cdots$ – Dietrich Burde Jan 2 '17 at 16:24

The first Google search result for Krasikov and Lagarias is the relevant article on arXiv.