How Amateur Mathematicians Use AI to Tackle Age-Old Math Problems

New Scientist: Explore groundbreaking science news and in-depth articles by expert journalists covering the latest advancements in science, technology, health, and the environment.

AI Tools Revolutionize Solutions for Old Math Problems

Andreser/Getty Images

Amateur mathematicians are leveraging artificial intelligence chatbots to tackle historic mathematical challenges, much to the astonishment of experts. Although the questions may not represent the pinnacle of mathematical complexity, their successful resolution suggests a significant breakthrough in AI’s capabilities in mathematics, potentially altering future methodologies, according to researchers.

The challenges addressed by AI are linked to Paul Erdős, a renowned Hungarian mathematician celebrated for posing intriguing yet complex questions throughout his prolific 60-year career. “The inquiries were often straightforward but exceedingly complex,” says Thomas Bloom from the University of Manchester, UK.

At the time of Erdős’ death in 1996, over 1,000 unsolved problems existed, spanning various mathematical disciplines, from combinatorics to number theory. Today, these challenges represent critical milestones for advancements in mathematics, Bloom explains. He maintains a website dedicated to cataloging these problems and tracking mathematicians’ progress in solving them.

Given the clarity of Erdős’ problems, mathematicians began experimenting with feeding them into AI tools like ChatGPT. Last October, Bloom noted an increase in users employing AI models to uncover pertinent references in mathematical literature to aid their solutions.

Shortly thereafter, AI tools began uncovering partial improvements in results—some were previously documented while others seemed to be novel.

“I was taken aback,” Bloom recalls. “Previously, when I tested ChatGPT, it provided mere conjectures, leading me to abandon it. However, since October, I discovered genuine papers, as ChatGPT effectively analyzed existing literature, uncovering substantial insights.”

Inspired by these advancements, Kevin Barrett, an undergraduate mathematics student at Cambridge, along with amateur mathematician Liam Price, set out to identify simpler and less-explored Erdős problems amenable to AI solutions. After discovering the number 728—a conjecture in number theory—they successfully solved it using ChatGPT-5.2 Pro.

“Upon seeing the statement, I thought, ‘Perhaps ChatGPT can solve this. Let’s give it a shot,’” Barrett remarks. “Indeed, numerous experts concur that the argument is elegant and quite sophisticated.”

After ChatGPT generated the proof, Barrett and Price employed another AI tool named Aristotle, developed by Harmonic, to validate their findings. Aristotle translates traditional proofs into the Lean mathematical programming language, which is swiftly verified for accuracy by a computer. Bloom highlights this process as vital, as it conserves researchers’ limited time when confirming their results’ validity.

As of mid-January, AI tools have completely solved six Erdős problems, but professional mathematicians later identified that five of these had existing solutions in the literature. Only problem number 205 was entirely resolved by Barrett and Price without prior solutions. Additionally, AI facilitated minor improvements and partial resolutions to seven other problems that were absent in existing literature.

This predicament has sparked debate regarding whether these AI tools unveil true innovations or simply resurrect old, overlooked solutions. Bloom notes that AI models frequently need to reconceptualize problems, discovering papers that make no mention of Erdős whatsoever. “Many papers I encountered would likely have remained undiscovered without this kind of AI documentation,” he remarks.

Another point of discussion is the potential limits of this approach. While the addressed problems aren’t the most formidable in mathematics, they could typically be resolved by first-year doctoral students; nonetheless, Bloom considers the achievement significant, noting the substantial effort required for such tasks.

Barrett further emphasizes that the problems currently being solved are relatively easier compared to more challenging Erdős problems, which contemporary AI models struggle to tackle. “Ultimately, AI will need more advanced models to address complex problems,” he forecasts. Some of these challenging issues even come with cash prizes for solutions, although Barrett believes that resolutions are unlikely in the near future, stating, “I don’t think we have a model for that yet.”

Utilizing AI to tackle Erdős’ problems offers promising potential for progress, according to Kevin Buzzard. Since most of the addressed challenges are straightforward or have received scant attention, it’s difficult to gauge whether these results signify substantial breakthroughs or if they warrant professional concern. “This is progress, but mathematicians aren’t quite ready to embrace it fully,” Buzzard observes. “It’s merely a budding advancement.”

