Jishe Feng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jishe Feng has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
Cunqin Shi
Department of Mathematics Longdong University 745000 Qingyang Gansu China
1 shared publicationHongtao Fan
College of Science, Northwest A&F University, Yangling, Shaanxi, China
1 shared publication- Hongtao Fan
College of Science, Northwest A&F University, Yangling 712100, China
1 shared publication Huani Zhao
Department of Mathematics Longdong University 745000 Qingyang Gansu China
1 shared publicationQiaoling Wan
1 shared publicationWanjun Li
1 shared publication
Latest Publications
- Open Access
- 6 November 2025
- Published by MDPI AG in Preprints.org
Using Binary and Bezout Identity to Prove Collatz Conjecture
We propose a novel framework utilizing a full binary tree structure to systematically represent the set of natural numbers, which we classify into three subsets: pure odd numbers, pure even numbers, and mixed numbers. Within this framework, we employ a binary string representation for natural numbers and develop a comprehensive composite methodology that integrate both odd- and even-number functions. Our investigation centers on the itera- tive dynamics of the Collatz function and its reduced variant, which effectively serves as a pruning mechanism for the full binary tree, enabling rigorous exam- ination of the Collatz conjecture’s validity. To establish a robust foundation for this conjecture, we ingeniously incorporate binary strings into an algebraic formulation that fundamentally captures the intrinsic properties of the Col- latz sequence. Through this analytical framework, we demonstrate that the sequence generated by infinite iterations of the Collatz function constitutes an eventually periodic sequence, thereby providing a discuss of this long-standing mathematical conjecture that has remained unresolved for 87 years.
- 6 November 2025
- Published by MDPI AG in Preprints.org
Open AccessUsing Binary and Bezout Identity to Prove Collatz Conjecture
We propose a novel framework utilizing a full binary tree structure to systematically represent the set of natural numbers, which we classify into three subsets: pure odd numbers, pure even numbers, and mixed numbers. Within this framework, we employ a binary string representation for natural numbers and develop a comprehensive composite methodology that integrate both odd- and even-number functions. Our investigation centers on the itera- tive dynamics of the Collatz function and its reduced variant, which effectively serves as a pruning mechanism for the full binary tree, enabling rigorous exam- ination of the Collatz conjecture’s validity. To establish a robust foundation for this conjecture, we ingeniously incorporate binary strings into an algebraic formulation that fundamentally captures the intrinsic properties of the Col- latz sequence. Through this analytical framework, we demonstrate that the sequence generated by infinite iterations of the Collatz function constitutes an eventually periodic sequence, thereby providing a discuss of this long-standing mathematical conjecture that has remained unresolved for 87 years.
- Open Access
- 7 June 2024
- Published by MDPI AG in Preprints.org
Collatz Conjecture Is Analogous to an Inverse Function of Natural Number
We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string representation for natural numbers and elaborate on the composite methodology encompassing odd- and even-number functions. Our analysis focuses on examining the iteration sequence (or composition) of the Collatz function and its reduced variant, which serves as an analog to the inverse function, to scrutinize the validity of the Collatz conjecture. To substantiate this conjecture, we incorporate binary strings into an algebraic formula that captures the essence of the Collatz sequence. By this means, we transform discrete powers of 2 into continuous counterparts, ultimately culminating in the smallest natural number, 1. Consequently, the sequence generated through infinite iterations of the Collatz function emerges as an eventually periodic sequence, thereby validating an enduring 87-year-old conjecture.
- 7 June 2024
- Published by MDPI AG in Preprints.org
Open AccessCollatz Conjecture Is Analogous to an Inverse Function of Natural Number
We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string representation for natural numbers and elaborate on the composite methodology encompassing odd- and even-number functions. Our analysis focuses on examining the iteration sequence (or composition) of the Collatz function and its reduced variant, which serves as an analog to the inverse function, to scrutinize the validity of the Collatz conjecture. To substantiate this conjecture, we incorporate binary strings into an algebraic formula that captures the essence of the Collatz sequence. By this means, we transform discrete powers of 2 into continuous counterparts, ultimately culminating in the smallest natural number, 1. Consequently, the sequence generated through infinite iterations of the Collatz function emerges as an eventually periodic sequence, thereby validating an enduring 87-year-old conjecture.
- Open Access
- 8 May 2024
- Published by MDPI AG in Preprints.org
Using Full Binary Directed Tree Proof the Collatz Conjecture
We use binary string to represent a natural number and show the composite procedure of odd-number and even-number functions, thus we propose full binary directed tree to represent the set of natural numbers and give another partition the natural number set to three sets: pure odd, pure even and mixed number. For the Collatz conjecture we make use of the parity of a natural number to analyse the sequence of iteration (or composite) of Collatz function and reduced Collatz function analog to the inverse function. We give tabular and binary strings to the algebra expression to state the sequence of Collatz, this is the key topic to proof the conjecture: the discrete powers of 2 can be changed to ultimately continuous powers of 2, finally get to pure even number and to the smallest number 1. The sequence created by the infinite iterations of the Collatz function becomes the ultimately periodic sequence if any natural number is the beginning value, proving the conjecture that has been held for 87 years.
- 8 May 2024
- Published by MDPI AG in Preprints.org
Open AccessUsing Full Binary Directed Tree Proof the Collatz Conjecture
We use binary string to represent a natural number and show the composite procedure of odd-number and even-number functions, thus we propose full binary directed tree to represent the set of natural numbers and give another partition the natural number set to three sets: pure odd, pure even and mixed number. For the Collatz conjecture we make use of the parity of a natural number to analyse the sequence of iteration (or composite) of Collatz function and reduced Collatz function analog to the inverse function. We give tabular and binary strings to the algebra expression to state the sequence of Collatz, this is the key topic to proof the conjecture: the discrete powers of 2 can be changed to ultimately continuous powers of 2, finally get to pure even number and to the smallest number 1. The sequence created by the infinite iterations of the Collatz function becomes the ultimately periodic sequence if any natural number is the beginning value, proving the conjecture that has been held for 87 years.
- Open Access
- 19 September 2023
- Published by MDPI AG in Preprints.org
Proof the Collatz Conjecture by a new view of natural numbers
The two main strategies used in this study are the binary representation and the decomposition of a natural number into many compound functions of odd function and even function. The Collatz conjecture regarding odd even numbers in number theory can be examined and discussed using them in this way: The sequence created by the finite iterations of the Collatz function becomes the ultimately periodic sequence if any natural number is the beginning value, proving the conjecture that has been held for 85 years.
- 19 September 2023
- Published by MDPI AG in Preprints.org
Open AccessProof the Collatz Conjecture by a new view of natural numbers
The two main strategies used in this study are the binary representation and the decomposition of a natural number into many compound functions of odd function and even function. The Collatz conjecture regarding odd even numbers in number theory can be examined and discussed using them in this way: The sequence created by the finite iterations of the Collatz function becomes the ultimately periodic sequence if any natural number is the beginning value, proving the conjecture that has been held for 85 years.
- Open Access
- 19 May 2023
- Published by MDPI AG in Preprints.org
Proof the Collatz Conjecture in Binary Strings
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.
- 19 May 2023
- Published by MDPI AG in Preprints.org
Open AccessProof the Collatz Conjecture in Binary Strings
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.
- Open Access
- 20 February 2023
- Published by MDPI AG in Preprints.org
Solve the 3x+1 Problem by the Multiplication and Division of Binary Numbers
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.
- 20 February 2023
- Published by MDPI AG in Preprints.org
Open AccessSolve the 3x+1 Problem by the Multiplication and Division of Binary Numbers
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.
- 1 October 2022
- Published by Springer Nature in Frontiers of Mathematics
- Vol. 17 (5) , 747-766
The research and progress of the enumeration of lattice paths
- 1 October 2022
- Published by Springer Nature in Frontiers of Mathematics
- Vol. 17 (5) , 747-766
The research and progress of the enumeration of lattice paths
- Open Access
- 1 October 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2068 (1) , 012007
The Explicit Formulae of the Determinants of Specific Pentadiagonal Toeplitz Hessenberg Matrices
The pentadiagonal Toeplitz matrix is a special kind of sparse matrix widely used in linear algebra, combinatorics, computational mathematics, and has been attracted much attention. We use the determinants of two specific Hessenberg matrices to represent the recurrence relations to prove two explicit formulae to evaluate the determinants of specific pentadiagonal Toeplitz matrices proposed in a recent paper [3]. Further, four new results are established.
- 1 October 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2068 (1) , 012007
Open AccessThe Explicit Formulae of the Determinants of Specific Pentadiagonal Toeplitz Hessenberg Matrices
The pentadiagonal Toeplitz matrix is a special kind of sparse matrix widely used in linear algebra, combinatorics, computational mathematics, and has been attracted much attention. We use the determinants of two specific Hessenberg matrices to represent the recurrence relations to prove two explicit formulae to evaluate the determinants of specific pentadiagonal Toeplitz matrices proposed in a recent paper [3]. Further, four new results are established.
- Open Access
The explicit formula of Hankel determinant with Catalan elements
Applying Johann Cigler's Hankel determinant formula in terms of the binomial coefficient determinants, which is simplified from Christian Krattenthale's, we get an explicit formula of Hankel determinants for general. As far as I know, those are new results.
Open AccessThe explicit formula of Hankel determinant with Catalan elements
Applying Johann Cigler's Hankel determinant formula in terms of the binomial coefficient determinants, which is simplified from Christian Krattenthale's, we get an explicit formula of Hankel determinants for general. As far as I know, those are new results.
- Open Access
Two deformed Pascal's triangles and its new properties
In this paper, firstly, by a determinant of deformed Pascal's triangle, namely the normalized Hessenberg matrix determinant, to count Dyck paths, we give another combinatorial proof of the theorems which are of Catalan numbers determinant representations and the recurrence formula. Secondly, a determinant of normalized Toeplitz-Hessenberg matrix, whose entries are binomials, arising in power series, we derive new four properties of Pascal's triangle.
Open AccessTwo deformed Pascal's triangles and its new properties
In this paper, firstly, by a determinant of deformed Pascal's triangle, namely the normalized Hessenberg matrix determinant, to count Dyck paths, we give another combinatorial proof of the theorems which are of Catalan numbers determinant representations and the recurrence formula. Secondly, a determinant of normalized Toeplitz-Hessenberg matrix, whose entries are binomials, arising in power series, we derive new four properties of Pascal's triangle.