{"page_number":94,"title":"Page 094","overview":"This page discusses the historical discovery and significance of the Riemann zeta function, particularly Euler's product formula connecting it to prime numbers. It explains how this formula implies the infinitude of primes and highlights the modern relevance of prime numbers in cryptography and electronic commerce. The page concludes with a brief mention of Euler's formula for complex exponentials.","text_summary":"The page begins by introducing the function $\\zeta(s)$, noting that while it is now known as the Riemann zeta function, its fundamental property was discovered by Euler in 1748, as documented in his \"Introduction to Analysis of the Infinite\". Euler found that this function, defined as a sum over integers, is equivalent to a product over prime numbers. Specifically, the sum $\\zeta(s) = \\frac{1}{1^s} + \\frac{1}{2^s} + \\frac{1}{3^s} + \\dots$ is equal to the product $\\frac{1}{1-2^s} \\cdot \\frac{1}{1-3^s} \\cdot \\frac{1}{1-5^s} \\cdot \\frac{1}{1-7^s} \\cdot \\frac{1}{1-11^s} \\dots$, where the denominators use prime numbers (2, 3, 5, 7, 11, etc.).\n\nThis formula was groundbreaking, providing the first link between continuous analysis and the discrete, enigmatic world of prime numbers. The text explains how the zeta function helps unlock the mysteries of primes. It then illustrates how Euler's formula can be used to demonstrate that there are infinitely many prime numbers. If the number of primes were finite, the product side of the formula would yield a finite value. However, when $s=1$, the sum side becomes the harmonic series ($1 + 1/2 + 1/3 + \\dots$), which Oresme proved to be infinite. This contradiction proves that there must be an infinite supply of primes.\n\nWhile Euclid had already proven the infinitude of primes, Euler's proof offered a deeper analytical insight. The page emphasizes the increasing importance of prime numbers in the 20th century, particularly for securing electronic transactions. The process of multiplying large prime numbers is used to \"hide\" sensitive information, forming the basis of modern cryptography. This application necessitates an infinite supply of primes to avoid reusing them in transactions, which underpins the foundations of electronic commerce.\n\nFinally, the page transitions to another significant contribution of Euler, mentioning his famous formula for complex exponentials: $e^{i\\theta} = \\cos(\\theta) + i \\sin(\\theta)$.","content_markdown":"# Page 094\n\n### Page Overview\nThis page discusses the historical discovery and significance of the Riemann zeta function, particularly Euler's product formula connecting it to prime numbers. It explains how this formula implies the infinitude of primes and highlights the modern relevance of prime numbers in cryptography and electronic commerce. The page concludes with a brief mention of Euler's formula for complex exponentials.\n\n### Text Content Summary\nThe page begins by introducing the function $\\zeta(s)$, noting that while it is now known as the Riemann zeta function, its fundamental property was discovered by Euler in 1748, as documented in his \"Introduction to Analysis of the Infinite\". Euler found that this function, defined as a sum over integers, is equivalent to a product over prime numbers. Specifically, the sum $\\zeta(s) = \\frac{1}{1^s} + \\frac{1}{2^s} + \\frac{1}{3^s} + \\dots$ is equal to the product $\\frac{1}{1-2^s} \\cdot \\frac{1}{1-3^s} \\cdot \\frac{1}{1-5^s} \\cdot \\frac{1}{1-7^s} \\cdot \\frac{1}{1-11^s} \\dots$, where the denominators use prime numbers (2, 3, 5, 7, 11, etc.).\n\nThis formula was groundbreaking, providing the first link between continuous analysis and the discrete, enigmatic world of prime numbers. The text explains how the zeta function helps unlock the mysteries of primes. It then illustrates how Euler's formula can be used to demonstrate that there are infinitely many prime numbers. If the number of primes were finite, the product side of the formula would yield a finite value. However, when $s=1$, the sum side becomes the harmonic series ($1 + 1/2 + 1/3 + \\dots$), which Oresme proved to be infinite. This contradiction proves that there must be an infinite supply of primes.\n\nWhile Euclid had already proven the infinitude of primes, Euler's proof offered a deeper analytical insight. The page emphasizes the increasing importance of prime numbers in the 20th century, particularly for securing electronic transactions. The process of multiplying large prime numbers is used to \"hide\" sensitive information, forming the basis of modern cryptography. This application necessitates an infinite supply of primes to avoid reusing them in transactions, which underpins the foundations of electronic commerce.\n\nFinally, the page transitions to another significant contribution of Euler, mentioning his famous formula for complex exponentials: $e^{i\\theta} = \\cos(\\theta) + i \\sin(\\theta)$.\n\n### Visual Elements (Diagrams, Figures, Graphs, Portraits, Illustrations)\n*No visual elements on this page.*","has_visuals":0,"visual_count":0,"visuals":[]}