https://mklab.gr/ Thu, 29 Oct 2026 06:15:09 +0000 MyBB https://mklab.gr/showthread.php?tid=2371 Thu, 29 Oct 2026 01:50:48 +0200 mklabgr]]> https://mklab.gr/showthread.php?tid=2371 Proof Without Words: Sums of Odd Squares

The article presents a visual proof of an elegant mathematical identity involving the sum of the squares of the first n odd positive integers. It establishes that three times this sum equals the product of n and the two consecutive odd numbers surrounding 2n:

3(1² + 3² + 5² + … + (2n − 1)²) = n(2n − 1)(2n + 1).

Rather than relying on a lengthy algebraic derivation, the article uses a geometric illustration to make the relationship visible and intuitive. The example for n = 4 demonstrates how the squares of the first four odd numbers combine to satisfy the identity.

The article highlights the power of proof without words, a mathematical technique in which a carefully designed diagram communicates why a statement is true. Such visual proofs can reveal patterns, encourage mathematical curiosity, and help students connect algebraic formulas with geometric reasoning. They also illustrate how mathematical ideas can sometimes be explained with remarkable clarity through a single well-constructed image.

ARTICLE]]> Proof Without Words: Sums of Odd Squares

The article presents a visual proof of an elegant mathematical identity involving the sum of the squares of the first n odd positive integers. It establishes that three times this sum equals the product of n and the two consecutive odd numbers surrounding 2n:

3(1² + 3² + 5² + … + (2n − 1)²) = n(2n − 1)(2n + 1).

Rather than relying on a lengthy algebraic derivation, the article uses a geometric illustration to make the relationship visible and intuitive. The example for n = 4 demonstrates how the squares of the first four odd numbers combine to satisfy the identity.

The article highlights the power of proof without words, a mathematical technique in which a carefully designed diagram communicates why a statement is true. Such visual proofs can reveal patterns, encourage mathematical curiosity, and help students connect algebraic formulas with geometric reasoning. They also illustrate how mathematical ideas can sometimes be explained with remarkable clarity through a single well-constructed image.

ARTICLE]]> https://mklab.gr/showthread.php?tid=2370 Thu, 29 Oct 2026 01:46:46 +0200 mklabgr]]> https://mklab.gr/showthread.php?tid=2370 Dart-Shaped Visualization of a Square Number and a Companion Result

In this article, mathematician Günhan Caglayan explores a geometric way to represent a square number through a dart-shaped arrangement. The article, published in The Mathematical Intelligencer, demonstrates how visual representations can reveal mathematical relationships and make numerical patterns easier to understand. Rather than treating square numbers solely as algebraic expressions, this approach highlights the connection between arithmetic and geometry.

The central idea is to use a geometric visualization to illustrate a mathematical identity involving square numbers, accompanied by a related result. Such representations can help readers recognize patterns, understand why numerical relationships hold, and connect symbolic calculations with spatial reasoning. The approach reflects a long-standing mathematical tradition in which diagrams serve not merely as illustrations but also as tools for discovering and communicating mathematical ideas.

The article highlights the value of visual thinking in mathematics. Geometric arrangements can provide an intuitive perspective on relationships that might otherwise appear abstract, making them useful in mathematical exploration and education. By presenting a square number in an unconventional shape and considering a companion result, Caglayan invites readers to look beyond familiar formulas and discover how geometry can offer fresh insights into elementary number theory.

Source: Original article by Günhan Caglayan.]]> Dart-Shaped Visualization of a Square Number and a Companion Result

In this article, mathematician Günhan Caglayan explores a geometric way to represent a square number through a dart-shaped arrangement. The article, published in The Mathematical Intelligencer, demonstrates how visual representations can reveal mathematical relationships and make numerical patterns easier to understand. Rather than treating square numbers solely as algebraic expressions, this approach highlights the connection between arithmetic and geometry.

The central idea is to use a geometric visualization to illustrate a mathematical identity involving square numbers, accompanied by a related result. Such representations can help readers recognize patterns, understand why numerical relationships hold, and connect symbolic calculations with spatial reasoning. The approach reflects a long-standing mathematical tradition in which diagrams serve not merely as illustrations but also as tools for discovering and communicating mathematical ideas.

