https://mklab.gr/ Sun, 13 Sep 2026 13:30:34 +0000 MyBB https://mklab.gr/showthread.php?tid=1909 Tue, 08 Sep 2026 19:14:52 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1909
Peter Smith gives an accessible introduction to the MRDP theorem—the Matiyasevich–Robinson–Davis–Putnam theorem—which provides the negative solution to Hilbert’s Tenth Problem. Hilbert asked whether there could be an algorithm which, given an arbitrary Diophantine equation $p(x_1,\ldots,x_n)=0$ with integer coefficients, decides in finitely many steps whether it has an integer solution. Smith first explains Diophantine equations and Diophantine sets: a set $K\subseteq\mathbb N$ is Diophantine when membership can be expressed as $x\in K\iff \exists y_1\cdots \exists y_k;p(x,y_1,\ldots,y_k)=0$. He then connects this apparently number-theoretic notion with computability. Every Diophantine set is recursively enumerable because possible tuples can simply be searched mechanically. The profound converse, completed by Yuri Matiyasevich following work of Martin Davis, Hilary Putnam and Julia Robinson, states that every recursively enumerable set is Diophantine. Matiyasevich supplied the crucial step by showing how exponential behaviour could itself be represented Diophantinely, using properties of Fibonacci-type sequences.

Thus, $\boxed{\text{Diophantine sets}=\text{recursively enumerable sets}}$. Since recursively enumerable sets exist whose membership is undecidable, a hypothetical algorithm deciding whether every polynomial equation has a solution would make every recursively enumerable set decidable—a contradiction. Hence the MRDP theorem implies that there is no algorithm which determines for every Diophantine equation whether it has a solution. Smith then develops the striking connection with mathematical logic: recursively enumerable sets correspond to $\Sigma_1$-definable sets, and MRDP allows such statements to be translated into assertions about polynomial equations. Consequently, statements equivalent to “this particular Diophantine equation has no solution” can be true but unprovable in Peano Arithmetic.

The theorem therefore creates a remarkable bridge between number theory, computability and mathematical logic. In particular, Gödelian incompleteness can appear in a very concrete arithmetic form: there are particular polynomial equations for which the assertion that they have no integer solutions is true but cannot be proved within a given sufficiently strong formal theory.

Key takeaways

• Hilbert’s Tenth Problem has a negative answer: there is no universal algorithm deciding whether arbitrary Diophantine equations have integer solutions.
  
• The central equivalence is $\boxed{K\text{ is Diophantine}\iff K\text{ is recursively enumerable}}$.
  
• MRDP connects Diophantine equations, computability theory and mathematical logic.
  
• Some statements of the form “this polynomial equation has no integer solution” can be true but unprovable in a sufficiently strong formal system.
  

ARTICLE [PDF]]]>
Peter Smith gives an accessible introduction to the MRDP theorem—the Matiyasevich–Robinson–Davis–Putnam theorem—which provides the negative solution to Hilbert’s Tenth Problem. Hilbert asked whether there could be an algorithm which, given an arbitrary Diophantine equation $p(x_1,\ldots,x_n)=0$ with integer coefficients, decides in finitely many steps whether it has an integer solution. Smith first explains Diophantine equations and Diophantine sets: a set $K\subseteq\mathbb N$ is Diophantine when membership can be expressed as $x\in K\iff \exists y_1\cdots \exists y_k;p(x,y_1,\ldots,y_k)=0$. He then connects this apparently number-theoretic notion with computability. Every Diophantine set is recursively enumerable because possible tuples can simply be searched mechanically. The profound converse, completed by Yuri Matiyasevich following work of Martin Davis, Hilary Putnam and Julia Robinson, states that every recursively enumerable set is Diophantine. Matiyasevich supplied the crucial step by showing how exponential behaviour could itself be represented Diophantinely, using properties of Fibonacci-type sequences.

Thus, $\boxed{\text{Diophantine sets}=\text{recursively enumerable sets}}$. Since recursively enumerable sets exist whose membership is undecidable, a hypothetical algorithm deciding whether every polynomial equation has a solution would make every recursively enumerable set decidable—a contradiction. Hence the MRDP theorem implies that there is no algorithm which determines for every Diophantine equation whether it has a solution. Smith then develops the striking connection with mathematical logic: recursively enumerable sets correspond to $\Sigma_1$-definable sets, and MRDP allows such statements to be translated into assertions about polynomial equations. Consequently, statements equivalent to “this particular Diophantine equation has no solution” can be true but unprovable in Peano Arithmetic.

The theorem therefore creates a remarkable bridge between number theory, computability and mathematical logic. In particular, Gödelian incompleteness can appear in a very concrete arithmetic form: there are particular polynomial equations for which the assertion that they have no integer solutions is true but cannot be proved within a given sufficiently strong formal theory.

Key takeaways

• Hilbert’s Tenth Problem has a negative answer: there is no universal algorithm deciding whether arbitrary Diophantine equations have integer solutions.
  
