Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore generalized variants of the famous Collatz conjecture (3n+1 problem) through computational analysis using Wolfram Technologies in this 21-minute conference talk. Delve into the mathematical investigation of "statistically balanced" functions that exhibit zero bias, making them theoretically more challenging to prove than the classical Collatz conjecture. Learn how computational tools can be leveraged to analyze these mathematical variants and understand why certain generalizations present greater theoretical difficulties. Discover the intersection of computational mathematics and number theory as you examine how Wolfram's computational capabilities enable researchers to explore complex mathematical conjectures that remain unsolved despite their simple explanations.