Even with the models’ current limitations, their capability to work with moderately complex mathematics could fundamentally transform how researchers craft and analyze proofs. This advancement allows mathematicians with specialized knowledge to access insights from diverse mathematical fields.

“Few individuals possess expertise across all mathematical domains, limiting their toolkit,” Bloom explains. “Being able to obtain answers rapidly, without the hassle of consulting others or investing months in potentially irrelevant knowledge, creates numerous new connections. This is a groundbreaking shift that is likely to widen the scope of ongoing research.”

It may enable mathematicians to adopt entirely novel methodologies. Terence Tao at the University of California, Los Angeles, has been instrumental in validating AI-assisted methods for solving Erdős problems.

Given their limited schedules, mathematicians often prioritize a select few difficult problems, leaving many easier yet essential questions overlooked. If AI tools can be employed instantaneously across a multitude of problems, Tao believes it could facilitate a more empirical approach to mathematics, enabling extensive testing of various solutions.

“Currently, we neglect 99% of solvable problems due to our finite resources for expert analysis,” Tao asserts. “Therefore, we often bypass hundreds of significant issues, seeking just one or two that capture our interest. We also lack the capacity for comparative studies like, ‘Which of these two methods is superior?'”

“Such large-scale mathematics has yet to be undertaken,” he concludes. “However, AI demonstrates the feasibility of this approach.”

Topics:

  • Artificial Intelligence/
  • ChatGPT

Source: www.newscientist.com

2025 Breakthrough: Mathematicians Set to Unify Key Physical Laws

Understanding Complex Fluid Dynamics

Vladimir Veljanovski / Alamy

In 1900, mathematician David Hilbert presented a list of mathematical problems that captured both the current state and future trajectory of mathematics. Now, 125 years later, Dr. Zahel Hani and his colleagues at the University of Michigan have successfully solved one of Hilbert’s enduring puzzles, significantly unifying various physical laws in the process.

Hilbert advocated for deriving all physical laws from mathematical axioms—assertions regarded as fundamental truths by mathematicians. His sixth problem sought to derive laws governing fluid behavior from such axioms.

Until 2025, physicists characterized fluids through three distinct paradigms based on scale: the microscopic scale of individual particles, the mesoscopic world of particle clusters, and the macroscopic scope of full-fledged fluids, such as water flowing in pipes. Despite advances in linking these scales, a seamless unification remained elusive until Hani and his team devised a solution.

The researchers’ breakthrough hinged on adapting diagram-based techniques pioneered by physicist Richard Feynman for the seemingly unrelated field of quantum field theory. This endeavor culminated in a published paper reflecting a five-year research initiative.

“We received validation of our results from numerous experts in the field,” Hani asserts. The study, currently available as a preprint, will soon appear in a highly regarded mathematics journal.

The findings represent not only a monumental achievement in mathematics but also offer the potential to enhance our understanding of complex fluid dynamics in natural systems, such as the Earth’s atmosphere and oceans. Hani notes they are also exploring a quantum variant of this issue, where microscale mathematics can reveal even more complex and intriguing particle behaviors.

Topic:

Source: www.newscientist.com

2025: Mathematicians Discover Cutting-Edge Advancements in Mathematics

Things Get Weird When Numbers Get Big.

Jezper / Alamy

In 2025, the Busy Beaver Challenge Community offers an unprecedented glimpse into the cutting-edge realm of mathematics, where large numbers are poised to challenge the very foundations of logical reasoning.

This exploration centers on the next number in the “Busy Beaver” sequence, a collection of rapidly increasing values that arise from a fundamental query: How can we determine whether a computer program has the potential to run indefinitely?

To answer this, researchers draw upon the seminal work of mathematician Alan Turing, who demonstrated that any computer algorithm could be modeled using a simplified mechanism called a Turing machine. More intricate algorithms correspond to Turing machines with expanded instruction sets or a greater number of states.