• The central equivalence is $\boxed{K\text{ is Diophantine}\iff K\text{ is recursively enumerable}}$.
  
• MRDP connects Diophantine equations, computability theory and mathematical logic.
  
• Some statements of the form “this polynomial equation has no integer solution” can be true but unprovable in a sufficiently strong formal system.
  

ARTICLE [PDF]]]> https://mklab.gr/showthread.php?tid=1795 Thu, 03 Sep 2026 02:07:16 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1795 Summary

The Strong Law of Small Numbers, introduced by mathematician Richard K. Guy, is a humorous but useful warning about mathematical patterns: there simply are not enough small integers to avoid them appearing repeatedly in seemingly unrelated situations. As Guy put it, “There aren't enough small numbers to meet the many demands made of them.” Consequently, striking coincidences involving numbers such as $1,2,3,4,\dots$ may look profound even when they are simply consequences of the limited supply of small numbers. Guy developed this idea in his influential 1988 paper The Strong Law of Small Numbers. 

Guy later proposed a Second Strong Law of Small Numbers: when two numerical patterns appear to agree, they may eventually diverge. Observing only the first few terms of a sequence can therefore lead to false conjectures. One example involves numbers of the form $2^p-1$: for the first prime values $p=2,3,5,7$, the results are prime, which might suggest that $2^p-1$ is always prime whenever $p$ is prime. But the pattern already fails at $p=11$, since $2^{11}-1=2047=23\times89$. Another famous example is Moser's circle problem, where the maximum number of regions created by joining $n$ points on a circle follows $1,2,4,8,16$ for the first five cases, tempting one to guess $2^{n-1}$; at $n=6$, however, the correct value is $31$, not $32$. 

The broader lesson is methodological: small numerical examples are excellent for discovering conjectures but weak evidence for proving them. Mathematical patterns can survive surprisingly many initial cases before breaking down, so genuine proof is essential before treating an observed pattern as a general law. 

Key takeaways

• The Strong Law of Small Numbers is a mathematical observation and joke, not a formal theorem.
  
• Small integers recur so frequently that apparently remarkable coincidences should be treated cautiously.
  
• A formula fitting the first several cases of a sequence may eventually fail.
  
• Examples suggest conjectures; proofs establish them.
  

ARTICLE]]> Summary

The Strong Law of Small Numbers, introduced by mathematician Richard K. Guy, is a humorous but useful warning about mathematical patterns: there simply are not enough small integers to avoid them appearing repeatedly in seemingly unrelated situations. As Guy put it, “There aren't enough small numbers to meet the many demands made of them.” Consequently, striking coincidences involving numbers such as $1,2,3,4,\dots$ may look profound even when they are simply consequences of the limited supply of small numbers. Guy developed this idea in his influential 1988 paper The Strong Law of Small Numbers. 

Guy later proposed a Second Strong Law of Small Numbers: when two numerical patterns appear to agree, they may eventually diverge. Observing only the first few terms of a sequence can therefore lead to false conjectures. One example involves numbers of the form $2^p-1$: for the first prime values $p=2,3,5,7$, the results are prime, which might suggest that $2^p-1$ is always prime whenever $p$ is prime. But the pattern already fails at $p=11$, since $2^{11}-1=2047=23\times89$. Another famous example is Moser's circle problem, where the maximum number of regions created by joining $n$ points on a circle follows $1,2,4,8,16$ for the first five cases, tempting one to guess $2^{n-1}$; at $n=6$, however, the correct value is $31$, not $32$. 

The broader lesson is methodological: small numerical examples are excellent for discovering conjectures but weak evidence for proving them. Mathematical patterns can survive surprisingly many initial cases before breaking down, so genuine proof is essential before treating an observed pattern as a general law. 

Key takeaways

• The Strong Law of Small Numbers is a mathematical observation and joke, not a formal theorem.
  
• Small integers recur so frequently that apparently remarkable coincidences should be treated cautiously.
  
• A formula fitting the first several cases of a sequence may eventually fail.
  
• Examples suggest conjectures; proofs establish them.
  

ARTICLE]]> https://mklab.gr/showthread.php?tid=1775 Tue, 01 Sep 2026 18:54:53 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1775 Bounded Gaps Between Primes
Author: Julia Stadlmann
Submitted: 31 August 2026
Field: Number Theory


Julia Stadlmann improves the best known unconditional bound for gaps between consecutive primes occurring infinitely often. If
$H1=lim inf⁡n→∞(pn+1−pn)$,
then the famous Twin Prime Conjecture predicts $H_1=2$. After Zhang proved in 2013 that $H_1$ is finite, successive improvements by Maynard, Tao and the Polymath8 project eventually established $H_1\le246$. Stadlmann's new result lowers this to
$\boxed{H_1\le240}$.
Thus, there are infinitely many pairs of consecutive primes whose difference is at most $240$. The number $240$ comes from the shortest known admissible $49$-tuple, whereas the previous value $246$ corresponded to an admissible $50$-tuple. 

