On the Probabilistic Proof of the Convergence of the Collatz Conjecture
A new approach towards probabilistic proof of the convergence of the Collatz conjecture is described via identifying a sequential correlation of even natural numbers by divisions by 2 that follows a recurrent pattern of the form x,1,x,1…, where x represents divisions by 2 more than once. The sequenc...
Saved in:
Main Author: | Kamal Barghout |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2019-01-01
|
Series: | Journal of Probability and Statistics |
Online Access: | http://dx.doi.org/10.1155/2019/6814378 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A New Proof of Rational Cycles for Collatz-Like Functions Using a Coprime Condition
by: Benjamin Bairrington, et al.
Published: (2023-01-01) -
A new proof of the GGR conjecture
by: Ash, J. Marshall, et al.
Published: (2023-01-01) -
Proof of Some Conjectures of Melham Using Ramanujan’s 1ψ1 Formula
by: Bipul Kumar Sarmah
Published: (2014-01-01) -
Statistical Λ-Convergence in Probabilistic Normed Spaces
by: M. Aldhaifallah, et al.
Published: (2017-01-01) -
Statistical Convergence of Double Sequences on Probabilistic Normed Spaces
by: S. Karakus, et al.
Published: (2007-01-01)