Booth Id:
MATH029
Category:
Mathematics
Year:
2017
Finalist Names:
Fosdick, Matthew
Abstract:
The Collatz conjecture is an unproven conjecture in mathematics; any initial input to the Collatz sequence will give an eventual output of one. The importance of proving the conjecture is due to the mathematical fields it crosses. Conjecture research has been considered in number theory, ergodic theory, and dynamical systems. The main strategies for proving the conjecture are: validating that no input can diverge to infinity, go in a loop, or proving the conjecture for exclusively even or odd numbers. This research focused on the experimental side to identify patterns and shared traits of numbers linked in the sequence. If the research can show a consistent change in prime factorization over time, it can be shown that the sequence cannot go in a loop, because no number will be in a circumstance where it can revert to a prior number. In my research, I developed a function, Collatz potential, closely related to the stop-time function, yet able to be calculated from one Collatz input. Potential is designed recursively so that if any input has a potential then that input must lead to one in the Collatz sequence. There were three objectives to this research: identify correlations between prime factorization that result in outputs with significantly shorter stopping times, determine the significance in patterning an input based on its Collatz potential, and identify pathways to proving or disproving the Collatz conjecture based on the previous two objectives. The methodology identified prime factors for any given Collatz input, specifically for that set of numbers containing multiple 2’s and from which one is subtracted. The developed Collatz potential may be applicable to other areas, such as cryptography because of its seemingly irreversible calculations and simplicity.