The main innovation is not merely the six-unit improvement but the way it is obtained. Stadlmann combines the classical Bombieri–Vinogradov theorem with newer Zhang-type equidistribution estimates for moduli possessing large smooth factors. Within the GPY/Maynard–Tao sieve framework, this permits a larger region of support for the sieve functions, producing a stronger optimization problem. The proof also develops relaxed equidistribution estimates suited to these more general moduli and uses ideas from Harman's sieve. 

The resulting optimization is transformed into a large matrix/eigenvalue problem. Remarkably, the new $240$ bound is obtained using symmetric polynomials only up to degree $21$, whereas Polymath needed degree up to $27$ for the weaker $246$ bound. Direct integration in $49$ variables would be computationally impractical, so Stadlmann develops recursive formulas that reduce the required integrals to matrix multiplication. For $k=49$, the final matrices satisfy the key ratio $>1$, which proves $H_1\le240$. The author presents the result largely as a proof of concept, noting that greater computational resources and higher-degree polynomial bases could potentially push the bound below $240$. 

Key takeaways:

• The best published bound in this preprint improves from $H_1\le246$ to $H_1\le240$.
  
• It proves that infinitely many consecutive prime pairs are separated by no more than 240 integers.
  
• The important advance is the hybrid use of Bombieri–Vinogradov + newer smooth-moduli equidistribution estimates inside the Maynard–Tao sieve.
  
• The method appears to contain room for further numerical improvement; $240$ is presented as a first demonstration rather than an apparent theoretical limit. 
  

ARTICLE]]> Bounded Gaps Between Primes
Author: Julia Stadlmann
Submitted: 31 August 2026
Field: Number Theory


Julia Stadlmann improves the best known unconditional bound for gaps between consecutive primes occurring infinitely often. If
$H1=lim inf⁡n→∞(pn+1−pn)$,
then the famous Twin Prime Conjecture predicts $H_1=2$. After Zhang proved in 2013 that $H_1$ is finite, successive improvements by Maynard, Tao and the Polymath8 project eventually established $H_1\le246$. Stadlmann's new result lowers this to
$\boxed{H_1\le240}$.
Thus, there are infinitely many pairs of consecutive primes whose difference is at most $240$. The number $240$ comes from the shortest known admissible $49$-tuple, whereas the previous value $246$ corresponded to an admissible $50$-tuple. 

The main innovation is not merely the six-unit improvement but the way it is obtained. Stadlmann combines the classical Bombieri–Vinogradov theorem with newer Zhang-type equidistribution estimates for moduli possessing large smooth factors. Within the GPY/Maynard–Tao sieve framework, this permits a larger region of support for the sieve functions, producing a stronger optimization problem. The proof also develops relaxed equidistribution estimates suited to these more general moduli and uses ideas from Harman's sieve. 

The resulting optimization is transformed into a large matrix/eigenvalue problem. Remarkably, the new $240$ bound is obtained using symmetric polynomials only up to degree $21$, whereas Polymath needed degree up to $27$ for the weaker $246$ bound. Direct integration in $49$ variables would be computationally impractical, so Stadlmann develops recursive formulas that reduce the required integrals to matrix multiplication. For $k=49$, the final matrices satisfy the key ratio $>1$, which proves $H_1\le240$. The author presents the result largely as a proof of concept, noting that greater computational resources and higher-degree polynomial bases could potentially push the bound below $240$. 

Key takeaways:

• The best published bound in this preprint improves from $H_1\le246$ to $H_1\le240$.
  
• It proves that infinitely many consecutive prime pairs are separated by no more than 240 integers.
  
• The important advance is the hybrid use of Bombieri–Vinogradov + newer smooth-moduli equidistribution estimates inside the Maynard–Tao sieve.
  
• The method appears to contain room for further numerical improvement; $240$ is presented as a first demonstration rather than an apparent theoretical limit. 
  

ARTICLE]]> https://mklab.gr/showthread.php?tid=1691 Wed, 19 Aug 2026 17:53:21 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1691
A Cuban prime is a prime number obtained from particular expressions involving the difference of two cubes. The name has nothing to do with Cuba; it comes from the word cube, because the defining expressions involve third powers. The Wikipedia article describes two main families. In the first, one considers consecutive integers, $x=y+1$, and forms
$
p=\frac{x^3-y^3}{x-y}.
$

Since $\frac{x^3-y^3}{x-y}=x^2+xy+y^2$, substituting $x=y+1$ gives $p=3y^2+3y+1$. Whenever this number is prime, it is called a Cuban prime of the first kind. The sequence begins $7,19,37,61,127,271,\ldots$. Interestingly, numbers of the form $3y^2+3y+1$ are exactly the centered hexagonal numbers, giving these primes a geometric interpretation as well. 