Each Busy Beaver number, denoted as BB(n), denotes the longest execution time achievable for an n-state Turing machine. For instance, BB(1) equals 1 and BB(2) equals 6, indicating that doubling the complexity of the algorithm extends its runtime sixfold. This growth escalates rapidly; for example, BB(5) reaches an astounding 47,176,870.

In 2024, members of the Busy Beaver Challenge succeeded in determining the exact value of BB(5), culminating a 40-year study into every Turing machine comprising five states. Consequently, 2025 became a year dedicated to pursuing BB(6).

In July, a member known as mxdys identified the lower bound for BB(6), revealing that its value is not only significantly larger than BB(5) but also dwarfs the number of atoms in the universe.

Due to the impracticality of expressing all its digits, mathematicians utilize a notation system called tetration, which involves exponentiating numbers repetitively. For example, 2 raised to the power of 2 results in 4, which can similarly be expressed as 2 raised to the power of 4, yielding 16. BB(6) is at least as large as 2 raised to the power of 2 raised to the power of 9, forming a towering structure of repeated squares.

Discovering BB(6) transcends mere record-setting; it holds significant implications for the field of mathematics. Turing’s findings assert the existence of a Turing machine behavior that eludes prediction within a framework known as ZFC theory, which underpins contemporary mathematics.

Researchers have previously indicated that BB(643) defies ZFC theory, but the potential for this occurrence in a limited number of cases remains uncertain, positioning the Busy Beaver Challenge as a vital contributor to advancing our understanding.

As of July, there were 2,728 Turing machines with six states still awaiting analysis of their stopping behavior. By October, that number diminished to 1,618. “The community is currently very engaged,” comments computer scientist Tristan Stellin, who introduced the Busy Beaver Challenge in 2022.

Among the remaining machines lies the potential key to precisely determining BB(6). Any one of these could be a crucial unknown, possibly revealing substantial limitations of the ZFC framework and contemporary mathematics. In the coming year, math enthusiasts worldwide are poised to delve deeply into these complexities.

Source: www.newscientist.com

Mathematicians Announce Significant Impact of Google’s AI Tools on Research Advancement

AI aids mathematicians in solving diverse problems

Andresle/Getty Images

The AI tools created by Google DeepMind are proving to be remarkably effective in aiding mathematical research, and experts believe this could initiate a wave of AI-driven mathematical breakthroughs on an unprecedented scale.

In May, Google unveiled an AI system named AlphaEvolve, which may reveal new algorithms and formulas. This system generates numerous potential solutions through Google’s AI chatbot Gemini, which then feeds them into a distinct AI evaluator. This evaluator filters out nonsensical outputs that chatbots are prone to produce. During initial tests, Google researchers pitted AlphaEvolve against over 50 unresolved mathematical problems, and discovered that it accurately rediscovered the most prominent solutions established by humans in approximately three-quarters of the cases.

Recently, Terrence Tao and his team at UCLA assessed the system using 67 more rigorous and extensive mathematical research queries. They found that AlphaEvolve did more than merely revisit old solutions; in certain instances, it could generate improved resolutions suitable for integration into other AI systems, like a more resource-intensive version of Gemini or AlphaProof, the AI that secured a gold medal in this year’s International Mathematics Olympiad, to craft new mathematical proofs.

Tao noted that it’s challenging to gauge overall effectiveness, as the problems differ in their complexities. However, the system consistently operated much faster than any individual mathematician.

“Addressing these 67 problems through traditional methods would require us to design a specific optimization algorithm for each task. That would take years and we might never have initiated this project at all. This initiative offers a chance to engage in mathematics on a previously unseen scale,” Tao states.

AlphaEvolve is particularly adept at solving what are known as optimization problems. These encompass tasks like determining the optimal figures, formulas, or objects that best resolve specific challenges. For instance, calculating the maximum number of hexagons that can occupy a defined area.

While the system is capable of addressing optimization problems across various branches of mathematics, such as number theory and geometry, these still represent “only a small fraction of all the problems that mathematicians are interested in,” according to Tao. Nonetheless, the power of AlphaEvolve is such that mathematicians might attempt to reformulate non-optimization problems into solvable forms for AI. “These tools offer a fresh perspective for tackling these issues,” he adds.

