User:Eliora/Sandbox: Difference between revisions
No edit summary |
No edit summary |
||
| Line 8: | Line 8: | ||
together with the corresponding zeros implied by the symmetries of the Riemann zeta function. Because <math>1/N\neq \frac{1}{2}</math>, the result constituted a counterexample to the Riemann hypothesis. Independent verification of the zero subsequently established the hypothesis to be false, resolving what had widely been regarded as the foremost outstanding problem in mathematics. | together with the corresponding zeros implied by the symmetries of the Riemann zeta function. Because <math>1/N\neq \frac{1}{2}</math>, the result constituted a counterexample to the Riemann hypothesis. Independent verification of the zero subsequently established the hypothesis to be false, resolving what had widely been regarded as the foremost outstanding problem in mathematics. | ||
At 16:20:22 UTC, the first Fermat prime greater than 65,537 was announced. The number, <math>F_{M}=2^{2^{3477214914839}}+1=3.485272\ldots \times {10}^{6.292\ldots \times {10}^{1046745990736}},\</math> ends in …2625709057. The number is important as it is the number of sides of the first new constructible polygon found since 65537-gon. Contemporary media frequently referred to the number as <math>F_{5}</math>, owing to its description as the first Fermat prime discovered after the five classical examples. This notation was mathematically ambiguous, as <math>F_{5}</math> conventionally denotes the fifth-indexed Fermat ''number'', <math>2^{2^{5}}+1=4294967297</math>, which is composite. Nevertheless, extensive early publicity resulted in <math>F_{5}</math> becoming a common informal designation for the newly discovered prime. The alternative notation <math>F_{M}</math> was subsequently adopted in mathematical literature to distinguish it from the conventional Fermat-number indexing. | At 16:20:22 UTC, the first {{W|Fermat prime}} greater than 65,537 was announced. The number, <math>F_{M}=2^{2^{3477214914839}}+1=3.485272\ldots \times {10}^{6.292\ldots \times {10}^{1046745990736}},\</math> ends in …2625709057. The number is important as it is the number of sides of the first new constructible polygon found since 65537-gon. Contemporary media frequently referred to the number as <math>F_{5}</math>, owing to its description as the first Fermat prime discovered after the five classical examples. This notation was mathematically ambiguous, as <math>F_{5}</math> conventionally denotes the fifth-indexed Fermat ''number'', <math>2^{2^{5}}+1=4294967297</math>, which is composite. Nevertheless, extensive early publicity resulted in <math>F_{5}</math> becoming a common informal designation for the newly discovered prime. The alternative notation <math>F_{M}</math> was subsequently adopted in mathematical literature to distinguish it from the conventional Fermat-number indexing. | ||
At 16:34:45 UTC, software used in the ongoing search for odd perfect numbers incorporated <math>F_{M}</math> into its search parameters and identified it as the special prime of a second odd perfect number, subsequently designated <math>N_{2}</math>. In abridged notation, <math>N_{2}\approx 6.189237272\times {10}^{5.4181\times {10}^{1046746112244}}</math>, with final digits …3737117649. In the Eulerian factorization of <math>N_{2}</math>, <math>F_{M}</math> occurs to the 65,537th power, <math>N_{2}=F_{M}^{65537}m^{2}</math>, where <math>m</math> is odd and coprime to <math>F_{M}</math>. The exponent 65,537 is itself a Fermat prime, coincidentally. | At 16:34:45 UTC, software used in the ongoing search for odd perfect numbers incorporated <math>F_{M}</math> into its search parameters and identified it as the special prime of a second odd perfect number, subsequently designated <math>N_{2}</math>. In abridged notation, <math>N_{2}\approx 6.189237272\times {10}^{5.4181\times {10}^{1046746112244}}</math>, with final digits …3737117649. In the Eulerian factorization of <math>N_{2}</math>, <math>F_{M}</math> occurs to the 65,537th power, <math>N_{2}=F_{M}^{65537}m^{2}</math>, where <math>m</math> is odd and coprime to <math>F_{M}</math>. The exponent 65,537 is itself a Fermat prime, coincidentally. | ||
| Line 15: | Line 15: | ||
The extraordinary concentration of major results on 29 January 2030 was widely regarded as unprecedented in the history of mathematics. Within a single day, several long-standing problems—including the existence of odd perfect numbers, Goldbach's conjecture, the Collatz conjecture and the Riemann hypothesis—were resolved or overturned, alongside the discovery of the first Fermat prime since the seventeenth century. The event was considered particularly remarkable because the results were not merely simultaneous: successive discoveries repeatedly supplied the mathematical objects used in later ones, with the newly identified numbers <math>N_{1}</math>, <math>G</math>, <math>F_{M}</math>, <math>N_{2}</math> and <math>C</math> becoming interconnected across otherwise largely unrelated fields of number theory. The resulting sequence of announcements received extensive international media coverage and became known collectively as the Day of Mathematics, with contemporary commentary frequently comparing the experience of following the discoveries in real time to a major breaking-news event rather than the conventional publication of mathematical research. | The extraordinary concentration of major results on 29 January 2030 was widely regarded as unprecedented in the history of mathematics. Within a single day, several long-standing problems—including the existence of odd perfect numbers, Goldbach's conjecture, the Collatz conjecture and the Riemann hypothesis—were resolved or overturned, alongside the discovery of the first Fermat prime since the seventeenth century. The event was considered particularly remarkable because the results were not merely simultaneous: successive discoveries repeatedly supplied the mathematical objects used in later ones, with the newly identified numbers <math>N_{1}</math>, <math>G</math>, <math>F_{M}</math>, <math>N_{2}</math> and <math>C</math> becoming interconnected across otherwise largely unrelated fields of number theory. The resulting sequence of announcements received extensive international media coverage and became known collectively as the Day of Mathematics, with contemporary commentary frequently comparing the experience of following the discoveries in real time to a major breaking-news event rather than the conventional publication of mathematical research. | ||
== First odd perfect number == | |||
The first odd perfect number, designated <math>N</math>, and approximately equal to <math>1.1274354961045\ldots \times {10}^{1,353,382}</math>, is the first discovered odd positive integer equal to the sum of its proper positive divisors. Its decimal representation contains 1,353,383 digits and ends in …94689796301. It is strongly believed to be the smallest (and hence sequentially the first odd perfect number on the number line), although verification is ongoing. | |||
The number was discovered on 27 January 2030 by a joint team from twelve universities in the United States, Europe and Singapore, with additional support from the {{W|Great Internet Mersenne Prime Search}} (GIMPS). Although GIMPS is primarily concerned with Mersenne primes, computational techniques developed for its prime searches were adapted to identify prime factors satisfying the known constraints on odd perfect numbers. The discovery was confirmed on the early morning of 29th of January and announced to the public shortly afterwards. | |||
The discovery resolved the approximately 2,000-year-old question of whether odd perfect numbers exist. It was made using the method of characteristics, a number-theoretic search method that traces possible factorizations along characteristic lines subject to progressively stronger necessary conditions for odd perfect numbers. The method is unrelated to the method of characteristics used for partial differential equations. | |||
If it is proven to be the smallest odd perfect number, it will be the 36th perfect number overall in increasing numerical order, lying between the 35th even perfect number, <math>2^{1,398,268}\left(2^{1,398,269}-1\right)</math>, and the 36th even perfect number, <math>2^{2,976,220}\left(2^{2,976,221}-1\right)</math>. | |||
Revision as of 21:05, 11 September 2026
On 29 January 2030, a series of major mathematical breakthroughs were announced within hours of one another, resolving several of the longest-standing open problems in mathematics. The events began at approximately 08:00–09:00 UTC, when a multinational research collaboration spanning twelve universities in seven countries announced the discovery and verification of the first known odd perfect number, designated [math]\displaystyle{ N }[/math], with an approximate value of [math]\displaystyle{ N=1.1274354961045…×10^{1,353,382} }[/math]. The discovery established for the first time that odd perfect numbers exist, resolving a problem whose origins date to antiquity.
At 12:24 UTC, an independent collaboration involving fourteen universities announced the discovery of the first 'elite number', the term used by the project for an even integer greater than 2 that cannot be expressed as the sum of two prime numbers and therefore constitutes a counterexample to the Goldbach conjecture. The number, designated [math]\displaystyle{ G }[/math], was approximately [math]\displaystyle{ G=2.368259249829…×10^{136,248,339,111} }[/math]. The discovery resulted from a reformulation of the collaboration's original research programme. Rather than attempting to establish the Goldbach conjecture universally, the project had increasingly treated its negation as a direct search problem, asking whether any elite numbers existed. The identification and subsequent verification of [math]\displaystyle{ G }[/math] disproved the conjecture.
At 16:15:34 UTC, Solace, an artificial-intelligence system operated by a research team led by Luke Bannon and Coraline Seng and designed to investigate the Riemann hypothesis, autonomously incorporated [math]\displaystyle{ N }[/math] and [math]\displaystyle{ G }[/math] into its ongoing search. The system reported that [math]\displaystyle{ \zeta \left(\frac{1}{N}+Gi\right)=0 }[/math], together with the corresponding zeros implied by the symmetries of the Riemann zeta function. Because [math]\displaystyle{ 1/N\neq \frac{1}{2} }[/math], the result constituted a counterexample to the Riemann hypothesis. Independent verification of the zero subsequently established the hypothesis to be false, resolving what had widely been regarded as the foremost outstanding problem in mathematics.
At 16:20:22 UTC, the first Fermat prime greater than 65,537 was announced. The number, [math]\displaystyle{ F_{M}=2^{2^{3477214914839}}+1=3.485272\ldots \times {10}^{6.292\ldots \times {10}^{1046745990736}},\ }[/math] ends in …2625709057. The number is important as it is the number of sides of the first new constructible polygon found since 65537-gon. Contemporary media frequently referred to the number as [math]\displaystyle{ F_{5} }[/math], owing to its description as the first Fermat prime discovered after the five classical examples. This notation was mathematically ambiguous, as [math]\displaystyle{ F_{5} }[/math] conventionally denotes the fifth-indexed Fermat number, [math]\displaystyle{ 2^{2^{5}}+1=4294967297 }[/math], which is composite. Nevertheless, extensive early publicity resulted in [math]\displaystyle{ F_{5} }[/math] becoming a common informal designation for the newly discovered prime. The alternative notation [math]\displaystyle{ F_{M} }[/math] was subsequently adopted in mathematical literature to distinguish it from the conventional Fermat-number indexing.
At 16:34:45 UTC, software used in the ongoing search for odd perfect numbers incorporated [math]\displaystyle{ F_{M} }[/math] into its search parameters and identified it as the special prime of a second odd perfect number, subsequently designated [math]\displaystyle{ N_{2} }[/math]. In abridged notation, [math]\displaystyle{ N_{2}\approx 6.189237272\times {10}^{5.4181\times {10}^{1046746112244}} }[/math], with final digits …3737117649. In the Eulerian factorization of [math]\displaystyle{ N_{2} }[/math], [math]\displaystyle{ F_{M} }[/math] occurs to the 65,537th power, [math]\displaystyle{ N_{2}=F_{M}^{65537}m^{2} }[/math], where [math]\displaystyle{ m }[/math] is odd and coprime to [math]\displaystyle{ F_{M} }[/math]. The exponent 65,537 is itself a Fermat prime, coincidentally. In parallel, at 16:40:00 UTC, Kindred, an artificial-intelligence research system operated since 2028 with the objective of resolving the Collatz conjecture, incorporated the newly reported factorization of [math]\displaystyle{ N_{2} }[/math] into its search. Kindred determined that the second prime factor of [math]\displaystyle{ N_{2} }[/math], subsequently designated [math]\displaystyle{ C }[/math], was a counterexample to the conjecture. Its Collatz orbit was shown to be unbounded and therefore never to reach 1. The result constituted the first known non-Collatzian positive integer and disproved the Collatz conjecture. At 16:46:24 UTC, the values of [math]\displaystyle{ F_{M} }[/math] and [math]\displaystyle{ C }[/math] were incorporated into a further search conducted by Solace. The system subsequently identified a second non-trivial zero of the Riemann zeta function lying outside the critical line, satisfying [math]\displaystyle{ \zeta \left(\frac{1}{F_{M}}+Ci\right)=0 }[/math]. The discovery provided a second explicit counterexample to the Riemann hypothesis, following the zero identified earlier that day. The real and imaginary components of the new zero were thus determined respectively by two prime factors of [math]\displaystyle{ N_{2} }[/math], linking the Fermat-prime, odd-perfect-number, Collatz and Riemann-hypothesis results within the same sequence of discoveries.
The extraordinary concentration of major results on 29 January 2030 was widely regarded as unprecedented in the history of mathematics. Within a single day, several long-standing problems—including the existence of odd perfect numbers, Goldbach's conjecture, the Collatz conjecture and the Riemann hypothesis—were resolved or overturned, alongside the discovery of the first Fermat prime since the seventeenth century. The event was considered particularly remarkable because the results were not merely simultaneous: successive discoveries repeatedly supplied the mathematical objects used in later ones, with the newly identified numbers [math]\displaystyle{ N_{1} }[/math], [math]\displaystyle{ G }[/math], [math]\displaystyle{ F_{M} }[/math], [math]\displaystyle{ N_{2} }[/math] and [math]\displaystyle{ C }[/math] becoming interconnected across otherwise largely unrelated fields of number theory. The resulting sequence of announcements received extensive international media coverage and became known collectively as the Day of Mathematics, with contemporary commentary frequently comparing the experience of following the discoveries in real time to a major breaking-news event rather than the conventional publication of mathematical research.
First odd perfect number
The first odd perfect number, designated [math]\displaystyle{ N }[/math], and approximately equal to [math]\displaystyle{ 1.1274354961045\ldots \times {10}^{1,353,382} }[/math], is the first discovered odd positive integer equal to the sum of its proper positive divisors. Its decimal representation contains 1,353,383 digits and ends in …94689796301. It is strongly believed to be the smallest (and hence sequentially the first odd perfect number on the number line), although verification is ongoing.
The number was discovered on 27 January 2030 by a joint team from twelve universities in the United States, Europe and Singapore, with additional support from the Great Internet Mersenne Prime Search (GIMPS). Although GIMPS is primarily concerned with Mersenne primes, computational techniques developed for its prime searches were adapted to identify prime factors satisfying the known constraints on odd perfect numbers. The discovery was confirmed on the early morning of 29th of January and announced to the public shortly afterwards.
The discovery resolved the approximately 2,000-year-old question of whether odd perfect numbers exist. It was made using the method of characteristics, a number-theoretic search method that traces possible factorizations along characteristic lines subject to progressively stronger necessary conditions for odd perfect numbers. The method is unrelated to the method of characteristics used for partial differential equations.
If it is proven to be the smallest odd perfect number, it will be the 36th perfect number overall in increasing numerical order, lying between the 35th even perfect number, [math]\displaystyle{ 2^{1,398,268}\left(2^{1,398,269}-1\right) }[/math], and the 36th even perfect number, [math]\displaystyle{ 2^{2,976,220}\left(2^{2,976,221}-1\right) }[/math].