The second family arises when the two integers differ by two, so $x=y+2$. The same quotient becomes $p=3y^2+6y+4$. Making the substitution $y=n-1$ gives the particularly simple expression $p=3n^2+1$, with $n>1$. Prime values of this polynomial form the second Cuban-prime sequence, beginning $13,109,193,433,769,1201,\ldots$. Thus Cuban primes provide an elementary example of an important theme in number theory: studying when polynomial expressions take prime values. Although the formulas are simple, determining which inputs actually produce primes becomes increasingly difficult as the numbers grow. 

The first family also produces extraordinarily large primes. Wikipedia reports that, as of July 2023, the largest known Cuban prime had 3,153,105 decimal digits, obtained using $y=3^{3304301}-1$. This statement is explicitly dated in the article, so it should not necessarily be interpreted as the current 2026 record. The subject connects elementary algebra—the factorization $x^3-y^3=(x-y)(x^2+xy+y^2)$—with prime-number theory, polynomial prime generation, and figurate numbers. 

Key Takeaways

• Definition: Cuban primes are primes generated from quotients of differences of cubes, especially when $x-y=1$ or $x-y=2$.
  
• Two principal forms: the families reduce to $3y^2+3y+1$ and $3n^2+1$.
  
• Geometric connection: Cuban primes of the first kind are prime centered hexagonal numbers.
  
• Significance: They illustrate how very simple polynomial formulas can generate primes while making the question of when they are prime a nontrivial number-theoretic problem. 
  

ARTICLE]]>
A Cuban prime is a prime number obtained from particular expressions involving the difference of two cubes. The name has nothing to do with Cuba; it comes from the word cube, because the defining expressions involve third powers. The Wikipedia article describes two main families. In the first, one considers consecutive integers, $x=y+1$, and forms
$
p=\frac{x^3-y^3}{x-y}.
$

Since $\frac{x^3-y^3}{x-y}=x^2+xy+y^2$, substituting $x=y+1$ gives $p=3y^2+3y+1$. Whenever this number is prime, it is called a Cuban prime of the first kind. The sequence begins $7,19,37,61,127,271,\ldots$. Interestingly, numbers of the form $3y^2+3y+1$ are exactly the centered hexagonal numbers, giving these primes a geometric interpretation as well. 

The second family arises when the two integers differ by two, so $x=y+2$. The same quotient becomes $p=3y^2+6y+4$. Making the substitution $y=n-1$ gives the particularly simple expression $p=3n^2+1$, with $n>1$. Prime values of this polynomial form the second Cuban-prime sequence, beginning $13,109,193,433,769,1201,\ldots$. Thus Cuban primes provide an elementary example of an important theme in number theory: studying when polynomial expressions take prime values. Although the formulas are simple, determining which inputs actually produce primes becomes increasingly difficult as the numbers grow. 

The first family also produces extraordinarily large primes. Wikipedia reports that, as of July 2023, the largest known Cuban prime had 3,153,105 decimal digits, obtained using $y=3^{3304301}-1$. This statement is explicitly dated in the article, so it should not necessarily be interpreted as the current 2026 record. The subject connects elementary algebra—the factorization $x^3-y^3=(x-y)(x^2+xy+y^2)$—with prime-number theory, polynomial prime generation, and figurate numbers. 

Key Takeaways

• Definition: Cuban primes are primes generated from quotients of differences of cubes, especially when $x-y=1$ or $x-y=2$.
  
• Two principal forms: the families reduce to $3y^2+3y+1$ and $3n^2+1$.
  
• Geometric connection: Cuban primes of the first kind are prime centered hexagonal numbers.
  
• Significance: They illustrate how very simple polynomial formulas can generate primes while making the question of when they are prime a nontrivial number-theoretic problem. 
  

ARTICLE]]> https://mklab.gr/showthread.php?tid=1543 Mon, 10 Aug 2026 14:33:51 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1543
Summary

The Codeforces article explains the Chicken McNugget Theorem, a useful result in number theory for determining which integers can be expressed as nonnegative combinations of two relatively prime positive integers $m$ and $n$. It states that the largest integer that cannot be written as $am+bn$ is $mn-m-n=(m-1)(n-1)-1$, where $a,b\ge0$, and that every larger integer can be represented in this way. It also gives the number of positive integers that cannot be represented as exactly $\frac{(m-1)(n-1)}{2}$. 

For example, using $m=2$ and $n=5$, the impossible values are $1$ and $3$, while every integer greater than $3$ can be formed. The theorem is particularly useful in competitive programming problems such as Codeforces 1526B – I Hate 1111, where recognizing this mathematical structure can replace a more complicated approach. 

ARTICLE]]>
Summary

The Codeforces article explains the Chicken McNugget Theorem, a useful result in number theory for determining which integers can be expressed as nonnegative combinations of two relatively prime positive integers $m$ and $n$. It states that the largest integer that cannot be written as $am+bn$ is $mn-m-n=(m-1)(n-1)-1$, where $a,b\ge0$, and that every larger integer can be represented in this way. It also gives the number of positive integers that cannot be represented as exactly $\frac{(m-1)(n-1)}{2}$. 