A potential drawback, however, as Tao explains, is that the system sometimes tends to “cheat” by producing answers that seem correct but utilize loopholes or methods that don’t genuinely solve the problems. “It’s akin to administering a test to a group of exceptionally bright yet morally ambiguous students who will do whatever it takes to score highly,” he remarks.

Even with its flaws, AlphaEvolve’s achievements are garnering interest from a broader segment of the mathematical community that might have previously leaned towards more general AI solutions such as ChatGPT, according to team member Javier Gomez Serrano from Brown University. Although AlphaEvolve isn’t publicly accessible yet, numerous mathematicians have expressed interest in testing it.

“There’s definitely a growing curiosity and openness to employing these tools,” asserts Gomez Serrano. “Everyone is eager to discover their potential. Interest in the mathematical community has surged compared to a year or two ago.”

Tao believes that such AI systems alleviate some of the burdens of mathematical work, allowing researchers to focus on other areas. “Mathematicians are few in number globally, making it infeasible to consider every problem. However, there exists a multitude of mid-level difficulties where tools like AlphaEvolve are particularly effective,” he notes.

Jeremy Avigado, a researcher at Carnegie Mellon University in Pennsylvania, observes that machine learning methods are increasingly beneficial to mathematicians. “The next step is enhancing collaboration between computer scientists skilled in machine learning tools and mathematicians with domain-specific knowledge,” he emphasizes.

“We aspire to witness more outcomes like this in the future and identify methods to extend this approach into more abstract mathematical fields.”

Topics:

Source: www.newscientist.com

Mathematicians Uncover a ‘Reset Button’ to Reverse Rotation

Can I put the top back on?

Shutterstock

Picture a spinning top coming to a halt. Is it possible to make it spin again and return to its original position, as if no movement had occurred? Surprisingly, mathematicians affirm that there is a universal method to revert the rotation of nearly any object.

It seems that the sole method to reverse a complicated rotation sequence is to meticulously execute the exact reverse motion, one step at a time. However, Jean Pierre Eckmann from the University of Geneva, alongside Tzvi Trusty and a research team from South Korea’s Ulsan Institute of Science and Technology (UNIST), discovered a concealed reset mechanism that modifies the initial rotation by a common scaling factor and applies this process twice.

For a spinning top, if it makes three-quarters of a turn during its first spin, you can apply an eighth scaling to retrace your steps back to the start and repeat that sequence again to achieve another quarter turn. Yet, Eckmann and Trusty have shown that this principle applies to much more intricate scenarios.

“Essentially, this property extends to nearly any rotating object, including spins, qubits, gyroscopes, and robotic arms,” Trusty explains. “You merely need to scale all rotation angles by the same factor and replicate this complex pathway twice, navigating through an intricate trajectory in space before returning to the origin.”

Their mathematical proof stems from a comprehensive catalog of all potential rotations in three-dimensional space, known as SO(3), which follows specific rules. This can be visualized as an abstract mathematical space resembling a ball. Transporting an object through various rotations in physical space translates to moving from one point to another within this ball, akin to a bug tunneling through an apple.

When a piece undergoes a complicated rotation, its corresponding trajectory in SO(3) may initiate at the center of the ball and terminate at different points within, depending on the intricacies of the rotation. The objective of reversing this rotation is akin to discovering a route back to the center, yet given that there is only one center within the ball, randomly accomplishing this is improbable.

Some of the many paths that can be taken through the mathematical space SO(3). Corresponds to rotation sequences in real space.

Tzvi Trusty

Eckmann and Trusty realized that due to the structure of SO(3), halting a rotation midway is analogous to finding a path that ends on any point on the ball’s surface. Because the surface comprises numerous points, Trusty notes that this approach is significantly more straightforward than directly targeting the center. This insight led to a new proof.

Eckmann mentioned that they invested considerable time unraveling mathematical tensions that yielded no results. The breakthrough came from a 19th-century formula that merged the two successive rotations, known as Rodriguez’s formula, along with an 1889 theorem in number theory. Ultimately, the researchers concluded that a scaling factor is nearly always necessary for resetting.

