Yolcu, E., Aaronson, S. and Heule, M.J.H. (2021) An Automated Approach to the Collatz Conjecture. In: Platzer, A. and Sutcliffe, G., Eds., Lecture Notes in Computer Science, Vol. 12699, Springer, Cham.
https://doi.org/10.1007/978-3-030-79876-5_27

has been cited by the following article:

• TITLE: Proof of Collatz Conjecture Using Division Sequence

  AUTHORS: Masashi Furuta

  KEYWORDS: Collatz Conjecture, Division sequence, Well-Founded Induction, 1Idris, 2Egison

  JOURNAL NAME: Advances in Pure Mathematics, Vol.12 No.2, February 25, 2022

  ABSTRACT: The purpose of this study is to prove the Collatz conjecture using a theorem proving system. First, the division sequence is defined as an alignment of the number of times division by 2 is performed in the Collatz operation. Then, the star conversion is defined, which is a mapping from a specific division sequence to a division sequence. Here it is important to map to some division sequence, not which division sequence. The important point is that the finite length of the division sequence does not change before and after the star conversion. In theorem proving system, we considered two parallel methods: main-proof is a claim to a computer proposition that has the same meaning as the Collatz conjecture. Theorem proving support system “Idris” was used. Moreover, we sub-proved that the 12 “extended star conversion” are closed to the “Collatz operation”. Egison’s computer algebra system is used for proof. The results of the two methods achieved the goal of proving the Collatz conjecture using a theorem proving system.