For example, using $m=2$ and $n=5$, the impossible values are $1$ and $3$, while every integer greater than $3$ can be formed. The theorem is particularly useful in competitive programming problems such as Codeforces 1526B – I Hate 1111, where recognizing this mathematical structure can replace a more complicated approach. 

ARTICLE]]> https://mklab.gr/showthread.php?tid=1529 Wed, 05 Aug 2026 04:14:30 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1529 Hyperperfect number

Summary

A hyperperfect number is a concept in number theory that generalizes the idea of a perfect number. A natural number $n$ is called $k$-hyperperfect if it satisfies the equation $n = 1 + k(\sigma(n)-n-1)$, where $\sigma(n)$ is the sum of all positive divisors of $n$. 

In this formula, $k$ is a positive integer, and when $k=1$, the definition reduces to that of a perfect number, meaning that the number equals the sum of its proper divisors. Hyperperfect numbers include all perfect numbers but also many additional examples; for instance, the first non-perfect hyperperfect numbers include $21$, $2133$, and $19521$. 

Mathematicians study these numbers to understand deeper relationships between divisors, divisor sums, and special structures in integers, although many questions about their distribution and properties remain open.

ARTICLE]]> Hyperperfect number

Summary

A hyperperfect number is a concept in number theory that generalizes the idea of a perfect number. A natural number $n$ is called $k$-hyperperfect if it satisfies the equation $n = 1 + k(\sigma(n)-n-1)$, where $\sigma(n)$ is the sum of all positive divisors of $n$. 

In this formula, $k$ is a positive integer, and when $k=1$, the definition reduces to that of a perfect number, meaning that the number equals the sum of its proper divisors. Hyperperfect numbers include all perfect numbers but also many additional examples; for instance, the first non-perfect hyperperfect numbers include $21$, $2133$, and $19521$. 

Mathematicians study these numbers to understand deeper relationships between divisors, divisor sums, and special structures in integers, although many questions about their distribution and properties remain open.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1407 Wed, 29 Jul 2026 04:16:07 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1407 An Interesting Number

Summary

This Stack Exchange discussion seeks a natural number $m$ whose four-digit square ($m^2 = ABCD$) and six-digit cube ($m^3 = EFGHIJ$) together contain all ten digits from $0$ to $9$ exactly once without repetition. By establishing size bounds ($47 \le m \le 98$), eliminating terminal digits that repeat upon exponentiation, and using modular arithmetic (noting that the sum of the digits $0$ through $9$ is $45$, meaning $m^2 + m^3$ must be divisible by $9$), the post narrows the search down to a handful of candidate numbers. Testing these candidates reveals that the unique solution is $m = 69$, whose square $69^2 = 4761$ and cube $69^3 = 328509$ combine to span every digit from $0$ to $9$.

ARTICLE]]> An Interesting Number

Summary

This Stack Exchange discussion seeks a natural number $m$ whose four-digit square ($m^2 = ABCD$) and six-digit cube ($m^3 = EFGHIJ$) together contain all ten digits from $0$ to $9$ exactly once without repetition. By establishing size bounds ($47 \le m \le 98$), eliminating terminal digits that repeat upon exponentiation, and using modular arithmetic (noting that the sum of the digits $0$ through $9$ is $45$, meaning $m^2 + m^3$ must be divisible by $9$), the post narrows the search down to a handful of candidate numbers. Testing these candidates reveals that the unique solution is $m = 69$, whose square $69^2 = 4761$ and cube $69^3 = 328509$ combine to span every digit from $0$ to $9$.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1393 Wed, 29 Jul 2026 00:16:43 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1393 Waring’s problem

Summary

Proposed by English mathematician Edward Waring in 1770, Waring's problem is a fundamental question in number theory asking whether, for every positive integer $k$, there exists a corresponding minimum integer $g(k)$ such that every natural number can be expressed as the sum of at most $g(k)$ natural numbers raised to the $k$-th power. For example, every natural number is the sum of at most 4 squares ($g(2) = 4$), 9 cubes ($g(3) = 9$), or 19 fourth powers ($g(4) = 19$). 

David Hilbert affirmatively proved the existence of such a finite limit for every power $k$ in 1909—a result known as the Hilbert–Waring theorem—and modern research continues to explore exact formulas for $g(k)$ as well as $G(k)$, which measures the maximum number of $k$-th powers required to express all sufficiently large integers.

ARTICLE]]> Waring’s problem

Summary

Proposed by English mathematician Edward Waring in 1770, Waring's problem is a fundamental question in number theory asking whether, for every positive integer $k$, there exists a corresponding minimum integer $g(k)$ such that every natural number can be expressed as the sum of at most $g(k)$ natural numbers raised to the $k$-th power. For example, every natural number is the sum of at most 4 squares ($g(2) = 4$), 9 cubes ($g(3) = 9$), or 19 fourth powers ($g(4) = 19$). 