The article highlights the value of visual thinking in mathematics. Geometric arrangements can provide an intuitive perspective on relationships that might otherwise appear abstract, making them useful in mathematical exploration and education. By presenting a square number in an unconventional shape and considering a companion result, Caglayan invites readers to look beyond familiar formulas and discover how geometry can offer fresh insights into elementary number theory.

Source: Original article by Günhan Caglayan.]]> https://mklab.gr/showthread.php?tid=2200 Fri, 25 Sep 2026 21:34:51 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=2200 Number theory is the branch of mathematics concerned primarily with integers and their properties, relationships, and structures. It studies questions about divisibility, prime numbers, factorization, congruences, and integer solutions to equations. Although its objects are often elementary—such as the integers $1,2,3,\ldots$—number theory contains some of mathematics' deepest problems. A typical question might ask whether an integer can be represented in a particular form, whether a Diophantine equation has solutions, or how prime numbers are distributed. 

The subject has several major branches. Elementary number theory investigates divisibility, primes, factorization, modular arithmetic, Diophantine equations, continued fractions, partitions, and Diophantine approximation using relatively elementary techniques. Analytic number theory applies calculus, complex analysis, and functions such as the Riemann zeta function to understand integers and especially the distribution of primes. Algebraic number theory uses algebraic structures such as rings and fields, while related areas include geometric, probabilistic, combinatorial, and computational number theory.

Historically, number theory reaches back to ancient civilizations. Babylonian mathematics included Pythagorean triples satisfying $a^2+b^2=c^2$, while Euclid studied primes, divisibility, and the infinitude of primes. Later, Diophantus developed methods for equations involving integer or rational solutions. Fermat, Euler, Lagrange, Legendre, and Gauss transformed the subject in the seventeenth through nineteenth centuries. Gauss's Disquisitiones Arithmeticae (1801) was particularly influential, developing congruences and quadratic forms and establishing important foundations for modern number theory.

One of the striking features of number theory is the contrast between simple-looking questions and profound difficulty. Fermat's Last Theorem, for example, asks whether $x^n+y^n=z^n$ has positive-integer solutions for $n>2$ and remained unresolved for centuries before its proof. Other famous questions, such as the Goldbach conjecture, remain open. Number theory also moved from being regarded largely as pure mathematics to having major technological applications: prime numbers and modular arithmetic underpin modern public-key cryptography, including RSA. Thus, number theory connects ancient questions about whole numbers with modern mathematics, algorithms, computing, and information security. 

Key Takeaways

• Core objects: integers, primes, rational numbers, and algebraic integers.
  
• Central question: how are integers structured and related?
  
• Divisibility: $b\mid a$ means there exists an integer $q$ such that $a=bq$.
  
• Prime numbers: numbers greater than $1$ with no positive divisors other than $1$ and themselves.
  
• Congruences: $a\equiv b\pmod n$ means $n\mid(a-b)$.
  
• Diophantine equations: equations such as $x^2+y^2=z^2$ where integer or rational solutions are sought.
  
• Analytic number theory: uses analysis and complex functions to study arithmetic patterns.
  
• Algebraic number theory: extends ideas about integers using algebraic structures such as rings and fields.
  
• Major historical figures: Euclid, Diophantus, Fermat, Euler, Lagrange, Legendre, Gauss, and Riemann.
  
• Famous theorem: Fermat's Last Theorem states that $x^n+y^n=z^n$ has no positive-integer solutions for $n>2$.
  
• Famous open problem: Goldbach's conjecture proposes that every even integer greater than $2$ is the sum of two primes.
  
• Modern application: modular arithmetic and prime numbers are fundamental to public-key cryptography such as RSA.
  
• Educational value: number theory is particularly rich for problem-solving because elementary definitions can lead to surprisingly deep mathematics.
  
  

Source: Wikipedia — Number theory / PDF]]> Number theory is the branch of mathematics concerned primarily with integers and their properties, relationships, and structures. It studies questions about divisibility, prime numbers, factorization, congruences, and integer solutions to equations. Although its objects are often elementary—such as the integers $1,2,3,\ldots$—number theory contains some of mathematics' deepest problems. A typical question might ask whether an integer can be represented in a particular form, whether a Diophantine equation has solutions, or how prime numbers are distributed. 