For Eckmann, this latest research exemplifies the richness of mathematics, even in seemingly familiar domains like rotation studies. Trusty pointed out potential practical outcomes, such as in nuclear magnetic resonance (NMR), which underpins magnetic resonance imaging (MRI). Researchers assess material and tissue properties by examining the behavior of internal quantum spins under the influence of external magnetic fields. The new proof could pave the way for strategies to negate unwanted spin rotations that disrupt the imaging process.

The findings could also spur advancements in robotics, says Josie Hughes at the Federal Institute of Technology in Lausanne, Switzerland. For instance, a rolling robot may be developed to navigate a path comprising repetitive segments, featuring a reliable roll-reset-roll motion that could theoretically continue indefinitely. “Visualize a robot that could transition between any solid form and subsequently follow any desired trajectory through shape transformation,” she envisions.

Topic:

Source: www.newscientist.com

Which Mathematicians Have Developed the Best Strategies for Guessing?

Should players identify a character from a set of 24 through guessing?

Shutterstock/Jayanthi Photo

You can enhance your odds of winning a board game. By employing a strategy crafted by mathematicians, you may encounter some challenging logical puzzles.

Originally launched in 1979, Zenkon allows players to secretly choose characters from a collection of 24 distinct figures. Players then take turns questioning each other to deduce a yes or no or make a guess about the hidden character.

Numerous individuals engage in a variant of the game, successfully narrowing down their opponent’s character to a single option to win. Mathematicians have explored the optimal approach for this variant, which involves posing two-part questions.

However, official game guidelines stipulate that victory can only be achieved by directly guessing the secret character, rather than merely eliminating incorrect options from the board.

David Stewart from The University of Manchester, UK, and his team devised techniques for winning within the parameters of official rules. They discovered that, in most situations, both players must utilize two-part questions to divide potential suspects into equal or unequal groups based on the remaining suspects. This approach results in the first player winning about 65% of the time. Nevertheless, certain scenarios exist where the number of remaining characters necessitates alternative strategies.

“Mathematics often presents peculiarities. What appears to be a straightforward setup, stripped of all visuals, turns into a mere collection of n objects; you’re striving for efficiency. It’s fascinating to uncover these exceptional cases.

To unearth the best strategy, he and his colleagues began with the most basic scenario, such as having two characters left for each player, calculating optimal strategies for each case, and progressively tackling more intricate scenarios through a method known as mathematical induction. They also created Online Games, a platform for applying the strategies outlined in their research.

The research team identified that when four, six, or ten characters remain on the board and only four players are left, specific rules must be followed—like asking questions that split the four possibilities into one and three. While this is a riskier approach, the potential rewards are significant in these situations.

“It’s intriguing that this isn’t always applicable to games where outcomes seem purely random,” remarked Daniel Jones at the University of Birmingham, UK.

Stewart and his collaborators also uncovered an even quicker method to win the game: “Is your character blonde? If the answer is no, and the character has brown hair, the opponent cannot respond with ‘yes’ or ‘no.’ This creates a contradiction, as the question’s response contradicts itself. By posing this type of question, players gain more insights than with standard two-part inquiries, though it bends the rule that all questions must yield a YES or NO answer.

This method may prove effective for professional mathematicians and computer scientists, yet tends to challenge amateurs. Brian Laverne, a software engineer who developed this clever tactic, notes, “It requires some effort and practice. While you can conceptualize each step, keeping everything organized in your mind simultaneously is the real challenge, even though each step is quite simple.”

topic:

Source: www.newscientist.com

Mathematicians Pursue Numbers That Might Uncover the Boundaries of Mathematics

What’s lurking at the edge?

Kertlis/Getty Images

Amateur mathematicians find themselves ensnared in a vast numerical puzzle.

This conundrum stems from a deceptively simple query: How can one determine if a computer program will execute indefinitely? The roots of this question trace back to mathematician Alan Turing, who in the 1930s demonstrated that computer algorithms could be represented through a hypothetical “Turing machine” that interprets and records 0s and 1s on infinitely long tapes, utilizing more intricate algorithms that necessitate additional states and adhering to a specific set of instructions.

