Calculation of the Number of Transactions for Collatz Conjecture

In this article we have constructed a basic methodology from which important perspectives for both the Collatz conjecture and Beal's conjecture can be derived. We falsified the conjecture we previously developed on Beal's conjecture and made the falsified conjecture usable for Collatz conjecture. In this regard, we have clearly expressed the numbers that can reach 1 in the Collatz conjecture. Then, using this, we created a limit for the numbers that should be considered for the Collatz conjecture. Thanks to the analysis of this limit, we have clearly expressed the recursive Collatz function in an equation. Using this structure, we wrote a function that indicates how many times the Collatz function repeats certain numbers to reach 1.