NO Podrás Resolver este Simple Problema Matemático ¿O Sí?

NO Podrás Resolver este Simple Problema Matemático ¿O Sí?

The Most Dangerous Problem in Mathematics

Introduction to the Problem

  • The problem discussed is considered one of the most dangerous in mathematics, often dismissed by young mathematicians as a mere conjecture that remains unsolved by even the best minds.
  • Paul Erdős, a renowned mathematician, stated that "mathematics is not mature enough for such questions." This highlights the complexity and depth of the issue at hand.

Applying the Rules

  • Two rules are applied based on whether a chosen number is odd or even:
  • If odd, multiply by three and add 1.
  • If even, divide by two.
  • For example, starting with 7 (odd), it becomes 22 after applying these rules sequentially.

The Conjecture Explained

  • The conjecture posits that any positive integer will eventually reach a cycle of 4 → 2 → 1 when these rules are applied repeatedly. This is known as the Collatz Conjecture, named after German mathematician Lothar Collatz from the 1930s.
  • Other names associated with this problem include Ulam's conjecture and Syracuse problem among others, indicating its historical significance and various interpretations within mathematical circles.

Understanding Number Behavior

Granizo Numbers

  • The numbers generated through this process are referred to as "granizo numbers," which rise and fall like hailstones in a storm cloud but ultimately reduce to one—at least that's what is believed so far.
  • An example given is number 27 which takes significantly longer (111 steps) to reach one compared to smaller numbers like 10 (10 steps). This illustrates variability in how different integers behave under these operations.

Patterns and Randomness

  • Mathematicians have struggled to find patterns in how numbers approach one; randomness appears prevalent despite all paths leading back to one eventually. A graph representing this behavior resembles stock market fluctuations over time due to its erratic nature.

Mathematical Analysis Techniques

Expert Opinions

  • Jeffrey Lagarias warns against pursuing research on this problem if one desires a successful career in mathematics, suggesting it's seen as an unproductive endeavor by some experts. However, Alex Kontorovich chose not to heed this advice and explored patterns within granizo sequences instead.

Logarithmic Insights

  • By taking logarithms of sequences generated from granizo numbers, researchers can observe trends that resemble stock market graphs—indicating underlying randomness similar to financial markets while also showing downward tendencies over time for these sequences.

Statistical Patterns Across Numbers

First Digit Distribution

  • Analyzing first digits of granizo numbers reveals interesting statistical distributions; for instance:
  • Approximately 30% start with 1, 17% with 2, decreasing further for higher digits.
  • This pattern aligns with Benford's Law—a principle used in fraud detection across various fields including finance and elections due to its reliability when analyzing large datasets spanning multiple orders of magnitude.

Applications of Benford's Law

The 3x + 1 Conjecture Explained

Understanding the Growth of Sequences

  • The application of the formula 3x + 1 leads to all numbers ending in 1, suggesting an equal distribution of even and odd numbers. Odd numbers triple while even numbers halve, indicating that sequences should grow on average rather than shrink.
  • When multiplying an odd number by 3 and adding 1, it always results in an even number. The next step is dividing this even number by 2, which means odd numbers effectively grow at a rate of approximately 3/2 .
  • After obtaining an even number, there’s a chance (50%) that dividing by 2 will yield another odd number. In some cases (25%), one can divide by 4 before reaching the next odd number.
  • Continuing this pattern, one can divide by higher powers of two (8, 16, etc.) before hitting the next odd number. Statistically speaking, these sequences are more likely to reduce than increase.

Visualizing Number Sequences

  • For example, starting with the number 341 and applying 3x + 1, you reach 1024. This can be halved multiple times until reaching the value of 1.
  • A directed graph visualizes how each number connects to its successor in the sequence; it resembles a tree or flowing rivers leading towards a larger river representing convergence to values like 4 to 2 to 1.

Potential Counterexamples

  • If the conjecture were false, there could exist a starting point leading to infinite growth or a closed cycle disconnected from the main graph. However, no such cycles have been found despite extensive testing.
  • Mathematicians have tested up to 2^68, covering trillions of numbers without finding any counterexamples that disprove the conjecture.

Statistical Evidence Supporting Validity

  • It has been established that any cycle not including 4 to 2 to 1 must consist of at least 186 billion numbers long for it to be plausible.
  • To prove the conjecture using scatter plots: if every sequence contains at least one smaller value than its origin point, then it supports convergence towards one.

Recent Developments in Research

  • In various studies since the late '70s through recent years (2019), researchers have shown that almost all sequences drop below their initial values significantly as they progress toward infinity.
  • Notably in recent findings from mathematician Terence Tao in 2020, he indicated that nearly all sequences will eventually yield values smaller than any arbitrary function approaching infinity as x increases.
  • Despite significant advancements and insights into this conjecture's behavior over vast ranges of integers, definitive proof remains elusive; thus far only statistical evidence exists supporting its validity without confirming absolute truth.

Conjectures and Cycles in Number Theory

The Growth of Origin Numbers

  • Discussion on origin numbers up to 10,000, with the highest number reaching 27 million for the origin number 9,663. It highlights that proving a number cannot shoot towards infinity requires only one counterexample.