The subject has several major branches. Elementary number theory investigates divisibility, primes, factorization, modular arithmetic, Diophantine equations, continued fractions, partitions, and Diophantine approximation using relatively elementary techniques. Analytic number theory applies calculus, complex analysis, and functions such as the Riemann zeta function to understand integers and especially the distribution of primes. Algebraic number theory uses algebraic structures such as rings and fields, while related areas include geometric, probabilistic, combinatorial, and computational number theory.

Historically, number theory reaches back to ancient civilizations. Babylonian mathematics included Pythagorean triples satisfying $a^2+b^2=c^2$, while Euclid studied primes, divisibility, and the infinitude of primes. Later, Diophantus developed methods for equations involving integer or rational solutions. Fermat, Euler, Lagrange, Legendre, and Gauss transformed the subject in the seventeenth through nineteenth centuries. Gauss's Disquisitiones Arithmeticae (1801) was particularly influential, developing congruences and quadratic forms and establishing important foundations for modern number theory.

One of the striking features of number theory is the contrast between simple-looking questions and profound difficulty. Fermat's Last Theorem, for example, asks whether $x^n+y^n=z^n$ has positive-integer solutions for $n>2$ and remained unresolved for centuries before its proof. Other famous questions, such as the Goldbach conjecture, remain open. Number theory also moved from being regarded largely as pure mathematics to having major technological applications: prime numbers and modular arithmetic underpin modern public-key cryptography, including RSA. Thus, number theory connects ancient questions about whole numbers with modern mathematics, algorithms, computing, and information security. 

Key Takeaways

• Core objects: integers, primes, rational numbers, and algebraic integers.
  
• Central question: how are integers structured and related?
  
• Divisibility: $b\mid a$ means there exists an integer $q$ such that $a=bq$.
  
• Prime numbers: numbers greater than $1$ with no positive divisors other than $1$ and themselves.
  
• Congruences: $a\equiv b\pmod n$ means $n\mid(a-b)$.
  
• Diophantine equations: equations such as $x^2+y^2=z^2$ where integer or rational solutions are sought.
  
• Analytic number theory: uses analysis and complex functions to study arithmetic patterns.
  
• Algebraic number theory: extends ideas about integers using algebraic structures such as rings and fields.
  
• Major historical figures: Euclid, Diophantus, Fermat, Euler, Lagrange, Legendre, Gauss, and Riemann.
  
• Famous theorem: Fermat's Last Theorem states that $x^n+y^n=z^n$ has no positive-integer solutions for $n>2$.
  
• Famous open problem: Goldbach's conjecture proposes that every even integer greater than $2$ is the sum of two primes.
  
• Modern application: modular arithmetic and prime numbers are fundamental to public-key cryptography such as RSA.
  
• Educational value: number theory is particularly rich for problem-solving because elementary definitions can lead to surprisingly deep mathematics.
  
  

Source: Wikipedia — Number theory / PDF]]> https://mklab.gr/showthread.php?tid=2161 Fri, 25 Sep 2026 15:21:10 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=2161 ]]> ]]> https://mklab.gr/showthread.php?tid=1967 Mon, 14 Sep 2026 23:21:05 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1967
The Gauss circle problem asks how many integer lattice points lie inside or on a circle of radius $r$ centered at the origin. If this number is denoted by $N®$, then equivalently
$N®={(m,n)\in\mathbb Z^2:m^2+n^2\le r^2}$.
Since a circle has area $\pi r^2$ and, on average, each unit square of the integer grid contains one lattice point, it is natural that
$N®\approx \pi r^2$.
The central question is therefore how large the error term
$E®=N®-\pi r^2$
can be. 

Historical progress
Gauss himself established an error of essentially linear size, $E®=O®$. Later, Hardy and Landau proved that the error cannot be as small as $O(r^{1/2})$; in particular,
$|E®|\neq o\left(r^{1/2}(\log r)^{1/4}\right)$.
The famous conjecture is that the true order is almost square-root size:
$|E®|=O_\varepsilon(r^{1/2+\varepsilon})$
for every $\varepsilon>0$. 
The best bound stated in the article is
$|E®|=O(r^{131/208})$
where
$\frac{131}{208}\approx0.6298$.
Thus there remains a significant gap between the known upper exponent $0.6298\ldots$ and the conjectured exponent $1/2$. 

