The following is the Collatz Conjecture: Suppose we begin with a positive number, multiply it by 3 and add 1 if it is odd, and divide it by 2 if it is even. Then continue doing this as long as you can. Will it matter where you start, whether you end up at the number 1? The Collatz conjecture has been studied for around 85 years. We transform the Collatz function from decimal to binary, then use the binary string's character to prove the Collatz conjecture. In addition, we use mathematics to give another interpretation to chaos, which is the ultimately periodic positive integer sequence.

The 3x+1 problem asks the following: Suppose we start with a positive integer, and if it is odd then multiply it by 3 and add 1, and if it is even, divide it by 2. Then repeat this process as long as you can. Do you eventually reach the integer 1, no matter what you started with? Collatz conjecture (or 3n+1 problem) has been explored for about 85 years. In this paper, we convert an integer number from decimal to binary number, and convert the Collatz function to binary function, which is multiplication and division of two binary numbers. Finally the iternation of the Collatz function, eventually reach the integer 1, thus we solve the 3x+1 problem completely.

In this paper, we deduce explicit formulas to evaluate the determinants of nonsymmetrical structure Toeplitz Bohemians by two determinants of specific Hessenberg Toeplitz matrices, which are linear combinations in terms of determinants of specific Hessenberg Toeplitz matrices. We get some new results very di¤erent from [Massimiliano Fasi, Gian Maria Negri Porzio, Determinants of normalized upper Hessenberg matrices, Electronic Journal of Linear Algebra, Volume 36, pp. 352-366, June 2020].