<p>For numerous states, like 5 or 100, the corresponding Turing machines are finite; however, it remains uncertain how long these machines will operate. The longest conceivable run time for each state count is termed the busy beaver number or BB(n), and this sequence grows exceedingly rapidly. For instance, BB(1) equals 1, while BB(2) is 6, and the fifth busy beaver number reaches 47,176,870.</p>
<p>The exact value of the next busy beaver number, the sixth, has not yet been determined, but the online community known as the Busy Beaver Challenge is <a href="https://bbchallenge.org/story">on the verge of discovery</a>. They succeeded in uncovering BB(5) in 2024, concluding a 40-year search, currently attributed to a participant called "MXDYS." <a href="https://bbchallenge.org/1RB1RA_1RC---_1LD0RF_1RA0LE_0LD1RC_1RA0RE">It must be at least as vast as a significantly large value, making even its explanation a challenge.</a></p>
<p>"This number surpasses the realm of physical comprehension. It's simply not intriguing," states <a href="https://www.sligocki.com/about/">Shawn Ligokki</a>, a software engineer and contributor to the Busy Beaver Challenge, who likens the search for Turing machines to fishing in uncharted mathematical oceans filled with strange and elusive entities lurking in the darkness.</p>
<section>

</section>
<p>The threshold for BB(6) is so immense that it necessitates a mathematical framework that goes beyond exponents, demanding the raising of one number to another x power, or n<sup>x</sup>2 days etc. For instance, 2*2*2 equals 8. The concept of a tetrol sometimes represented as <sup>x</sup>n <sup>3</sup>2 is raised to the second power and subsequently elevated to the second power again, resulting in a value of 16.</p>
<p>Surprisingly, MXDYS posits that BB(6) is at least two tetroized. The number 2 is illuminated by multiplying two tetroized, resulting in nine. In comparison, the estimated quantity of all particles in the universe seems diminutive, according to Ligokki.</p>

<p>However, the significance of the busy beaver numbers extends beyond their sheer size. Turing established that certain Turing machines must exist that cannot reliably predict behavior under the ZFC theory. This notion was influenced by the mathematician Kurt Gödel's "Incompleteness Theorem," which concluded that using the ZFC rules, it is impossible to affirm that the theory is entirely devoid of contradictions.</p>
<p>"The exploration of busy beaver numbers provides a concrete, quantitative representation of a phenomenon identified by Gödel and Turing almost a century ago," remarks <a href="https://www.cs.utexas.edu/people/faculty-researchers/scott-aaronson">Scott Aaronson</a> from the University of Texas at Austin. "I’m not merely suggesting that a Turing machine could displace ZFC capabilities and ascertain its behavior after a finite stage; rather, is this already occurring with machines possessing six states, or is it restricted to machines with 600 states?" Research has confirmed that BB(643) does eliminate ZFC theory, though numerous examples remain to be investigated.</p>
<p>"The busy beaver problem offers a comprehensive scale to navigate the forefront of mathematical understanding," states Tristan Stérin, a computer scientist who initiated the Busy Beaver Challenge in 2022.</p>
<p>In 2020, <a href="https://scottaaronson.blog/?p=4916">Aaronson wrote</a> that the busy beaver feature "encapsulates most intriguing mathematical truths within its first 100 values," and BB(6) is no exception. It seems to relate to Korizat's hypothesis, an esteemed unsolved mathematical problem that conducts simple arithmetic operations with numbers to determine if they resolve to 1. The discovery of a machine that halts might imply that the particular version of the hypothesis possesses a computational proof.</p>

<p>The numerical challenges that researchers encounter are astonishing in scale, yet the busy beaver framework serves as a tangible measurement tool that otherwise becomes a nebulous expanse of mathematics. In Stérin’s perspective, this aspect continues to captivate many contributors. He estimates that numerous individuals are presently dedicated to the discovery of BB(6).</p>
<p>Thousands of "hold-out" Turing machines remain unexamined for halting behavior, he notes. "There might exist a machine unbeknownst to you lurking just around the corner," Ligokki asserts. In essence, it exists independently of ZFC and lies beyond the boundaries of contemporary mathematics.</p>
<p>Is the precise value of BB(6) also lurking nearby? Ligokki and Stérin acknowledge their reluctance to forecast the future of busy beavers, yet recent achievements in defining boundaries give Ligokki a sense of "intuition that it’s approaching closer."</p>

