Collatz's "3x+1" problem and iterative maps on interval
| dc.creator | Liang, Wang | |
| dc.date | 2006-08-29 | |
| dc.date | 2006-10-12 | |
| dc.date.accessioned | 2026-07-07T07:22:16Z | |
| dc.date.available | 2026-07-07T07:22:16Z | |
| dc.description | In this paper, we convert Collatz map into a simple conjugate iterative maps defined in [0,1]. Such maps are more familiar to us and easier to deal with. Some new features of this map are observed by this method. An interesting heuristic proof is also presented. This research may provide a new venture to crack the "3x+1" problem. | |
| dc.description | 15 pages,4 figures | |
| dc.identifier | https://arxiv.org/abs/math/0608708 | |
| dc.identifier | http://arxiv.org/abs/math/0608708 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115598 | |
| dc.subject | Number Theory | |
| dc.subject | Dynamical Systems | |
| dc.subject | 11B05 | |
| dc.title | Collatz's "3x+1" problem and iterative maps on interval | |
| dc.type | text |