Cycles in Negative Numbers

  • Introduction of cycles when including negative numbers under the same rules as the 3x + 1 conjecture. It reveals three independent cycles starting from low values like -17 and -5.

Evidence Supporting Conjectures

  • Terry Tao's evidence suggests almost all numbers have an arbitrarily small number in their sequence, but proving this for all numbers remains unverified.

Perfect Squares Among Natural Numbers

  • Analysis of perfect squares within ranges: 10% of numbers up to 100 are perfect squares; only 3.1% up to 1000. As limits approach infinity, most natural numbers are not perfect squares.

Collatz Conjecture Testing

  • All numbers up to 2^68 have been tested against the Collatz conjecture without finding a counterexample, emphasizing the vastness of possibilities yet unexplored.

Counterexamples and Computational Limits

Historical Counterexamples

  • Reference to Georges Polya's conjecture from 1919 about prime factors being odd in most natural numbers, which was refuted by Bryant Hasselhoff in 1958 with a counterexample significantly larger than previously evaluated ranges.

Conceptualizing Number Behavior

  • The analogy of viewing the Collatz process as a Turing machine where input is transformed through finite states (68 slots), raising questions about predictability beyond finite selections.

Random Behavior and Control Over Sequences

  • Discussion on calculating specific behaviors within finite bounds while acknowledging that any proven number eventually falls to one if no counterexample exists.

Indecidability and Mathematical Challenges

Difficulty in Proving Falsehood

  • Reflection on the challenges faced over two decades working on the Collatz problem; it’s hard to prove false statements due to potential hidden divergent paths within sequences.

Indecidability Implications

  • Mention of Jon Conway's fractal machine illustrating that some mathematical problems may never be resolved due to inherent undecidability issues similar to those faced by Turing machines.

The Nature of Mathematics

Limitations of Mathematical Knowledge

  • Acknowledgment that despite extensive knowledge, some problems remain unsolvable; this realization challenges perceptions about mathematics being fully resolvable.

Complexity and Peculiarity of Numbers

  • Personal reflection on how complex and peculiar numbers can be rather than merely regular patterns; they exhibit intricate structures akin to organic forms yet remain unresolved mathematically.

Turn any video into a summary like this

YouTube links, meetings, lectures. With transcripts, search, and chat.

Video description

La conjetura de Collatz es el problema matemático más simple que nadie puede resolver: es lo suficientemente fácil para que casi cualquiera lo entienda, pero es notoriamente difícil de resolver. 🧮SUSCRÍBETE para ver todos nuestros videos: http://bit.ly/Suscribirse_Veritasium_ES Un agradecimiento especial al profesor Alex Kontorovich por introducirnos en este tema, filmar la entrevista y asesorarnos en el guión y en los primeros borradores de este video. ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ Referencias: Lagarias, J. C. (2006). The 3x+ 1 problem: An annotated bibliography, II (2000-2009). arXiv preprint math/0608208. — https://ve42.co/Lagarias2006 Lagarias, J. C. (2003). The 3x+ 1 problem: An annotated bibliography (1963–1999). The ultimate challenge: the 3x, 1, 267-341. — https://ve42.co/Lagarias2003 Tao, T (2020). The Notorious Collatz Conjecture — https://ve42.co/Tao2020 A. Kontorovich and Y. Sinai, Structure Theorem for (d,g,h)-Maps, Bulletin of the Brazilian Mathematical Society, New Series 33(2), 2002, pp. 213-224. A. Kontorovich and S. Miller Benford's Law, values of L-functions and the 3x+1 Problem, Acta Arithmetica 120 (2005), 269-297. A. Kontorovich and J. Lagarias Stochastic Models for the 3x + 1 and 5x + 1 Problems, in "The Ultimate Challenge: The 3x+1 Problem," AMS 2010. Tao, T. (2019). Almost all orbits of the Collatz map attain almost bounded values. arXiv preprint arXiv:1909.03562. — https://ve42.co/Tao2019 Conway, J. H. (1987). Fractran: A simple universal programming language for arithmetic. In Open problems in Communication and Computation (pp. 4-26). Springer, New York, NY. — https://ve42.co/Conway1987 ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ NO Podrás Resolver este Simple Problema Matemático ¿O Sí? Escrito por Derek Muller, Alex Kontorovich y Petr Lebedev Animación de Iván Tello, Jonny Hyman, Jesús Enrique Rascón y Mike Radjabov Filmado por Derek Muller y Emily Zhang Editado por Derek Muller SFX por Shaun Clifford Video adicional suministrado por Getty Images Producido por Derek Muller, Petr Lebedev y Emily Zhang Coral en 3D por Vasilis Triantafyllou y Niklas Rosenstein - https://ve42.co/3DCoral Visualización del coral por Algoritmarte - https://ve42.co/Coral ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ Nadie Pudo Resolver este Simple Problema Matemático | La Conjetura de Collatz Video en Inglés del Canal @veritasium: https://youtu.be/094y1Z2wpJg The Simplest Math Problem No One Can Solve - Collatz Conjecture ------------------------------------------------------------------------ 🕹 Este canal de Youtube es administrado por: https://www.unilingo.tv/ ❓Comentarios o sugerencias de traducción: info@unilingo.tv ------------------------------------------------------------------------ #veritasiumenespañol