Thursday, 4 September 2025

Brachistochrone

 From Google's Gemini (with selected images of my own added):

The Brachistochrone Curve: A Foundational Problem in the Calculus of Variations

1. The Problem of the Shortest Time: An Introduction to the Brachistochrone

The brachistochrone problem, derived from the Ancient Greek words brákhistos ('shortest') and khrónos ('time'), is a classic challenge in physics and mathematics that seeks to find the curve of fastest descent. Posed as a question of pure mechanics, it asks for the shape of a smooth curve connecting two points, A and B, where B is at a lower elevation than A but not directly beneath it, along which a particle will slide from A to B under the influence of uniform gravity in the minimum possible time. The problem assumes a frictionless path and a particle starting from rest.

At first consideration, the solution to this problem might seem obvious: the straight line connecting the two points. This intuition is based on the fundamental geometric principle that a straight line represents the shortest distance between any two points. However, this conclusion is surprisingly incorrect and highlights the central tension of the brachistochrone problem. While the straight line minimizes distance, the problem is concerned with minimizing time, a quantity that is a function not only of distance but also of velocity. In a gravitational field, a particle's velocity increases as it falls. Therefore, a path that is initially steeper, though longer, allows the particle to accelerate to a higher speed more quickly, and this acquired velocity enables it to traverse the rest of the curve in less time, ultimately making up for the extra distance traveled. This delicate balance between path length and gravitational acceleration reveals that the optimal solution is not a matter of simple geometry but of dynamical optimization.

The brachistochrone problem is a compelling example of a physical challenge that necessitates a shift in perspective. It forces one to move beyond the intuitive geometric notion of a shortest path and consider a more nuanced, dynamic trade-off. This intellectual re-evaluation is precisely what made the problem so significant, as it could not be solved with the mathematical tools of the time and, therefore, catalyzed the development of an entirely new field of analysis. The final report will explore this historical context, the elegant mathematical solutions, the curve's remarkable properties, and its enduring legacy in both pure science and applied engineering.

2. A Challenge to the Giants: The Historical Context

The brachistochrone problem holds a unique place in the history of science as a pivotal intellectual challenge that spurred the creation of a new mathematical discipline. The problem was first proposed by the Swiss mathematician Johann Bernoulli, who published it in the leading German-language scientific journal of the era, Acta Eruditorum, in June 1696. Bernoulli addressed the challenge "to the readers," offering a prize for its solution and allowing a period of six months for submissions. The challenge was a direct appeal to the greatest minds in Europe, intended to test the limits of their analytical capabilities.


The call to action was answered by five of the most brilliant mathematicians of the time: Johann Bernoulli himself, his brother Jakob Bernoulli, Gottfried Leibniz, the Marquis de L'Hôpital, and Isaac Newton. Their collective success in solving this seemingly simple puzzle laid the foundation for the calculus of variations, a field of mathematics dedicated to finding functions that minimize or maximize integrals. This was a new type of optimization problem, as it required finding an entire function—the curve itself—rather than just a single variable.

Isaac Newton
1643 - 1727

A now-legendary anecdote surrounds Isaac Newton's solution. He reportedly received the challenge on the afternoon of January 29, 1697, and solved it in a single night, submitting his solution anonymously to Bernoulli. Upon receiving the correct answer, Johann Bernoulli, a rival of Newton, famously declared that he recognized the identity of the solver "as the lion by its claw" (tanquam ex ungue leonem), acknowledging Newton's singular genius. The story is particularly striking when one considers that Newton's seemingly effortless solution was accomplished in a matter of hours, while it took Johann Bernoulli himself two weeks to complete his own derivation. The problem was more than just a puzzle; it was a public contest that exemplified the intellectual rivalries and brilliance of the scientific revolution, directly leading to the formalization of a mathematical framework that would later become a cornerstone of theoretical physics.

3. The Mathematical Formula: Derivations of the Brachistochrone Curve

The solution to the brachistochrone problem is a segment of an inverted cycloid, a curve that can be geometrically traced by a point on the circumference of a circle as it rolls along a straight line. The formula for this curve can be derived through two distinct and equally profound methods: the rigorous application of the calculus of variations and an elegant physical analogy. The fact that two completely different intellectual approaches converge on the same solution underscores the cycloid's fundamental nature.

3.1 The Formal Approach: Calculus of Variations

The most common modern method for solving the brachistochrone problem utilizes the calculus of variations. The objective is to find the function \(y(x) \) that minimizes the total time \(T\) taken for a particle to travel from point A to B. The total time is given by the integral of the infinitesimal time element \(dt \) along the curve.

Using the law of conservation of energy, the velocity \(v\) of a particle falling from rest from a height of \(y\) is given by \(v=\sqrt{2gy} \)​, where \(g\) is the acceleration due to gravity. The infinitesimal distance element, or arc length, \(ds\) along the curve is related to the coordinate changes by the Pythagorean theorem, \(ds=\sqrt{dx^2+dy^2}\)​.