<section class="ArticleTopics" data-component-name="article-topics">
    <p class="ArticleTopics__Heading">Topic:</p>
</section>

Source: www.newscientist.com

Mathematicians Consistently Produce Tetrahedrons That Settle on the Same Side

SEI 257070964

Self-correcting tetrahedron

Gergő Almádi et al.

Even decades after its initial proposition, a peculiar four-sided shape has been captured in mathematical intrigue, consistently resting on its desired side no matter how it lands.

The concept of self-righting shapes, particularly those with preferred resting positions on flat surfaces, has intrigued mathematicians for years. A notable example is the Gömböc—a curved object resembling a turtle shell, known for its unique weight distribution that allows it to rock back and forth until it finds its stable resting position.

In 1966, mathematician John Conway investigated the balance of geometric shapes. He established that four-sided shapes, or tetrahedrons, cannot achieve equilibrium through mass distribution. However, he speculated the existence of unevenly balanced tetrahedrons, though he did not provide concrete evidence.

Recently, Gábor Domokos from the Budapest Institute of Technology, along with his team, created a unique tetrahedral structure using carbon fiber struts and ultra-dense carbide plates. Its name, Viren, derives from Hungarian terminology.

Their journey began when Domokos tasked a student, Gerg Almádi, with using a high-powered computer to conduct a comprehensive search for Conway’s tetrahedron. “The goal was to examine all potential tetrahedrons. If we got lucky—or if computation power favored us—we might find something,” Domokos reflects.

True to Conway’s predictions, they didn’t locate a perfectly balanced tetrahedron but did identify several uneven candidates and confirmed their existence through mathematical proofs.

Determined to create a physical manifestation, Domokos found this task “significantly more complex.” Their calculations indicated that the density difference between the weighted and unweighted areas of the structure needed to be approximately 5000 times, essentially necessitating a material that’s predominantly air yet retains rigidity.

To fabricate their design, Domokos and his team collaborated with an engineering firm, investing thousands of euros to engineer carbon fiber struts with precision within a tenth of a millimeter and crafting a tungsten base plate with a variance of just a tenth of a gram.

When Domokos first witnessed a functioning prototype, he felt an overwhelming elation, remarking, “It was like rising a meter off the ground. The achievement was immensely satisfying, knowing it would bring joy to John Conway.”

“There was no blueprint, no prior example—essentially nothing suggesting to Conway that this form could exist,” Domokos adds. “This discovery was only possible with advanced computational power and considerable financial investment.”

The tetrahedron they’ve constructed follows a specific transition sequence between its sides, explaining that moving from B to A, C to A to C, and then to A can infer the necessary material distribution is indeed feasible.

Domokos envisions that their findings could inspire engineers to rethink the geometry of lunar landers, minimizing the risk of toppling, as has happened with some recent missions. “If we can achieve stability with four faces, similar principles could potentially apply to shapes with varying numbers of faces.”

Topic:

Source: www.newscientist.com

Mathematicians are adventurers, says 2024 Abel Prize laureate Michel Taragran

Michel Taragrand named 2024 Abel Prize laureate

Peter Bagde/Typos1/Abel Prize 2024

French mathematician Michel Taragrand has won the 2024 Abel Prize for his work on probability theory and the description of randomness. As soon as he heard the news, new scientist We spoke to Tara Grand to learn more about his mathematical journey.

Alex Wilkins: What does it mean to win an Abel Prize?

Michel Taragran: I think everyone agrees that the Abel Prize is considered the equivalent of the Nobel Prize in mathematics. So this was completely unexpected for me and I never dreamed that I would win this award. And in fact, it is not so easy to do, since there is already a list of people who have received it. And in that list they are true giants of mathematics. And let me tell you, I don’t feel that comfortable sitting with them because it’s clear that their accomplishments are on a completely different scale than mine.

What are your qualities as a mathematician?

