Mathematicians Come Up with ‘Mind-Blowing' Method for Defining Prime Numbers
For centuries, prime numbers have captured the imaginations of mathematicians, who continue to search for new patterns that help identify them and the way they're distributed among other numbers. Primes are whole numbers that are greater than 1 and are divisible by only 1 and themselves. The three smallest prime numbers are 2, 3 and 5. It's easy to find out if small numbers are prime—one simply needs to check what numbers can factor them. When mathematicians consider large numbers, however, the task of discerning which ones are prime quickly mushrooms in difficulty. Although it might be practical to check if, say, the numbers 10 or 1,000 have more than two factors, that strategy is unfavorable or even untenable for checking if gigantic numbers are prime or composite. For instance, the largest known prime number, which is 2¹³⁶²⁷⁹⁸⁴¹ − 1, is 41,024,320 digits long. At first, that number may seem mind-bogglingly large. Given that there are infinitely many positive integers of all different sizes, however, this number is minuscule compared with even larger primes.
Furthermore, mathematicians want to do more than just tediously attempt to factor numbers one by one to determine if any given integer is prime. 'We're interested in the prime numbers because there are infinitely many of them, but it's very difficult to identify any patterns in them,' says Ken Ono, a mathematician at the University of Virginia. Still, one main goal is to determine how prime numbers are distributed within larger sets of numbers.
Recently, Ono and two of his colleagues—William Craig, a mathematician at the U.S. Naval Academy, and Jan-Willem van Ittersum, a mathematician at the University of Cologne in Germany—identified a whole new approach for finding prime numbers. 'We have described infinitely many new kinds of criteria for exactly determining the set of prime numbers, all of which are very different from 'If you can't factor it, it must be prime,'' Ono says. He and his colleagues' paper, published in the Proceedings of the National Academy of Sciences USA, was runner-up for a physical science prize that recognizes scientific excellence and originality. In some sense, the finding offers an infinite number of new definitions for what it means for numbers to be prime, Ono notes.
On supporting science journalism
If you're enjoying this article, consider supporting our award-winning journalism by subscribing. By purchasing a subscription you are helping to ensure the future of impactful stories about the discoveries and ideas shaping our world today.
At the heart of the team's strategy is a notion called integer partitions. 'The theory of partitions is very old,' Ono says. It dates back to the 18th-century Swiss mathematician Leonhard Euler, and it has continued to be expanded and refined by mathematicians over time. 'Partitions, at first glance, seem to be the stuff of child's play,' Ono says. 'How many ways can you add up numbers to get other numbers?' For instance, the number 5 has seven partitions: 4 + 1, 3 + 2, 3 + 1 + 1, 2 + 2 + 1, 2 + 1 + 1 + 1 and 1 + 1 + 1 + 1 + 1.
Yet the concept turns out to be powerful as a hidden key that unlocks new ways of detecting primes. 'It is remarkable that such a classical combinatorial object—the partition function—can be used to detect primes in this novel way,' says Kathrin Bringmann, a mathematician at the University of Cologne. (Bringmann has worked with Ono and Craig before, and she's currently van Ittersum's postdoctoral adviser, but she wasn't involved with this research.) Ono notes that the idea for this approach originated in a question posed by one of his former students, Robert Schneider, who's now a mathematician at Michigan Technological University.
Ono, Craig and van Ittersum proved that prime numbers are the solutions of an infinite number of a particular type of polynomial equation in partition functions. Named Diophantine equations after third-century mathematician Diophantus of Alexandria (and studied long before him), these expressions can have integer solutions or rational ones (meaning they can be written as a fraction). In other words, the finding shows that 'integer partitions detect the primes in infinitely many natural ways,' the researchers wrote in their PNAS paper.
George Andrews, a mathematician at Pennsylvania State University, who edited the PNAS paper but wasn't involved with the research, describes the finding as 'something that's brand new' and 'not something that was anticipated,' making it difficult to predict 'where it will lead.'
The discovery goes beyond probing the distribution of prime numbers. 'We're actually nailing all the prime numbers on the nose,' Ono says. In this method, you can plug an integer that is 2 or larger into particular equations, and if they are true, then the integer is prime. One such equation is (3 n 3 − 13 n 2 + 18 n − 8) M 1 (n) + (12 n 2 − 120 n + 212) M 2 (n) − 960 M 3 (n) = 0, where M 1 (n), M 2 (n) and M 3 (n) are well-studied partition functions. 'More generally,' for a particular type of partition function, 'we prove that there are infinitely many such prime detecting equations with constant coefficients,' the researchers wrote in their PNAS paper. Put more simply, 'it's almost like our work gives you infinitely many new definitions for prime,' Ono says. 'That's kind of mind-blowing.'
The team's findings could lead to many new discoveries, Bringmann notes. 'Beyond its intrinsic mathematical interest, this work may inspire further investigations into the surprising algebraic or analytic properties hidden in combinatorial functions,' she says. In combinatorics—the mathematics of counting—combinatorial functions are used to describe the number of ways that items in sets can be chosen or arranged. 'More broadly, it shows the richness of connections in mathematics,' she adds. 'These kinds of results often stimulate fresh thinking across subfields.'
Bringmann suggests some potential ways that mathematicians could build on the research. For instance, they could explore what other types of mathematical structures could be found using partition functions or look for ways that the main result could be expanded to study different types of numbers. 'Are there generalizations of the main result to other sequences, such as composite numbers or values of arithmetic functions?' she asks.
'Ken Ono is, in my opinion, one of the most exciting mathematicians around today,' Andrews says. "This isn't the first time that he has seen into a classic problem and brought really new things to light.'
There remains a glut of open questions about prime numbers, many of which are long-standing. Two examples are the twin prime conjecture and Goldbach's conjecture. The twin prime conjecture states that there are infinitely many twin primes—prime numbers that are separated by a value of two. The numbers 5 and 7 are twin primes, as are 11 and 13. Goldbach's conjecture states that 'every even number bigger than 2 is a sum of two primes in at least one way,' Ono says. But no one has proven this conjecture to be true.
'Problems like that have befuddled mathematicians and number theorists for generations, almost throughout the entire history of number theory,' Ono says. Although his team's recent finding doesn't solve those problems, he says, it's a profound example of how mathematicians are pushing boundaries to better understand the mysterious nature of prime numbers.
Try Our AI Features
Explore what Daily8 AI can do for you:
Comments
No comments yet...
Related Articles
Yahoo
16 hours ago
- Yahoo
Mathematicians discover a completely new way to find prime numbers
When you buy through links on our articles, Future and its syndication partners may earn a commission. For centuries, prime numbers have captured the imaginations of mathematicians, who continue to search for new patterns that help identify them and the way they're distributed among other numbers. Primes are whole numbers that are greater than 1 and are divisible by only 1 and themselves. The three smallest prime numbers are 2, 3 and 5. It's easy to find out if small numbers are prime — one simply needs to check what numbers can factor them. When mathematicians consider large numbers, however, the task of discerning which ones are prime quickly mushrooms in difficulty. Although it might be practical to check if, say, the numbers 10 or 1,000 have more than two factors, that strategy is unfavorable or even untenable for checking if gigantic numbers are prime or composite. For instance, the largest known prime number, which is 2136279841 − 1, is 41,024,320 digits long. At first, that number may seem mind-bogglingly large. Given that there are infinitely many positive integers of all different sizes, however, this number is minuscule compared with even larger primes. Furthermore, mathematicians want to do more than just tediously attempt to factor numbers one by one to determine if any given integer is prime. "We're interested in the prime numbers because there are infinitely many of them, but it's very difficult to identify any patterns in them," says Ken Ono, a mathematician at the University of Virginia. Still, one main goal is to determine how prime numbers are distributed within larger sets of numbers. Recently, Ono and two of his colleagues — William Craig, a mathematician at the U.S. Naval Academy, and Jan-Willem van Ittersum, a mathematician at the University of Cologne in Germany — identified a whole new approach for finding prime numbers. "We have described infinitely many new kinds of criteria for exactly determining the set of prime numbers, all of which are very different from 'If you can't factor it, it must be prime,'" Ono says. He and his colleagues' paper, published in the Proceedings of the National Academy of Sciences USA, was runner-up for a physical science prize that recognizes scientific excellence and originality. In some sense, the finding offers an infinite number of new definitions for what it means for numbers to be prime, Ono notes. At the heart of the team's strategy is a notion called integer partitions. "The theory of partitions is very old," Ono says. It dates back to the 18th-century Swiss mathematician Leonhard Euler, and it has continued to be expanded and refined by mathematicians over time. "Partitions, at first glance, seem to be the stuff of child's play," Ono says. "How many ways can you add up numbers to get other numbers?" For instance, the number 5 has seven partitions: 4 + 1, 3 + 2, 3 + 1 + 1, 2 + 2 + 1, 2 + 1 + 1 + 1 and 1 + 1 + 1 + 1 + 1. Yet the concept turns out to be powerful as a hidden key that unlocks new ways of detecting primes. "It is remarkable that such a classical combinatorial object — the partition function — can be used to detect primes in this novel way," says Kathrin Bringmann, a mathematician at the University of Cologne. (Bringmann has worked with Ono and Craig before, and she's currently van Ittersum's postdoctoral adviser, but she wasn't involved with this research.) Ono notes that the idea for this approach originated in a question posed by one of his former students, Robert Schneider, who's now a mathematician at Michigan Technological University. Ono, Craig and van Ittersum proved that prime numbers are the solutions of an infinite number of a particular type of polynomial equation in partition functions. Named Diophantine equations after third-century mathematician Diophantus of Alexandria (and studied long before him), these expressions can have integer solutions or rational ones (meaning they can be written as a fraction). In other words, the finding shows that "integer partitions detect the primes in infinitely many natural ways," the researchers wrote in their PNAS paper. George Andrews, a mathematician at Pennsylvania State University, who edited the PNAS paper but wasn't involved with the research, describes the finding as "something that's brand new" and "not something that was anticipated," making it difficult to predict "where it will lead." Related: What is the largest known prime number? The discovery goes beyond probing the distribution of prime numbers. "We're actually nailing all the prime numbers on the nose," Ono says. In this method, you can plug an integer that is 2 or larger into particular equations, and if they are true, then the integer is prime. One such equation is (3n3 − 13n2 + 18n − 8)M1(n) + (12n2 − 120n + 212)M2(n) − 960M3(n) = 0, where M1(n), M2(n) and M3(n) are well-studied partition functions. "More generally," for a particular type of partition function, "we prove that there are infinitely many such prime detecting equations with constant coefficients," the researchers wrote in their PNAS paper. Put more simply, "it's almost like our work gives you infinitely many new definitions for prime," Ono says. "That's kind of mind-blowing." The team's findings could lead to many new discoveries, Bringmann notes. "Beyond its intrinsic mathematical interest, this work may inspire further investigations into the surprising algebraic or analytic properties hidden in combinatorial functions," she says. In combinatorics — the mathematics of counting — combinatorial functions are used to describe the number of ways that items in sets can be chosen or arranged. "More broadly, it shows the richness of connections in mathematics," she adds. "These kinds of results often stimulate fresh thinking across subfields." Bringmann suggests some potential ways that mathematicians could build on the research. For instance, they could explore what other types of mathematical structures could be found using partition functions or look for ways that the main result could be expanded to study different types of numbers. "Are there generalizations of the main result to other sequences, such as composite numbers or values of arithmetic functions?" she asks. "Ken Ono is, in my opinion, one of the most exciting mathematicians around today," Andrews says. "This isn't the first time that he has seen into a classic problem and brought really new things to light." RELATED STORIES —Largest known prime number, spanning 41 million digits, discovered by amateur mathematician using free software —'Dramatic revision of a basic chapter in algebra': Mathematicians devise new way to solve devilishly difficult equations —Mathematicians just solved a 125-year-old problem, uniting 3 theories in physics There remains a glut of open questions about prime numbers, many of which are long-standing. Two examples are the twin prime conjecture and Goldbach's conjecture. The twin prime conjecture states that there are infinitely many twin primes — prime numbers that are separated by a value of two. The numbers 5 and 7 are twin primes, as are 11 and 13. Goldbach's conjecture states that "every even number bigger than 2 is a sum of two primes in at least one way," Ono says. But no one has proven this conjecture to be true. "Problems like that have befuddled mathematicians and number theorists for generations, almost throughout the entire history of number theory," Ono says. Although his team's recent finding doesn't solve those problems, he says, it's a profound example of how mathematicians are pushing boundaries to better understand the mysterious nature of prime numbers. This article was first published at Scientific American. © All rights reserved. Follow on TikTok and Instagram, X and Facebook.
Business Wire
2 days ago
- Business Wire
Brenus Pharma and InSphero Have Developed 3D Tumor Spheroids Mimicking
LISBON, Portugal--(BUSINESS WIRE)--Brenus Pharma, a French biotech developing next-generation first-in-class immunotherapies, and InSphero, a Swiss leader in 3D cell-based assay technologies, presented promising data at the European Association for Cancer Research 2025 annual congress. These data confirm the use of 3D tumor spheroids for potency testing of STC-1010, Brenus' lead candidate for colorectal cancer. 'This collaboration has enabled us to assess the highly representative and scalable 3D model into our SGC platform. It's a major step forward in our ability to assess potency and accelerate the development of STC-1010 and future candidates.' Benoit Pinteur Share Funded through the EUROSTARS program, the collaboration led to vitrified 3D colorectal cancer spheroids using tumor cell lines co-cultured with fibroblasts. The vitrification method preserves morphology, stromal integrity, and viability after thawing, enabling realistic evaluation of STC-1010's therapeutic potential under conditions mimicking in vivo human tumors. Previous studies showed that STC-1010 antigens were effectively processed by monocyte-derived dendritic cells (mMo-DCs), activating CD8+ T cells. These T cells induced apoptosis in both 2D and 3D colorectal cancer models and released anti-tumor cytokines (IFNγ and Granzyme B). These data reinforce the therapeutic potential of STC-1010. ' This collaboration has enabled us to assess the highly representative and scalable 3D model into our SGC platform. It's a major step forward in our ability to assess potency and accelerate the development of STC-1010 and future candidates.' Benoit Pinteur, CSO of Brenus Pharma. ' We are proud to support Brenus with our cryopreserved 3D tumor models. This work illustrates how advanced in vitro systems can bring immunotherapies closer to clinical reality.' Jan Lichtenberg, CEO of InSphero. About Brenus Pharma Brenus Pharma unlocks the potential of immuno-oncology by generating first-in-class immunotherapies that initiate a multi-specific in vivo immune response against tumors. Their proprietary 'off-the-shelf' Stimulated-tumor-Ghost-Cells (SGC) platform mimics patients' tumor cells and makes them visible to the immune system to anticipate, target, and destroy these cells as they appear. Brenus aims to shift the oncology paradigm by making patients active participants in their treatment.
Yahoo
2 days ago
- Yahoo
A Mathematician Found a Hidden Pattern That Could Keep Your Biggest Secrets Safe
Here's what you'll learn when you read this story: Prime numbers are essential for technologies like RSA encryption, which rely on the difficulty of guessing these numerals. A new paper shows that another area of mathematics called integer partition unlocks 'infinitely many new ways' to detect them beyond divisibility. The team said that this breakthrough arrived by using decades-old methods to answer mathematical questions no one else thought to ask. Although prime numbers are a mathematical concept everyone learns about in elementary school, extremely large prime numbers form the backbone of some of the most complex technologies in modern society—especially in the realm of cryptography. But in the burgeoning era of quantum computers, which can solve problems exponentially faster than standard computers (including supercomputers), there's a chance that this kind of previously uncrackable protection could suddenly become very vulnerable. This has pushed mathematicians—including Ken Ono from the University of Virginia—to continue exploring the frontiers of prime numbers. In September of last year, Ono (along with co-authors William Craig and Jan-Willem van Ittersum) published a paper in the journal Proceedings of the National Academy of Sciences (PNAS) exploring how to find new prime numbers with a novel approach centered around what are called integer partitions. His groundbreaking work scored him recognition for the Cozzarelli Award for originality and creativity, but to understand it, we'll need to take a few steps back. A prime number (as you likely know) is an integer that is not divisible by any number other than 1 and itself. While there are technically infinite prime numbers, it's difficult to find new ones, as they appear in a number line with no pattern. (Currently, the largest known prime number is more than 41 million digits long.) But Ono and his co-authors discovered a connection between prime numbers and integer partitions, which divvy up numbers into all their possible smaller sums—the number four, for example, can be described as 4, as 3 + 1, as 2 + 2, as 2 + 1 + 1, and as 1 + 1 + 1 + 1. 'The prime numbers, the building blocks of multiplicative number theory, are the solutions of infinitely many special 'Diophantine equations' in well-studied partition functions,' the authors wrote. 'In other words, integer partitions detect the primes in infinitely many natural ways.' Named for the third-century mathematician Diophantus of Alexandria, these equations can be incredibly complex, but if the resulting answer turns out to be true, that means you're working with a prime number. This essentially devises a new way to investigate prime numbers that has never been explored before. 'This paper, as excited as I am about it, represents theoretical math that could've been done decades ago,' Ono said in a video interview accompanying a press statement. 'What I like about our theorem is that if there was a time machine, I could go back to 1950, explain what we done, and it would generate the same level of excitement […] and the experts at that time would understand what we did.' Ono is intimately familiar with the security implications of prime number research, as he serves on the advisory board for the National Security Agency (NSA). Technologies like RSA encryption rely on the difficulty of detecting prime numbers to safeguard the world's most sensitive information, so understanding prime numbers from every conceivable angle will be helpful when quantum computers make ferreting out these unfathomably large numbers easier. Speaking with Scientific American, many mathematicians say this work serves as the foundation of a new way of seeing what other mathematical connections can be made using partition functions. Prime numbers may be elementary, but they remain a fixture of our complex technological future. You Might Also Like The Do's and Don'ts of Using Painter's Tape The Best Portable BBQ Grills for Cooking Anywhere Can a Smart Watch Prolong Your Life?