David Hilbert affirmatively proved the existence of such a finite limit for every power $k$ in 1909—a result known as the Hilbert–Waring theorem—and modern research continues to explore exact formulas for $g(k)$ as well as $G(k)$, which measures the maximum number of $k$-th powers required to express all sufficiently large integers.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1391 Wed, 29 Jul 2026 00:10:19 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1391
Summary

Wilson's theorem is a fundamental result in number theory stating that a natural number $n > 1$ is a prime number if and only if the product of all positive integers less than $n$ is one less than a multiple of $n$—expressed in modular arithmetic as $(n-1)! \equiv -1 \pmod n$. 

First stated by Persian mathematician Ibn al-Haytham around 1000 AD and later named after John Wilson (with its first published proof by Joseph-Louis Lagrange in 1771), the theorem provides a theoretical condition for primality, though it is practically useless for testing large prime numbers due to the steep computational complexity of calculating large factorials.

ARTICLE]]>
Summary

Wilson's theorem is a fundamental result in number theory stating that a natural number $n > 1$ is a prime number if and only if the product of all positive integers less than $n$ is one less than a multiple of $n$—expressed in modular arithmetic as $(n-1)! \equiv -1 \pmod n$. 

First stated by Persian mathematician Ibn al-Haytham around 1000 AD and later named after John Wilson (with its first published proof by Joseph-Louis Lagrange in 1771), the theorem provides a theoretical condition for primality, though it is practically useless for testing large prime numbers due to the steep computational complexity of calculating large factorials.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1388 Tue, 28 Jul 2026 23:59:49 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1388 Euler's criterion

Summary

In number theory, Euler's criterion (formulated by Leonhard Euler in 1748) provides a direct method to determine whether an integer $a$ coprime to an odd prime $p$ is a quadratic residue—meaning whether the congruence $x^2 \equiv a \pmod p$ has a integer solution. The criterion states that $a^{(p-1)/2} \equiv 1 \pmod p$ if $a$ is a quadratic residue, and $a^{(p-1)/2} \equiv -1 \pmod p$ if it is a nonresidue, which can be concisely expressed using the Legendre symbol as $\left(\frac{a}{p}\right) \equiv a^{\frac{p-1}{2}} \pmod p$. 

Derived from Fermat's Little Theorem and Lagrange's Theorem on polynomial roots, this fundamental result plays a crucial role in modular arithmetic, connects to the law of quadratic reciprocity, and serves as the theoretical backbone for probabilistic primality tests such as the Solovay–Strassen test.

ARTICLE]]> Euler's criterion

Summary

In number theory, Euler's criterion (formulated by Leonhard Euler in 1748) provides a direct method to determine whether an integer $a$ coprime to an odd prime $p$ is a quadratic residue—meaning whether the congruence $x^2 \equiv a \pmod p$ has a integer solution. The criterion states that $a^{(p-1)/2} \equiv 1 \pmod p$ if $a$ is a quadratic residue, and $a^{(p-1)/2} \equiv -1 \pmod p$ if it is a nonresidue, which can be concisely expressed using the Legendre symbol as $\left(\frac{a}{p}\right) \equiv a^{\frac{p-1}{2}} \pmod p$. 

Derived from Fermat's Little Theorem and Lagrange's Theorem on polynomial roots, this fundamental result plays a crucial role in modular arithmetic, connects to the law of quadratic reciprocity, and serves as the theoretical backbone for probabilistic primality tests such as the Solovay–Strassen test.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1382 Tue, 28 Jul 2026 23:31:04 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1382 Historical Overview of Pi

Summary

This overview explains that π (pi) is one of the most fundamental mathematical constants, defined as the ratio of a circle’s circumference to its diameter. It discusses how mathematicians have sought increasingly accurate approximations of π for thousands of years, beginning with ancient civilizations and continuing through modern computer calculations. The page highlights the historical progression of π computations, from simple geometric methods to sophisticated algorithms capable of producing billions and even trillions of digits.

 It also emphasizes that π is an irrational and transcendental number, meaning its decimal expansion never ends or repeats and it cannot be expressed as the root of any polynomial with rational coefficients. Although only a relatively small number of digits are needed for nearly all practical scientific and engineering applications, calculating additional digits has become an important benchmark for testing mathematical algorithms and the power of modern computers. 

ARTICLE]]> Historical Overview of Pi

Summary

This overview explains that π (pi) is one of the most fundamental mathematical constants, defined as the ratio of a circle’s circumference to its diameter. It discusses how mathematicians have sought increasingly accurate approximations of π for thousands of years, beginning with ancient civilizations and continuing through modern computer calculations. The page highlights the historical progression of π computations, from simple geometric methods to sophisticated algorithms capable of producing billions and even trillions of digits.

 It also emphasizes that π is an irrational and transcendental number, meaning its decimal expansion never ends or repeats and it cannot be expressed as the root of any polynomial with rational coefficients. Although only a relatively small number of digits are needed for nearly all practical scientific and engineering applications, calculating additional digits has become an important benchmark for testing mathematical algorithms and the power of modern computers. 