Connection with sums of two squares
The problem has a beautiful connection with number theory. Let $r_2(n)$ denote the number of representations of $n$ as a sum of two squares, counting signs and order. Then
$N®=\sum_{n=0}^{r^2}r_2(n)$.
So the geometric problem of counting lattice points becomes a problem about the arithmetic structure of integers and their representations as
$n=m^2+k^2$.
There is also an exact formula involving floor functions, obtained using Jacobi's two-square theorem. 

Why the problem is difficult
The main difficulty is that the boundary of a circle does not align with the integer grid. As $r$ changes continuously, $N®$ changes only when the circle crosses a lattice point, whereas $\pi r^2$ changes smoothly. Consequently, the error $E®$ oscillates considerably.
For example, at $r=5$ there are $81$ lattice points, while
$\pi(5)^2=25\pi\approx78.54$,
giving an error of about $2.46$. Small changes in the radius can produce noticeably different errors. 

Bigger picture
The Gauss circle problem is a fundamental example of a lattice-point counting problem in analytic number theory. It connects geometry, Fourier analysis, exponential sums, Bessel functions, and the arithmetic of sums of two squares. It also has higher-dimensional analogues involving lattice points inside spheres and other shapes. 

In one sentence: The Gauss circle problem asks how closely the number of integer points inside a large circle follows its area $\pi r^2$; although we know the error is substantially smaller than $r$, proving the conjectured near-$r^{1/2}$ error remains an important open problem. 

Read the full Wikipedia article]]>
The Gauss circle problem asks how many integer lattice points lie inside or on a circle of radius $r$ centered at the origin. If this number is denoted by $N®$, then equivalently
$N®={(m,n)\in\mathbb Z^2:m^2+n^2\le r^2}$.
Since a circle has area $\pi r^2$ and, on average, each unit square of the integer grid contains one lattice point, it is natural that
$N®\approx \pi r^2$.
The central question is therefore how large the error term
$E®=N®-\pi r^2$
can be. 

Historical progress
Gauss himself established an error of essentially linear size, $E®=O®$. Later, Hardy and Landau proved that the error cannot be as small as $O(r^{1/2})$; in particular,
$|E®|\neq o\left(r^{1/2}(\log r)^{1/4}\right)$.
The famous conjecture is that the true order is almost square-root size:
$|E®|=O_\varepsilon(r^{1/2+\varepsilon})$
for every $\varepsilon>0$. 
The best bound stated in the article is
$|E®|=O(r^{131/208})$
where
$\frac{131}{208}\approx0.6298$.
Thus there remains a significant gap between the known upper exponent $0.6298\ldots$ and the conjectured exponent $1/2$. 

Connection with sums of two squares
The problem has a beautiful connection with number theory. Let $r_2(n)$ denote the number of representations of $n$ as a sum of two squares, counting signs and order. Then
$N®=\sum_{n=0}^{r^2}r_2(n)$.
So the geometric problem of counting lattice points becomes a problem about the arithmetic structure of integers and their representations as
$n=m^2+k^2$.
There is also an exact formula involving floor functions, obtained using Jacobi's two-square theorem. 

Why the problem is difficult
The main difficulty is that the boundary of a circle does not align with the integer grid. As $r$ changes continuously, $N®$ changes only when the circle crosses a lattice point, whereas $\pi r^2$ changes smoothly. Consequently, the error $E®$ oscillates considerably.
For example, at $r=5$ there are $81$ lattice points, while
$\pi(5)^2=25\pi\approx78.54$,
giving an error of about $2.46$. Small changes in the radius can produce noticeably different errors. 

Bigger picture
The Gauss circle problem is a fundamental example of a lattice-point counting problem in analytic number theory. It connects geometry, Fourier analysis, exponential sums, Bessel functions, and the arithmetic of sums of two squares. It also has higher-dimensional analogues involving lattice points inside spheres and other shapes. 

In one sentence: The Gauss circle problem asks how closely the number of integer points inside a large circle follows its area $\pi r^2$; although we know the error is substantially smaller than $r$, proving the conjectured near-$r^{1/2}$ error remains an important open problem. 

Read the full Wikipedia article]]> 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]]>