The time functional, \(T(y)\), can then be expressed as the integral of the arc length element divided by the velocity:$$T(y)=\int_A^B ​dt = \int_A^B​ \frac{ds}{v}$$​Substituting the expressions for \(ds\) and \(v\) into the integral, we obtain the functional that needs to be minimized:$$ \begin{align} T(y) &= \int_{x_A}^​{x_B​​} \frac{ \sqrt{dx^2+dy^2​​}}{\sqrt{2gy}} \\ &=\int_{x_A}^{​x_B​​} \frac{ \sqrt{1+(dy/dx)^2}} {\sqrt{2gy}} ​​dx \end{align}$$Letting \(y^′=dy/dx\), the integrand \(F\) is a function of \(y\) and \(y ^′ \):​$$ F(y, y') = \frac{ \sqrt{1+(y^{′})^2​}}{\sqrt{2gy}} $$The function that minimizes this integral must satisfy the Euler-Lagrange equation, a fundamental condition in the calculus of variations:$$ \frac{d}{dx}​ \Big (\frac{∂F}{∂y ^′​} \Big)−\frac{∂F}{∂y​}=0$$Applying this equation to the integrand \(F\) and solving the resulting differential equation yields a constant of integration, which can be rearranged to give a differential relationship:$$ \frac{dy}{dy}​=\sqrt{\frac{2r−y​}{y}}$$​where \(r\) is a constant determined by the boundary conditions. This differential equation is solved using a parametric substitution, typically \(y=r(1−\cos \theta) \), which leads directly to the parametric equations of the cycloid:$$ \begin{align} x(\theta)=r(\theta−\sin\theta) \\ y(\theta)=r(1−\cos\theta) \end{align} $$The constant \(r\) is the radius of the generating circle, and the parameter \( \theta \) is the rolling angle of this circle.

3.2 The Elegant Analogy: Fermat's Principle and Snell's Law

Johann Bernoulli's original solution, which predated the widespread use of the Euler-Lagrange equation, was based on an ingenious analogy to optics. He recognized that the problem of a falling particle seeking a path of shortest time is analogous to a ray of light traveling between two points through a medium with a continuously varying refractive index. This approach is rooted in Fermat's Principle of Least Time, which states that a light ray traveling between two points will always follow the path that takes the minimum time to traverse.




Bernoulli's insight was to model the effect of gravity as a change in the medium's properties. Just as a falling particle's speed increases with its vertical descent, a light ray's velocity increases in a medium with a decreasing refractive index. By considering the path as a sequence of infinitesimally thin, horizontal layers, each with a slightly different speed, he could apply Snell's Law of Refraction to each boundary. Snell's Law states that for a light ray passing from one medium to another, the ratio of the sine of the angle of incidence to the velocity is constant across the boundary. This can be expressed as:$$ \frac{ \sin\theta}{v}​=\text{constant}$$where \theta is the angle of the path with the vertical and \(v\) is the velocity. Since the particle's velocity is given by \(v=\sqrt{2gy} \)​, Bernoulli concluded that the ratio:$$ \frac{\sin \theta​}{ \sqrt{2gy}}$$ must be constant along the path. This differential relation is a defining property of the cycloid, which Bernoulli immediately recognized. This remarkable demonstration, which connects the principles of mechanics and optics through a shared optimization principle, is a stunning example of interdisciplinary reasoning. The existence of these two separate, yet equally valid, solution paths highlights a profound duality: problems can be solved either through the formal, systematic development of a new mathematical tool or through a flash of creative, analogical insight that connects seemingly disparate physical phenomena.

4. The Cycloid and its Special Properties

The solution to the brachistochrone problem is the cycloid, a curve whose simple geometric definition belies its remarkable physical properties. A cycloid is simply the curve traced by a point on the circumference of a circular wheel as it rolls along a flat surface without slipping. Beyond being the path of quickest descent, the inverted cycloid possesses another astonishing characteristic known as the tautochrone property.

4.1 The Tautochrone Property (Isochronism)

The term tautochrone comes from the Greek tauto ('same') and chronos ('time'). It refers to the property of a curve where a particle, regardless of its starting point on the path, will take the same amount of time to reach the bottom. In 1659, Christiaan Huygens discovered that the inverted cycloid is a tautochronous curve, and he used this property to design the first pendulum clock that was truly isochronous, meaning its period of oscillation was independent of its amplitude.

While the brachistochrone and tautochrone problems are distinct—the former seeks the shortest time between two arbitrary points, while the latter seeks a constant time to a single lowest point for any starting position—their solution is the same inverted cycloid. This duality demonstrates a deeper, underlying physical constant. The solution is independent of the mass of the particle and the magnitude of the gravitational field, with the final shape being determined only by the starting and ending coordinates. This suggests that the "time-optimizing" and "constant-time" properties are intrinsically linked to the geometry of the curve itself. The physical properties are a direct consequence of the shape's mathematical definition, where the instantaneous rate of change of the rolling angle of the generating circle is constant with respect to time, a key element in proving the tautochrone property.
To illustrate the brachistochrone's superiority, a comparison of descent times for different curves reveals its optimal nature.

Curve TypeTheoretical Descent Time (Normalized)
Straight Line1.189s
Quadratic Curve1.046s
Cubic Curve1.019s
Ellipse1.007s
Inverted Cycloid1.003s

Table 1: Comparative Descent Times of Different Curves for a 2m Height and πm Width.

This table provides quantitative evidence of the cycloid's efficiency, showing that the intuitive straight-line path is, in fact, the slowest among the common curves tested.

5. Legacy and Modern Applications

The lasting impact of the brachistochrone problem extends far beyond its specific solution. Its primary legacy lies in the development of the mathematical methods required to solve it, particularly the calculus of variations, which has become a foundational tool in modern science and engineering.

5.1 Engineering and Design

The principle of the brachistochrone has direct applications in fields that require the optimization of path trajectories. A prominent example is the design of roller coasters. Engineers designing roller coasters can apply the principles of the brachistochrone to achieve the most rapid acceleration possible in the initial drop. This design element, which creates the sensation of high speed and G-forces, is a direct application of the path of quickest descent. While real-world applications must account for friction and other constraints, the brachistochrone provides a theoretical ideal for optimal path design.

5.2 Foundational Impact on Physics and Mathematics

The true genius of the brachistochrone problem lies in its catalytic effect on the field of mathematics. The need to find a function that minimized a functional—an integral dependent on an entire function, rather than a single variable—forced the creation of a new mathematical framework. The resulting discipline, the calculus of variations, is now a cornerstone of theoretical physics.

The Euler-Lagrange equation, first applied to the brachistochrone, is the central equation of Lagrangian and Hamiltonian mechanics, which provide a powerful and elegant way to derive the equations of motion for complex physical systems. These frameworks are fundamental to classical mechanics, quantum mechanics, and quantum field theory. The brachistochrone problem, therefore, provided the key that unlocked a new way of describing the physical universe, shifting the focus from forces and accelerations to energy and action.

Furthermore, the concept of a path of minimum time in a gravitational field has a conceptual parallel in the field of general relativity. In this theory, the paths that freely falling objects follow through curved spacetime are called geodesics. A geodesic is the "straightest possible path" in a curved manifold, representing the path of minimum proper time. While a brachistochrone is a constrained path—the bead is forced to follow a specific track—the analogy between finding the shortest-time path under a gravitational force and finding a geodesic in curved spacetime highlights the deep connections between classical and modern physics, all stemming from a simple question posed centuries ago.

6. Conclusion: A Timeless Problem

The brachistochrone problem is a powerful historical and theoretical artifact. Its initial formulation by Johann Bernoulli posed a simple, yet profoundly difficult, question that could not be answered by the existing mathematics of the time. The subsequent solutions provided by the intellectual titans of the 17th century, particularly the new methods developed by Isaac Newton and the ingenious analogy employed by Johann Bernoulli himself, not only revealed the inverted cycloid as the curve of fastest descent but also served as the crucible for the calculus of variations.

The brachistochrone's legacy is manifold. Its solution is a single, beautiful curve that simultaneously solves a time-minimization problem and a constant-time problem (isochronism), a property that was put to practical use by Huygens in the design of pendulum clocks. In a more applied sense, its principles have found their way into modern engineering, such as in the design of roller coasters. Most importantly, the mathematical framework born from this challenge—the calculus of variations—is a universal tool that underpins a vast array of optimization problems in contemporary science, from the foundational principles of mechanics to the intricate dynamics of quantum fields. The brachistochrone problem remains a timeless example of how a seemingly straightforward question can lead to world-changing mathematical and scientific discoveries, demonstrating the profound interconnectedness of abstract geometry and the physical world.

Wednesday, 27 August 2025

Five Five Numbers

The number associated with my diurnal age today, \( \textbf{27905} \), is one of those numbers that it is difficult to find anything of interest about. However, as usual, a little investigation turned up something special about it. It is what I call a five five number meaning it meets the following criteria:

  • it is a composite and squarefree number
  • its digits contain a single 5
  • each prime factor contains at least one 5 for a total of three 5's
  • its arithmetical digital root is 5


In the range up to 40000, there are only six numbers that satisfy these criteria and they are 12785, 27635, 27815, 27905, 28265 and 32765. Here are the details (permalink):

 number   factors    root

  12785    5 * 2557   5
  27635    5 * 5527   5
  27815    5 * 5563   5
  27905    5 * 5581   5
  28265    5 * 5653   5
  32765    5 * 6553   5

You could extend this idea to digits other than \( \textbf{5} \). The digit \( \textbf{3} \) produces too many suitable numbers but what about the digit \( \textbf{4} \) where we require this of the number:
  • it is a composite and squarefree number
  • its digits contain a single 4
  • each prime factor contains at least one 4 for a total of two 4's
  • its arithmetical digital root is 4


In the range up to 40000, only one number satisfies and that is 19147 = 41 x 467 with a digital root of 4 (permalink). Nothing for the digit \( \textbf{6} \) up to one million. For the digit \( \textbf{7} \) there is only one number up to one million and that is 544579 = 7 x 77797 with a digital root of 7 - we require that its prime factors contain a total of seven 7's (permalink). For the digits \( \textbf{8} \) and \( \textbf{9} \), no numbers qualify up to one million.

So it turns out that 27905 is not so uninteresting after all. Additionally, it is a \( \textbf{Proth} \) number, since it is equal to \(109 \times 2^8 + 1\) and \(109 < 28 \). I've written about these before in a post titled Proth Numbers.

Monday, 25 August 2025

Primes from Primes

Following on from my previous post, let's consider primes such that, when we add their consecutive pairs of digits together and concatenate them, we end up with another prime. Let's consider an example. I recently turned \( \textbf{27901}\) days old. This number is prime and this is what happens when we apply these operations to the number:$$  \underbrace{2+7}_{ \Large 9} \quad \underbrace{7+9}_{\Large 16} \quad  \underbrace{9+0}_{ \Large 9} \quad \underbrace{0+1}_{ \Large 1} \rightarrow 91691 \text{ a prime number}  $$In the range up to 40000, there are 403 numbers that satisfy the criteria. I'll show the 101 numbers from 27901 to 40000 below (permalink):

27901, 28081, 28163, 28201, 28229, 28447, 28607, 28621, 28627, 28661, 28703, 28867, 28927, 28961, 29009, 29021, 29063, 29129, 29167, 29201, 29207, 29221, 29401, 29567, 29789, 29881, 29921, 30029, 30089, 30109, 30427, 30509, 30643, 30649, 30763, 30781, 30809, 30829, 30983, 31249, 31627, 31663, 31849, 31883, 32009, 32089, 32189, 32401, 32429, 32563, 32609, 32749, 32843, 32909, 33029, 33149, 33289, 33349, 33529, 33601, 33829, 33889, 34147, 34261, 34327, 34483, 34501, 34583, 34589, 34807, 34963, 35089, 35129, 35401, 35461, 35543, 35603, 36109, 36209, 36229, 36721, 36901, 37021, 37189, 37409, 37589, 37747, 37963, 38047, 38149, 38461, 38629, 38707, 38729, 39103, 39229, 39409, 39503, 39749, 39829, 39929

Let's take the last number, 39929, as a second example:$$  \underbrace{3+9}_{ \Large 12} \quad \underbrace{9+9}_{\Large 18} \quad  \underbrace{9+2}_{ \Large 11} \quad \underbrace{2+9}_{ \Large 11} \rightarrow 12181111 \text{ a prime number}  $$For completeness, here are primes that arise from the above primes:

27901 --> 91691
28081 --> 10889
28163 --> 10979
28201 --> 101021
28229 --> 1010411
28447 --> 1012811
28607 --> 101467
28621 --> 101483
28627 --> 101489
28661 --> 1014127
28703 --> 101573
28867 --> 10161413
28927 --> 1017119
28961 --> 1017157
29009 --> 11909
29021 --> 11923
29063 --> 11969
29129 --> 1110311
29167 --> 1110713
29201 --> 111121
29207 --> 111127
29221 --> 111143
29401 --> 111341
29567 --> 11141113
29789 --> 11161517
29881 --> 1117169
29921 --> 1118113
30029 --> 30211
30089 --> 30817
30109 --> 3119
30427 --> 3469
30509 --> 3559
30643 --> 36107
30649 --> 361013
30763 --> 37139
30781 --> 37159
30809 --> 3889
30829 --> 381011
30983 --> 391711
31249 --> 43613
31627 --> 4789
31663 --> 47129
31849 --> 491213
31883 --> 491611
32009 --> 5209
32089 --> 52817
32189 --> 53917
32401 --> 5641
32429 --> 56611
32563 --> 57119
32609 --> 5869
32749 --> 591113
32843 --> 510127
32909 --> 51199
33029 --> 63211
33149 --> 64513
33289 --> 651017
33349 --> 66713
33529 --> 68711
33601 --> 6961
33829 --> 6111011
33889 --> 6111617
34147 --> 75511
34261 --> 7687
34327 --> 7759
34483 --> 781211
34501 --> 7951
34583 --> 791311
34589 --> 791317
34807 --> 71287
34963 --> 713159
35089 --> 85817
35129 --> 86311
35401 --> 8941
35461 --> 89107
35543 --> 81097
35603 --> 81163
36109 --> 9719
36209 --> 9829
36229 --> 98411
36721 --> 91393
36901 --> 91591
37021 --> 10723
37189 --> 108917
37409 --> 101149
37589 --> 10121317
37747 --> 10141111
37963 --> 1016159
38047 --> 118411
38149 --> 119513
38461 --> 1112107
38629 --> 1114811
38707 --> 111577
38729 --> 1115911
39103 --> 121013
39229 --> 1211411
39409 --> 121349
39503 --> 121453
39749 --> 12161113
39829 --> 12171011
39929 --> 12181111

What if we convert the prime numbers in base 10 to numbers in other bases. These numbers will remain prime of course and then we apply the operations but in our chosen base. Let's work with base 9. In the range from 27901 up to 40000, 121 numbers satisfy (permalink):

28123, 28211, 28279, 28297, 28463, 28513, 28517, 28549, 28621, 28663, 28697, 28711, 28789, 28859, 28933, 29167, 29221, 29251, 29269, 29399, 29527, 29581, 29669, 29683, 29759, 29761, 29917, 29921, 30013, 30133, 30139, 30187, 30553, 30677, 30763, 30839, 30841, 30871, 30949, 31159, 31181, 31219, 31249, 31271, 31357, 31397, 31489, 31541, 32059, 32077, 32083, 32099, 32353, 32491, 32497, 32621, 32653, 32783, 32917, 32939, 32987, 33149, 33331, 33461, 33479, 33581, 33617, 33619, 33641, 33851, 34019, 34033, 34127, 34211, 34303, 34429, 34537, 34607, 34757, 34897, 34913, 34919, 35081, 35291, 35363, 35401, 35423, 35509, 35617, 35671, 35747, 35837, 35869, 35923, 35963, 35993, 36011, 36389, 36479, 36571, 36767, 36857, 36929, 37199, 37273, 37307, 37313, 37361, 37397, 37997, 38083, 38261, 38321, 38447, 38461, 38677, 38933, 39041, 39233, 39239, 39857

Let's look at 39239, the second last number in that list. It becomes 58738 in base 9.$$ \begin{align} 28219_{\, 10} = 58738_{ \, 9} &\rightarrow \underbrace{5+8}_{ \Large 14} \quad \underbrace{8+7}_{\Large 16} \quad \underbrace{7+3}_{ \Large 11} \quad \underbrace{3+8}_{ \Large 12}\\ \\ &\rightarrow 14161112_{\,9} \text{ a prime number} \\ \\ &= 7007969_{\,10} \text{ also prime} \end{align}$$The details are as follows (first column is base 10 prime, second column is prime in base 9, third prime is the prime resulting from the operations of addition and concatenation in base 9 and the fourth column is the prime converted to a prime in base 10.

28123 --> 42517 --> 6768 --> 5003
28211 --> 42625 --> 6887 --> 5101
28279 --> 42711 --> 61082 --> 40169
28297 --> 42731 --> 610114 --> 360949
28463 --> 43035 --> 7338 --> 5381
28513 --> 43101 --> 7411 --> 5437
28517 --> 43105 --> 7415 --> 5441
28549 --> 43141 --> 7455 --> 5477
28621 --> 43231 --> 7554 --> 5557
28663 --> 43277 --> 751015 --> 446891
28697 --> 43325 --> 7657 --> 5641
28711 --> 43341 --> 7675 --> 5657
28789 --> 43437 --> 77711 --> 51607
28859 --> 43525 --> 7877 --> 5821
28933 --> 43617 --> 71078 --> 46727
29167 --> 44007 --> 8407 --> 6163
29221 --> 44067 --> 84614 --> 55903
29251 --> 44111 --> 8522 --> 6257
29269 --> 44131 --> 8544 --> 6277
29399 --> 44285 --> 861114 --> 512581
29527 --> 44447 --> 88812 --> 58979
29581 --> 44517 --> 81068 --> 53279
29669 --> 44625 --> 81187 --> 53377
29683 --> 44641 --> 811115 --> 479777
29759 --> 44735 --> 812118 --> 480509
29761 --> 44737 --> 8121111 --> 4324519
29917 --> 45031 --> 10534 --> 6997
29921 --> 45035 --> 10538 --> 7001
30013 --> 45147 --> 106512 --> 63839
30133 --> 45301 --> 10831 --> 7237
30139 --> 45307 --> 10837 --> 7243
30187 --> 45361 --> 108107 --> 64969
30553 --> 45817 --> 1014108 --> 541007
30677 --> 46065 --> 116612 --> 70481
30763 --> 46171 --> 11788 --> 7937
30839 --> 46265 --> 118812 --> 72101
30841 --> 46267 --> 118814 --> 72103
30871 --> 46311 --> 111042 --> 66377
30949 --> 46407 --> 111147 --> 66463
31159 --> 46661 --> 1113137 --> 599353
31181 --> 46685 --> 11131514 --> 5394289
31219 --> 46737 --> 11141111 --> 5400523
31249 --> 46771 --> 1114158 --> 600101
31271 --> 46805 --> 111585 --> 66821
31357 --> 47011 --> 12712 --> 8597
31397 --> 47055 --> 127511 --> 77689
31489 --> 47167 --> 128714 --> 78583
31541 --> 47235 --> 121058 --> 72953
32059 --> 47871 --> 1216168 --> 660617
32077 --> 48001 --> 13801 --> 9397
32083 --> 48007 --> 13807 --> 9403
32099 --> 48025 --> 13827 --> 9421
32353 --> 48337 --> 1312611 --> 717103
32491 --> 48511 --> 131462 --> 79841
32497 --> 48517 --> 131468 --> 79847
32621 --> 48665 --> 13151312 --> 6470129
32653 --> 48711 --> 131682 --> 80021
32783 --> 48865 --> 13171512 --> 6483413
32917 --> 50134 --> 5147 --> 3769
32939 --> 50158 --> 51614 --> 34033
32987 --> 50222 --> 5244 --> 3847
33149 --> 50422 --> 5464 --> 4027
33331 --> 50644 --> 56118 --> 37277
33461 --> 50808 --> 5888 --> 4373
33479 --> 50828 --> 581111 --> 348553
33581 --> 51052 --> 6157 --> 4507
33617 --> 51102 --> 6212 --> 4547
33619 --> 51104 --> 6214 --> 4549
33641 --> 51128 --> 62311 --> 41077
33851 --> 51382 --> 641211 --> 381439
34019 --> 51588 --> 661417 --> 394729
34033 --> 51614 --> 6775 --> 5009
34127 --> 51728 --> 681011 --> 407521
34211 --> 51832 --> 610125 --> 360959
34303 --> 52044 --> 7248 --> 5309
34429 --> 52204 --> 7424 --> 5449
34537 --> 52334 --> 7567 --> 5569
34607 --> 52422 --> 7664 --> 5647
34757 --> 52608 --> 7868 --> 5813
34897 --> 52774 --> 7101512 --> 3780281
34913 --> 52802 --> 71182 --> 46811
34919 --> 52808 --> 71188 --> 46817
35081 --> 53108 --> 8418 --> 6173
35291 --> 53362 --> 86108 --> 56951
35363 --> 53452 --> 87107 --> 57679
35401 --> 53504 --> 8854 --> 6529
35423 --> 53528 --> 88711 --> 58897
35509 --> 53634 --> 810107 --> 479041
35617 --> 53764 --> 8111411 --> 4318201
35671 --> 53834 --> 812127 --> 480517
35747 --> 54028 --> 104211 --> 62137
35837 --> 54138 --> 105412 --> 63029
35869 --> 54174 --> 105812 --> 63353
35923 --> 54244 --> 10668 --> 7109
35963 --> 54288 --> 1061117 --> 571633
35993 --> 54332 --> 10765 --> 7187
36011 --> 54352 --> 10787 --> 7207
36389 --> 54822 --> 1013114 --> 540283
36479 --> 55032 --> 11535 --> 7727
36571 --> 55144 --> 11658 --> 7829
36767 --> 55382 --> 1181211 --> 643879
36857 --> 55502 --> 111152 --> 66467
36929 --> 55582 --> 11111411 --> 5381083
37199 --> 56022 --> 12624 --> 8527
37273 --> 56114 --> 12725 --> 8609
37307 --> 56152 --> 12767 --> 8647
37313 --> 56158 --> 127614 --> 77773
37361 --> 56222 --> 12844 --> 8707
37397 --> 56262 --> 12888 --> 8747
37997 --> 57108 --> 13818 --> 9413
38083 --> 57214 --> 131035 --> 79493
38261 --> 57432 --> 131275 --> 79691
38321 --> 57508 --> 131358 --> 79757
38447 --> 57658 --> 13141214 --> 6463489
38461 --> 57674 --> 13141412 --> 6463649
38677 --> 58044 --> 14848 --> 10169
38933 --> 58358 --> 1412814 --> 776317
39041 --> 58488 --> 14131317 --> 6988453
39233 --> 58732 --> 1416115 --> 778667
39239 --> 58738 --> 14161112 --> 7007969
39857 --> 60605 --> 6665 --> 4919

Saturday, 23 August 2025

Fun With Primes and Digit Pairs

One of the interesting mathematical facts about the number associated with my diurnal age today, \( \textbf{27901} \), is that it is prime and the sums of all pairs of its successive digits are \( \textbf{square} \) numbers. We have:$$ \begin{align} 2 + 7 &= 9 = 3^2 \\ 7 + 9 &= 16 = 4^2 \\ 9 + 0 &= 9 = 3^2 \\ 0+1 &= 1 = 1^2 \end{align}$$Such numbers are few and far between. In fact, up to 40000, there are only 41 of them and they belong to OEIS A108659 (permalink):

\( \textbf{primes with the sums of all pairs of successive digits square} \)

13, 31, 79, 97, 101, 109, 131, 181, 227, 313, 401, 409, 631, 727, 797, 881, 1009, 1013, 1097, 2797, 3109, 3181, 3631, 4001, 4013, 7901, 8101, 9001, 9013, 10009, 10181, 10909, 10979, 13109, 18131, 18181, 22279, 22727, 27901, 31013, 36313

If a number is prime and the sums of all pairs of successive digits are \( \textbf{prime} \) as well then we find that there are 160 numbers that qualify in the range up 40000 (permalink):

\( \textbf{primes with the sums of all pairs of successive digits prime} \)

11, 23, 29, 41, 43, 47, 61, 67, 83, 89, 149, 167, 211, 307, 347, 349, 383, 389, 503, 521, 523, 743, 761, 929, 941, 947, 983, 1123, 1129, 2029, 2111, 2129, 2141, 2143, 2161, 2341, 2347, 2383, 2389, 2503, 2521, 3023, 3203, 4111, 4129, 4349, 4703, 4943, 5021, 5023, 6121, 6143, 6521, 6529, 6703, 6761, 7411, 8329, 8389, 8521, 8923, 8929, 8941, 9203, 11149, 11161, 11411, 12143, 12149, 12161, 12323, 12329, 12343, 12347, 12503, 12583, 12589, 12923, 12941, 12983, 14143, 14149, 14303, 14321, 14323, 14341, 14347, 14389, 14741, 14747, 14767, 14923, 14929, 14947, 14983, 16111, 16141, 16529, 16561, 16567, 16703, 16741, 16747, 20323, 20341, 20347, 20389, 20507, 20521, 20707, 20743, 20747, 20749, 21121, 21143, 21149, 21211, 21611, 23021, 23029, 23203, 29207, 29411, 30203, 30211, 30307, 30323, 30341, 30347, 30389, 30529, 30703, 30707, 32029, 32141, 32143, 32303, 32321, 32323, 32341, 32503, 32507, 32561, 32941, 32983, 34123, 34129, 34141, 34147, 34303, 34703, 34747, 34949, 38303, 38321, 38329, 38561, 38567, 38921, 38923

Let's take the final number, \( \textbf{38923} \), above as an example. We have:$$ \begin{align} 3 + 8 &=11\\8 + 9 &= 17 \\ 9+2 &=11\\2+3 &=5 \end{align}$$We can add an additional constraint here and that is that the \( \textbf{first and last digits} \) be considered adjacent and prime as well. In this case, the suitable numbers in the range up to 40000 shrink to 60. These numbers belong to OEIS A086244 (permalink):$$ \begin{align} &\textbf{primes with the sums of all pairs of successive } \\  &\textbf{digits prime as well as sums of first and last digits} \end{align}$$11, 23, 29, 41, 43, 47, 61, 67, 83, 89, 211, 2029, 2111, 2129, 2141, 2143, 2161, 2341, 2383, 2389, 2503, 2521, 4111, 4129, 4349, 4703, 4943, 6121, 6521, 6761, 8329, 8389, 8923, 8929, 11161, 11411, 12161, 12941, 14321, 14341, 14741, 16111, 16141, 16561, 16741, 20323, 20341, 20389, 20521, 20743, 20749, 21121, 21143, 21149, 21211, 21611, 23021, 23029, 23203, 29411

Let's take the final number in the previous list, \( \textbf{29411} \), and show that it satisfies the criteria:$$ \begin{align} 2 + 9 &= 11 \\ 9 + 4 &= 13 \\ 4 + 1 &= 5 \\ 1 + 1 &= 2 \\ 2 + 1 &= 3 \end{align}$$We can also consider primes where the absolute values of \( \textbf{differences} \) between successive pairs of digits are prime. There are 272 of these in the range up to 40000. They constitute OEIS A087593 (permalink):$$ \begin{align} &\textbf{primes with the absolute differences} \\  &\textbf{of all pairs of successive digits prime} \end{align} $$13, 29, 31, 41, 47, 53, 61, 79, 83, 97, 131, 149, 163, 181, 241, 257, 307, 313, 353, 383, 461, 463, 479, 503, 613, 631, 641, 647, 683, 727, 757, 797, 853, 857, 863, 929, 941, 947, 1303, 1307, 1361, 1381, 1427, 1429, 1613, 1697, 1831, 1861, 2027, 2029, 2053, 2503, 2531, 2579, 2707, 2729, 2741, 2749, 2753, 2797, 2927, 2963, 2969, 3079, 3163, 3169, 3181, 3527, 3529, 3581, 3583, 3613, 3631, 3697, 3853, 3863, 4241, 4253, 4297, 4649, 4703, 4729, 4969, 5279, 5297, 5303, 5381, 5741, 5749, 5813, 5857, 5861, 5869, 6131, 6163, 6353, 6361, 6427, 6469, 6857, 6863, 6869, 6947, 6949, 6961, 7027, 7057, 7079, 7207, 7247, 7253, 7297, 7507, 7529, 7583, 7927, 7949, 7963, 8147, 8161, 8353, 8363, 8369, 8527, 8581, 8641, 8647, 8681, 9203, 9241, 9257, 9413, 9461, 9463, 9479, 9497, 9613, 9631, 9649, 9697, 9749, 13147, 13163, 13183, 13613, 13649, 13681, 13697, 13831, 14149, 14207, 14249, 14683, 14741, 14747, 14753, 14797, 14929, 14947, 14969, 16141, 16183, 16361, 16363, 16369, 16381, 16427, 16831, 16927, 16963, 16979, 18131, 18149, 18169, 18181, 18307, 18313, 18353, 18503, 18583, 20249, 20297, 20353, 20357, 20369, 20507, 20707, 20747, 20749, 20753, 24169, 24181, 24203, 24247, 24631, 24683, 24697, 24749, 24979, 25031, 25057, 25247, 25253, 25303, 25307, 25357, 25703, 25741, 25747, 27031, 27241, 27253, 27427, 27479, 27527, 27529, 27581, 27583, 27941, 27947, 27961, 29207, 29297, 29429, 29641, 29683, 29741, 29753, 30203, 30241, 30253, 30307, 30313, 30529, 30703, 30707, 30727, 30757, 31307, 31357, 31469, 31649, 35027, 35053, 35257, 35279, 35353, 35363, 35381, 35729, 35747, 35753, 35797, 35831, 35863, 35869, 36131, 36161, 36307, 36313, 36353, 36383, 36469, 36479, 36497, 36857, 36929, 36947, 36979, 38149, 38183, 38303

Let's take the last number, \( \textbf{38303}\), in the list above. We have:$$ \begin{align} |3-8|=5 \\ |8 - 3|=5 \\ |3-0|=3 \\ |0-3|=3 \end{align}$$There are all sorts of variations on this theme (the properties of pairs of adjacent digits) and so another approach is to consider the squares of the digits. Let's require that the sums of squares of adjacent digits be prime. We find that there are 71 numbers that qualify in the range up to 40000. These are (permalink):$$ \begin{align} \textbf{primes with the sums of all pairs}\\ \textbf{of successive digits squared prime} \end{align} $$11, 23, 41, 61, 83, 127, 149, 211, 383, 521, 523, 541, 587, 727, 787, 941, 1123, 2111, 2141, 2161, 2383, 2521, 2549, 4111, 4127, 4523, 4549, 4561, 4583, 6121, 6521, 7211, 8387, 8521, 8527, 8783, 11149, 11161, 11411, 12149, 12161, 12323, 12527, 12541, 12583, 12721, 14149, 14549, 14561, 16111, 16127, 16141, 16561, 21121, 21149, 21211, 21611, 25411, 27211, 32141, 32321, 32323, 32327, 32561, 32587, 32783, 38321, 38327, 38561, 38723, 38783

Let's take the last number, \( \textbf{38783} \), as an example:$$ \begin{align} 3^2+8^2 &= 9 + 64 =73 \\ 8^2+7^2 &= 64 +49 = 113 \\ 7^2+8^2 &= 49+64 = 113 \\ 8^2+3^2 &= 64 + 9 = 73 \end{align}$$

Monday, 18 August 2025

Zumkeller Numbers

 I've been thinking about Zumkeller numbers. Here's a definition:

A number is a Zumkeller number if its divisors can be split into two separate sets that have the same sum. A key requirement for this to be possible is that the total sum of all divisors must be an even number. If the total sum were odd, you couldn't possibly split it into two equal integer sums.

Now the great majority of Zumkeller numbers are \( \textbf{even} \) numbers. In the range up to 100,000 there are 24362, comprising 24.362% of the range. However, there are only 208 \( \textbf{odd} \) Zumkeller numbers in that range, comprising 0.208%. Now how many abundant numbers are \( \textbf{NOT} \) Zumkeller number because their sum of divisors is \( \textbf{odd} \)? In the range up to 100,000, there are 146 such numbers comprising OEIS A156903. Of these, only two are odd, 1025 and 99225 with:

  • \(11025 = 3^2 \times 5^2 \times 7^2 = 105^2\)
  • \(99225 = 3^4 \times 5^2 \times 7^2\ = 945^2 \)
Additionally there 572 abundant numbers with an even sum of divisors that are \( \textbf{NOT}\) Zumkeller. So overall there are 718 abundant numbers in the range up to 100,000 that aren't Zumkeller. See blog post titled Abundant But Not Zumkeller for the list.

Even 70, the smallest "weird number" (an abundant number that is not the sum of any subset of its proper divisors), is a Zumkeller number. It's sum of divisors is 144 > 140 and thus it is abundant. It's divisors are {1, 2, 5, 7, 10, 14, 35, 70}. These can be split into {70, 2} and {1, 5, 7, 10, 14, 35} with both summing to 72. In fact, up to 100,000 at least, \( \text{all}\) of the weird numbers are Zumkeller numbers. Here are the weird numbers up to 100,000:

70, 836, 4030, 5830, 7192, 7912, 9272, 10430, 10570, 10792, 10990, 11410, 11690, 12110, 12530, 12670, 13370, 13510, 13790, 13930, 14770, 15610, 15890, 16030, 16310, 16730, 16870, 17272, 17570, 17990, 18410, 18830, 18970, 19390, 19670, 19810, 20510, 21490, 21770, 21910, 22190, 23170, 23590, 24290, 24430, 24710, 25130, 25690, 26110, 26530, 26810, 27230, 27790, 28070, 28630, 29330, 29470, 30170, 30310, 30730, 31010, 31430, 31990, 32270, 32410, 32690, 33530, 34090, 34370, 34930, 35210, 35630, 36470, 36610, 37870, 38290, 38990, 39410, 39830, 39970, 40390, 41090, 41510, 41930, 42070, 42490, 42910, 43190, 43330, 44170, 44870, 45010, 45290, 45356, 45710, 46130, 46270, 47110, 47390, 47810, 48370, 49070, 49630, 50330, 50890, 51310, 51730, 52010, 52570, 52990, 53270, 53830, 54110, 55090, 55790, 56630, 56770, 57470, 57610, 57890, 58030, 58730, 59710, 59990, 60130, 60410, 61390, 61670, 61810, 62090, 63490, 63770, 64330, 65030, 65590, 65870, 66290, 66710, 67690, 67970, 68390, 68810, 69370, 69790, 70630, 70910, 71330, 71470, 72170, 72310, 72730, 73430, 73570, 73616, 74270, 74410, 74830, 76090, 76370, 76510, 76790, 77210, 77630, 78190, 78610, 79030, 80570, 80710, 81410, 81970, 82670, 83090, 83312, 83510, 84070, 84910, 85190, 85610, 86030, 86170, 86590, 87430, 88130, 89390, 89530, 89810, 90230, 90370, 90790, 91070, 91210, 91388, 91490, 92330, 92470, 92890, 95270, 95690, 96110, 96670, 97930, 98630, 99610, 99890

I've only written about Zumkeller numbers on one previous occasion. That was a post titled Zumkellar Numbers, Half Zumkellar Numbers and Pseudoperfect Numbers that I uploaded in November of 2018. In that post I made reference to the person behind these numbers by quoting a eulogy by Neil Sloane, the originator of the OEIS.
I am deeply sorry to have to report that Reinhard Zumkeller passed away at the end of March 2016. He suffered from pancreatic cancer, which had already progressed to an advanced stage when it was diagnosed. He was a long-time contributor to the OEIS, and was later an editor and then a diligent and dedicated editor-in-chief. Between 2000 and 2016 he contributed over 23000 items to the OEIS. Reinhard was a great Haskell expert, and he was already ready to write a Haskell program and compute 10000 terms when I was studying a new sequence and wanted to see a graph. He will be greatly missed. Neil Sloane, July 3, 2016.