ARTICLE]]> https://mklab.gr/showthread.php?tid=1361 Sun, 26 Jul 2026 07:52:53 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1361 Ramanujan–Nagell equation

Summary

The Ramanujan–Nagell equation is an exponential Diophantine equation given by $2^n - 7 = x^2$, which asks for integer solutions where a power of two minus seven equals a perfect square. First conjectured in 1913 by Indian mathematician Srinivasa Ramanujan and definitively proved in 1948 by Norwegian mathematician Trygve Nagell, 

The equation is famous for having only five solutions for $n$ ($n = 3, 4, 5, 7,$ and $15$). Beyond its interest in number theory—where it is equivalent to finding Mersenne numbers that are also triangular—the equation plays a crucial role in coding theory by proving the non-existence of certain perfect binary error-correcting codes.

ARTICLE]]> Ramanujan–Nagell equation

Summary

The Ramanujan–Nagell equation is an exponential Diophantine equation given by $2^n - 7 = x^2$, which asks for integer solutions where a power of two minus seven equals a perfect square. First conjectured in 1913 by Indian mathematician Srinivasa Ramanujan and definitively proved in 1948 by Norwegian mathematician Trygve Nagell, 

The equation is famous for having only five solutions for $n$ ($n = 3, 4, 5, 7,$ and $15$). Beyond its interest in number theory—where it is equivalent to finding Mersenne numbers that are also triangular—the equation plays a crucial role in coding theory by proving the non-existence of certain perfect binary error-correcting codes.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1297 Sat, 25 Jul 2026 05:33:56 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1297

Kissing number

Summary

The kissing number is a classic problem in geometry that asks for the maximum number of identical, non-overlapping spheres that can simultaneously touch a single sphere of the same size. Although the idea is easy to visualize, finding the exact kissing number becomes increasingly difficult as the number of dimensions grows. The problem originated in a famous 1694 debate between Isaac Newton and David Gregory over whether 12 or 13 spheres could touch one central sphere in three dimensions; Newton was correct, but a rigorous proof was not discovered until 1953. 

The exact kissing numbers are known only for a few dimensions, including 1 (2), 2 (6), 3 (12), 4 (24), 8 (240), and 24 (196,560), while for most higher dimensions mathematicians have established only upper and lower bounds. The kissing number problem is closely related to sphere packing, coding theory, lattice geometry, and optimisation, making it important in both pure and applied mathematics. Research continues to improve bounds and discover new methods, including semidefinite programming and modern AI-assisted techniques, highlighting the problem as one of the most fascinating and enduring challenges in discrete geometry.


ARTICLE]]>

Kissing number

Summary

The kissing number is a classic problem in geometry that asks for the maximum number of identical, non-overlapping spheres that can simultaneously touch a single sphere of the same size. Although the idea is easy to visualize, finding the exact kissing number becomes increasingly difficult as the number of dimensions grows. The problem originated in a famous 1694 debate between Isaac Newton and David Gregory over whether 12 or 13 spheres could touch one central sphere in three dimensions; Newton was correct, but a rigorous proof was not discovered until 1953. 

The exact kissing numbers are known only for a few dimensions, including 1 (2), 2 (6), 3 (12), 4 (24), 8 (240), and 24 (196,560), while for most higher dimensions mathematicians have established only upper and lower bounds. The kissing number problem is closely related to sphere packing, coding theory, lattice geometry, and optimisation, making it important in both pure and applied mathematics. Research continues to improve bounds and discover new methods, including semidefinite programming and modern AI-assisted techniques, highlighting the problem as one of the most fascinating and enduring challenges in discrete geometry.


ARTICLE]]> https://mklab.gr/showthread.php?tid=1280 Fri, 24 Jul 2026 01:43:23 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1280 Graham's number

Summary

Graham's number is one of the largest numbers ever used in a serious mathematical proof, introduced by mathematician Ronald Graham in the 1970s while studying a problem in Ramsey theory, a branch of combinatorics that explores unavoidable patterns in large structures. The number emerged from a question about how many dimensions are needed in a particular geometric coloring problem, and although the final answer was unimaginably large, Graham proved that it served as an upper bound for the solution. 

Graham’s number is far beyond ordinary large numbers such as a googol or even a googolplex; it is defined through repeated applications of Knuth’s up-arrow notation, a system designed to describe extremely fast-growing operations. Even the number of digits in Graham’s number is itself vastly larger than anything that could be physically represented in the observable universe. Despite its enormous size, the number is finite and mathematically well-defined, showing how abstract mathematics can deal with quantities that have no practical physical interpretation. Its importance lies not in the number itself, but in demonstrating the power of mathematical language to describe structures and relationships far beyond human intuition.