I can’t learn mathematics easily. I have to work. It took a lot of time and I have bad memories. I forget things. So I try to work despite my handicap, but my way of working has always been to try to understand simple things really well. Really, really, in detail. And it turned out to be a successful approach.

Why are you attracted to mathematics?

Once you learn mathematics and begin to understand how it works, it is completely fascinating and extremely fascinating. There are all kinds of levels and you are the explorer. First you have to understand what people before you understood, which is quite difficult, and then you start exploring on your own and soon you like it. Of course, it’s also very frustrating. Therefore, you must have the personality to accept frustration.

But my solution is that when I get frustrated with something, I put it aside, and when it’s clear that I’m not going to make any more progress, I put it aside and do something else, and come back to it later. . I used that strategy very efficiently. And the reason it’s successful is the way the human brain functions, things mature when you don’t look at them. The problem I’ve been dealing with for literally 30 years is back again. And in fact, even after 30 years, I was still making progress. That’s what’s amazing.

How did you get started?

Now, that’s a very personal story. First, it helped that his father was a math teacher, and of course that helped. But in reality, the deciding factor is that I was unlucky to be born with a retinal defect. Then, when I was 5 years old, I lost my right eye. When I was 15 years old, I suffered from multiple retinal detachments and was hospitalized for an extended period of time, taking 6 months off from school. It was very traumatic and I lived in constant fear of having another retinal detachment.

I started studying to escape from that. And his father really helped me very much when he knew how difficult it was. When I was in the hospital, my father visited me every day and started talking about simple math to keep my brain functioning. The reason I started studying difficult mathematics and physics was precisely to combat fear. Of course, once you start studying, you’ll get better at it, and once you’re good at it, it’s very attractive.

What is it like to be a professional mathematician?

There’s no one telling me what to do, so I have complete freedom to do whatever I want with my time. Of course, it suited my personality and I was able to fully devote myself to my work.

topic:

Source: www.newscientist.com

Mathematicians conclusively demonstrate Bach’s greatness as a composer

According to information theory, Johann Sebastian Bach was a great composer

Granger Collection / Alamy Stock Photo

Johann Sebastian Bach is considered one of the great composers of Western classical music. Researchers are currently trying to find out why by analyzing his music using information theory.

Suman Kulkarni Researchers at the University of Pennsylvania wanted to understand how the ability to recall and predict music is related to its structure. They decided to analyze Bach's works because he produced a huge number of works with a variety of structures, including religious hymns called chorales and the fast-paced masterpiece Toccata.

First, the researchers transformed each configuration into an information network by representing each note as a node and each transition between notes as an edge and connecting them. Using this network, we compared the amount of information in each work. Intended to entertain and surprise, toccatas contain more information than chorales, which are composed for more contemplative settings such as churches.

Kulkarni and her colleagues also used information networks to compare listeners' perceptions of Bach's music. They started with an existing computer model based on an experiment in which participants responded to a series of images on a screen. The researchers then measured how surprising the elements of the array were. They adapted an information network based on this model to music, where the links between each node are used to determine how likely a listener thinks two connected notes are to be played in succession, or how likely they actually are. It expresses how surprised you would be if that happened to you. Because humans don't learn information perfectly, a network that shows people's estimated sonic changes to a song is unlikely to accurately match a network based directly on that song. Researchers can quantify that discrepancy.

In this case, the discrepancy is low, suggesting that Bach's works convey information fairly effectively. But Kulkarni wants to fine-tune computer models of human perception to better match actual brain scans of people listening to music.

“More than just knowing frequencies, neuroscience has the missing link between complex structures like music and the brain's response to them. [of sounds]. This study could provide an exciting step forward.” randy mackintosh At Simon Fraser University, Canada. However, there are many other factors that influence how a person perceives music. For example, how long the person listens to songs, whether they have musical training, etc. These still need to be explained, he says.

Even in information theory, it is still not clear whether Bach's compositional style was exceptional compared to other types of music. McIntosh said his own previous research has found some general similarities between the musicians, similar to the differences between Bach and rock guitarist Eddie Van Halen, but more detailed analysis is needed. It states that.

“I would like to perform the same analysis for different composers and non-Western music,” Kulkarni says.

topic:

Source: www.newscientist.com