Key takeaways:

• Graham’s number is a famous extremely large finite number from Ramsey theory.
  
• It was used as an upper bound in a mathematical proof involving high-dimensional geometry.
  
• Its definition relies on Knuth’s up-arrow notation and repeated exponential growth operations.
  
• The number of digits in Graham’s number is unimaginably larger than physical scales in the universe.
  
• Its significance is conceptual: it highlights the ability of mathematics to handle abstract extremes.
  

Conclusion: Graham’s number is a remarkable example of how mathematics can create and study quantities that exceed human imagination while remaining precisely defined.

ARTICLE

ARTICLE (WOFLRAM)
]]> Graham's number

Summary

Graham's number is one of the largest numbers ever used in a serious mathematical proof, introduced by mathematician Ronald Graham in the 1970s while studying a problem in Ramsey theory, a branch of combinatorics that explores unavoidable patterns in large structures. The number emerged from a question about how many dimensions are needed in a particular geometric coloring problem, and although the final answer was unimaginably large, Graham proved that it served as an upper bound for the solution. 

Graham’s number is far beyond ordinary large numbers such as a googol or even a googolplex; it is defined through repeated applications of Knuth’s up-arrow notation, a system designed to describe extremely fast-growing operations. Even the number of digits in Graham’s number is itself vastly larger than anything that could be physically represented in the observable universe. Despite its enormous size, the number is finite and mathematically well-defined, showing how abstract mathematics can deal with quantities that have no practical physical interpretation. Its importance lies not in the number itself, but in demonstrating the power of mathematical language to describe structures and relationships far beyond human intuition.

Key takeaways:

• Graham’s number is a famous extremely large finite number from Ramsey theory.
  
• It was used as an upper bound in a mathematical proof involving high-dimensional geometry.
  
• Its definition relies on Knuth’s up-arrow notation and repeated exponential growth operations.
  
• The number of digits in Graham’s number is unimaginably larger than physical scales in the universe.
  
• Its significance is conceptual: it highlights the ability of mathematics to handle abstract extremes.
  

Conclusion: Graham’s number is a remarkable example of how mathematics can create and study quantities that exceed human imagination while remaining precisely defined.

ARTICLE

ARTICLE (WOFLRAM)
]]> https://mklab.gr/showthread.php?tid=1278 Fri, 24 Jul 2026 01:30:23 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1278 Extravagant number

Summary

An extravagant number (also called a wasteful number) is a concept from number theory that describes numbers whose prime factorization requires more digits to write down than the number itself in a given numerical base. In base 10, for example, numbers such as 4, 6, 8, and 9 are extravagant because their factorizations ($4 = 2²$, $6 = 2 × 3$, $8 = 2³$, $9 = 3²$) use more written symbols when prime factors and exponents are counted than the original number. 

This idea belongs to the broader study of “economical” representations of numbers, where mathematicians compare the efficiency of expressing a number directly versus describing it through its prime components. Extravagant numbers can be defined in any base, not only decimal, and there are infinitely many examples in every base.

The topic is interesting because it reveals hidden patterns in the structure of integers and shows how the way we write numbers influences mathematical properties. It connects arithmetic, prime factorization, and information efficiency, offering a different perspective on the simplicity or complexity of numbers.

 Key takeaways: extravagant numbers are numbers whose prime factorizations are “longer” than the numbers themselves; they depend on the numerical base used; and they demonstrate that even ordinary integers can have surprising structural properties. 

In conclusion, extravagant numbers provide a fascinating example of how mathematics explores not only what numbers are, but also how efficiently we represent them.

ARTICLE]]> Extravagant number

Summary

An extravagant number (also called a wasteful number) is a concept from number theory that describes numbers whose prime factorization requires more digits to write down than the number itself in a given numerical base. In base 10, for example, numbers such as 4, 6, 8, and 9 are extravagant because their factorizations ($4 = 2²$, $6 = 2 × 3$, $8 = 2³$, $9 = 3²$) use more written symbols when prime factors and exponents are counted than the original number. 

This idea belongs to the broader study of “economical” representations of numbers, where mathematicians compare the efficiency of expressing a number directly versus describing it through its prime components. Extravagant numbers can be defined in any base, not only decimal, and there are infinitely many examples in every base.

The topic is interesting because it reveals hidden patterns in the structure of integers and shows how the way we write numbers influences mathematical properties. It connects arithmetic, prime factorization, and information efficiency, offering a different perspective on the simplicity or complexity of numbers.

 Key takeaways: extravagant numbers are numbers whose prime factorizations are “longer” than the numbers themselves; they depend on the numerical base used; and they demonstrate that even ordinary integers can have surprising structural properties. 

In conclusion, extravagant numbers provide a fascinating example of how mathematics explores not only what numbers are, but also how efficiently we represent them.

ARTICLE]]>