There is a set of non-square semiprimes defined by two criteria:
- the two prime factors concatenate in either order to form two new semiprimes
- the digits of the two prime factors can each be rearranged to form semiprimes
There is a set of non-square semiprimes defined by two criteria:
Every Fermat number greater than 257 has a prime factor of the form \(384 \times k + 257, k > 0\).
Let's test this out with the initial Fermat numbers greater than 257. Now \( \text{F}_4=65537\) is a prime and so it is its own prime factor and we find that:$$65537 = 384 \times 170 + 257$$The next Fermat numbers listed above are all composite so we need to check their prime factors:$$ \begin{align} \text{F}_5=4294967297 &= 641 \times 6700417 \\ 641 &= 384 \times 1 + 257 \end{align}$$ $$ \begin{align} \text{F}_6=18446744073709,551,617 &=274177 × 67280421310721\\ 67280421310721 &= 384 \times 175209430496+257 \end{align}$$I won't attempt \( \text{F}_7 \) as it's too lengthy but the point is made. There's an explanation that Gemini provided as to why at least one prime factor of a Fermat number must have this form. You can check that out here.
Today I'm 28285 days old and one of the properties of this number is that it's magnanimous, meaning that inserting a "+" between any two digits produces a prime. In this case we have:
The number associated with my diurnal age today, \( \textbf{28284} \), has a property that grants it membership in OEIS A338902:
I got Gemini to write a program to find the number of suitable partitions for integers from 1 to 50 displaying the results as both a table and a list (permalink):
Semiprime | Partitions ----------------------- 4 | 1 6 | 1 9 | 1 10 | 2 14 | 3 15 | 2 21 | 4 22 | 7 25 | 7 26 | 10 33 | 17 34 | 25 35 | 21 38 | 34 39 | 34 46 | 73 49 | 87 51 | 103 55 | 149 57 | 176 58 | 206 62 | 281 65 | 344 69 | 479 74 | 725 77 | 881 82 | 1311 85 | 1597 86 | 1742 87 | 1841 91 | 2445 93 | 2808 94 | 3052 95 | 3222 106 | 6784 111 | 9298 115 | 11989 118 | 14533 119 | 15384 121 | 17414 122 | 18581 123 | 19680 129 | 28284 133 | 35862 134 | 38125 141 | 57095 142 | 60582 143 | 64010 145 | 71730 146 | 76016
1, 1, 1, 2, 3, 2, 4, 7, 7, 10, 17, 25, 21, 34, 34, 73, 87, 103, 149, 176, 206, 281, 344, 479, 725, 881, 1311, 1597, 1742, 1841, 2445, 2808, 3052, 3222, 6784, 9298, 11989, 14533, 15384, 17414, 18581, 19680, 28284, 35862, 38125, 57095, 60582, 64010, 71730, 76016
As can be seen, the integer \( \textbf{43} \) has \( \textbf{28284} \) partitions compared to its 63261 unrestricted partitions.
Similar results could be created for primes and triprimes. Here are the result for the primes (permalink). The numbers form OEIS A056768.
Prime | Partitions --------------------- 2 | 1 3 | 1 5 | 2 7 | 3 11 | 6 13 | 9 17 | 17 19 | 23 23 | 40 29 | 87 31 | 111 37 | 219 41 | 336 43 | 413 47 | 614 53 | 1083 59 | 1850 61 | 2198 67 | 3630 71 | 5007 73 | 5861 79 | 9282 83 | 12488 89 | 19232 97 | 33439 101 | 43709 103 | 49871 107 | 64671 109 | 73506 113 | 94625 127 | 221265 131 | 279516 137 | 394170 139 | 441250 149 | 766262 151 | 853692 157 | 1175344 163 | 1608014 167 | 1975108 173 | 2675925 179 | 3605666 181 | 3977861 191 | 6447003 193 | 7089299 197 | 8559069 199 | 9397474 211 | 16298212 223 | 27810910 227 | 33121140 229 | 36123177
1, 1, 2, 3, 6, 9, 17, 23, 40, 87, 111, 219, 336, 413, 614, 1083, 1850, 2198, 3630, 5007, 5861, 9282, 12488, 19232, 33439, 43709, 49871, 64671, 73506, 94625, 221265, 279516, 394170, 441250, 766262, 853692, 1175344, 1608014, 1975108, 2675925, 3605666, 3977861, 6447003, 7089299, 8559069, 9397474, 16298212, 27810910, 33121140, 36123177
Here are the result for the triprimes (permalink).
Triprime | Partitions ----------------------- 8 | 1 12 | 1 18 | 1 20 | 2 27 | 1 28 | 3 30 | 2 42 | 4 44 | 7 45 | 2 50 | 7 52 | 10 63 | 7 66 | 18 68 | 25 70 | 22 75 | 13 76 | 34 78 | 36 92 | 78 98 | 97 99 | 47 102 | 117 105 | 60 110 | 170 114 | 202 116 | 230 117 | 111 124 | 316 125 | 165 130 | 401 138 | 579 147 | 478 148 | 866 153 | 616 154 | 1086 164 | 1652 165 | 1040 170 | 2076 171 | 1350 172 | 2227 174 | 2418 175 | 1566 182 | 3271 186 | 3802 188 | 4115 190 | 4372 195 | 3587 207 | 5708 212 | 9783
1, 1, 1, 2, 1, 3, 2, 4, 7, 2, 7, 10, 7, 18, 25, 22, 13, 34, 36, 78, 97, 47, 117, 60, 170, 202, 230, 111, 316, 165, 401, 579, 478, 866, 616, 1086, 1652, 1040, 2076, 1350, 2227, 2418, 1566, 3271, 3802, 4115, 4372, 3587, 5708, 9783, 13878, 18291, 13983, 22465, 23913, 27489, 29296, 23092, 31441, 32846 (these are first 60 terms).
These results are base-independent and in general what is being done here is to take an integer with a certain property (primeness for example) and express it as a sum of smaller numbers with the same property. The numbere of ways in which this can be done is being counted. Here are some examples:
I first reviewed Rhonda Numbers in an eponymous post on the 16th October 2018. Read that post to find out what defines such numbers. Today, upon turning 28280 days old, I was reminded of them again because this number is a member of OEIS A255731:
The program that I wrote back then only covered bases from 2 to 36 so I got Gemini to write a new SageMath program that would accommodate every base. Here is what is generated as output when asked to find all Rhonda numbers in base 60 in the range up to one million (permalink):
3348, 3510, 6750, 17430, 18750, 18876, 18944, 19475, 20564, 21312, 26550, 28280, 37230, 38396, 43940, 48042, 77770, 88270, 91224, 97470, 108882, 111403, 120046, 123630, 181996, 182646, 235467, 253460, 260429, 264735, 278675, 289161, 295960, 296055, 306642, 324394, 325593, 337040, 348641, 361221, 377130, 378444, 398274, 411342, 412930, 441048, 444405, 450528, 453470, 458136, 469098, 499533, 503310, 517803, 533731, 534795, 541807, 547515, 566754, 598695, 612374, 612870, 626535, 630410, 656370, 656750, 667491, 670548, 684456, 701765, 703304, 705256, 706275, 709475, 720279, 750225, 757576, 762745, 765245, 809107, 812658, 821106, 877300, 880045, 881454, 915348, 927303, 929830, 930304, 936573, 936675, 967509, 972196, 973549, 984485, 986895, 998430
I also realised that I hadn't included the identification of Rhonda numbers in my daily number analysis and that deficiency has now been remedied. Here the output of the program that I got Gemini to write for the input 29280 (permalink):
28280 : determination of whether it is a Rhonda number in a given base
--- Evaluating 28280 in Base 60 ---
1. Base-60 Digits: [7, 51, 20]
2. Digit Product: 7 * 51 * 20 = 7140
3. Prime Factorization: 2^3 * 5 * 7 * 101
4. Sum of Factors: 2 + 2 + 2 + 5 + 7 + 101 = 119
5. Target Equation (Base * Sum): 60 * 119 = 7140
RESULT: True. 28280 IS a Rhonda number in base 60.
I've set the range of bases to be investigate to 100,000 so that even a number like 889200 with is a Rhonda number in TEN different bases has an accurate output:
--- Evaluating 889200 in Base 1512 ---
1. Base-1512 Digits: [588, 144]
2. Digit Product: 588 * 144 = 84672
3. Prime Factorization: 2^4 * 3^2 * 5^2 * 13 * 19
4. Sum of Factors: 2 + 2 + 2 + 2 + 3 + 3 + 5 + 5 + 13 + 19 = 56
5. Target Equation (Base * Sum): 1512 * 56 = 84672
RESULT: True. 889200 IS a Rhonda number in base 1512.
-----------------------------------
--- Evaluating 889200 in Base 2760 ---
1. Base-2760 Digits: [322, 480]
2. Digit Product: 322 * 480 = 154560
3. Prime Factorization: 2^4 * 3^2 * 5^2 * 13 * 19
4. Sum of Factors: 2 + 2 + 2 + 2 + 3 + 3 + 5 + 5 + 13 + 19 = 56
5. Target Equation (Base * Sum): 2760 * 56 = 154560
RESULT: True. 889200 IS a Rhonda number in base 2760.
-----------------------------------
--- Evaluating 889200 in Base 5160 ---
1. Base-5160 Digits: [172, 1680]
2. Digit Product: 172 * 1680 = 288960
3. Prime Factorization: 2^4 * 3^2 * 5^2 * 13 * 19
4. Sum of Factors: 2 + 2 + 2 + 2 + 3 + 3 + 5 + 5 + 13 + 19 = 56
5. Target Equation (Base * Sum): 5160 * 56 = 288960
RESULT: True. 889200 IS a Rhonda number in base 5160.
-----------------------------------
--- Evaluating 889200 in Base 7904 ---
1. Base-7904 Digits: [112, 3952]
2. Digit Product: 112 * 3952 = 442624
3. Prime Factorization: 2^4 * 3^2 * 5^2 * 13 * 19
4. Sum of Factors: 2 + 2 + 2 + 2 + 3 + 3 + 5 + 5 + 13 + 19 = 56
5. Target Equation (Base * Sum): 7904 * 56 = 442624
RESULT: True. 889200 IS a Rhonda number in base 7904.
-----------------------------------
--- Evaluating 889200 in Base 9400 ---
1. Base-9400 Digits: [94, 5600]
2. Digit Product: 94 * 5600 = 526400
3. Prime Factorization: 2^4 * 3^2 * 5^2 * 13 * 19
4. Sum of Factors: 2 + 2 + 2 + 2 + 3 + 3 + 5 + 5 + 13 + 19 = 56
5. Target Equation (Base * Sum): 9400 * 56 = 526400
RESULT: True. 889200 IS a Rhonda number in base 9400.
-----------------------------------
--- Evaluating 889200 in Base 10032 ---
1. Base-10032 Digits: [88, 6384]
2. Digit Product: 88 * 6384 = 561792
3. Prime Factorization: 2^4 * 3^2 * 5^2 * 13 * 19
4. Sum of Factors: 2 + 2 + 2 + 2 + 3 + 3 + 5 + 5 + 13 + 19 = 56
5. Target Equation (Base * Sum): 10032 * 56 = 561792
RESULT: True. 889200 IS a Rhonda number in base 10032.
-----------------------------------
--- Evaluating 889200 in Base 11440 ---
1. Base-11440 Digits: [77, 8320]
2. Digit Product: 77 * 8320 = 640640
3. Prime Factorization: 2^4 * 3^2 * 5^2 * 13 * 19
4. Sum of Factors: 2 + 2 + 2 + 2 + 3 + 3 + 5 + 5 + 13 + 19 = 56
5. Target Equation (Base * Sum): 11440 * 56 = 640640
RESULT: True. 889200 IS a Rhonda number in base 11440.
-----------------------------------
--- Evaluating 889200 in Base 12920 ---
1. Base-12920 Digits: [68, 10640]
2. Digit Product: 68 * 10640 = 723520
3. Prime Factorization: 2^4 * 3^2 * 5^2 * 13 * 19
4. Sum of Factors: 2 + 2 + 2 + 2 + 3 + 3 + 5 + 5 + 13 + 19 = 56
5. Target Equation (Base * Sum): 12920 * 56 = 723520
RESULT: True. 889200 IS a Rhonda number in base 12920.
-----------------------------------
--- Evaluating 889200 in Base 14136 ---
1. Base-14136 Digits: [62, 12768]
2. Digit Product: 62 * 12768 = 791616
3. Prime Factorization: 2^4 * 3^2 * 5^2 * 13 * 19
4. Sum of Factors: 2 + 2 + 2 + 2 + 3 + 3 + 5 + 5 + 13 + 19 = 56
5. Target Equation (Base * Sum): 14136 * 56 = 791616
RESULT: True. 889200 IS a Rhonda number in base 14136.
-----------------------------------
--- Evaluating 889200 in Base 15080 ---
1. Base-15080 Digits: [58, 14560]
2. Digit Product: 58 * 14560 = 844480
3. Prime Factorization: 2^4 * 3^2 * 5^2 * 13 * 19
4. Sum of Factors: 2 + 2 + 2 + 2 + 3 + 3 + 5 + 5 + 13 + 19 = 56
5. Target Equation (Base * Sum): 15080 * 56 = 844480
RESULT: True. 889200 IS a Rhonda number in base 15080.
-----------------------------------
Until today my diurnal age has suffered a drought of prime numbers. Prior to today (3rd September 2026) when I turned 28277 days old, the last prime (28229) occurred on July 17th. This marked a gap of 48 days between successive primes. This is not a record gap but it is impressive. Figure 1 shows the successive record gaps between primes.
![]() |
Figure 1 |
A178587 | Primes that are the average of the members of more than one emirp pair. |
I was curious as to how to count the number of ways that a given number can be represented in Loeschian form based on its prime factorisation. I knew there was such a method for counting how many ways a number can be represented as a sum of two squares. I got Gemini to investigate, compare and summarise the results. Notice the use of the ceiling function when determining the number of essentially distinct pairs. Remember also that the invalid primes become valid if raised to an even power but they don't contribute to the count. The \(b_{\textit{i}}\) in the table refers to the exponents of the generating primes.
The algebraic frameworks for expressing integers as \(x^2 + xy + y^2\) and \(x^2 + y^2\) mirror each other directly through their respective complex integer rings.
| Characteristic | Loeschian Form \(x^2 + xy + y^2\) | Sum of Two Squares \(x^2 + y^2\) |
|---|---|---|
| Complex Ring | Eisenstein Integers \(\mathbb{Z}[e^{2\pi i/3}]\) | Gaussian Integers \(\mathbb{Z}[i]\) |
| Invalid Primes (Require Even Exponents) |
\(p \equiv 2 \pmod 3\) | \(p \equiv 3 \pmod 4\) |
| Generating Primes (Exponents \(b_i\)) |
\(p \equiv 1 \pmod 3\) | \(p \equiv 1 \pmod 4\) |
| Neutral Prime | \(p = 3\) | \(p = 2\) |
| Unit Symmetries (Multiplier) |
6 | 4 |
| Total Ordered Pairs \((x,y)\) | \(6 \prod (b_i + 1)\) | \(4 \prod (b_i + 1)\) |
| Essentially Distinct Pairs \(\{x,y\}\) | \(\lceil \frac{1}{2} \prod (b_i + 1) \rceil\) | \(\lceil \frac{1}{2} \prod (b_i + 1) \rceil\) |
Both systems demand that primes which cannot be represented natively by the quadratic form must be "squared away" with even exponents in the prime factorization. For Gaussian integers, primes congruent to \(3 \pmod 4\) (such as 3, 7, 11) cannot form sums of two squares. For Eisenstein integers, primes congruent to \(2 \pmod 3\) (such as 2, 5, 11) cannot be Loeschian. If any of these restricted primes have an odd exponent, the integer cannot be represented in that form, and the total count is zero.
The difference in the total number of ordered coordinate pairs stems entirely from the geometry of the complex rings. Gaussian integers form a square lattice with 4 units (\(\pm 1, \pm i\)), leading to a rotational symmetry multiplier of 4. Eisenstein integers form a hexagonal lattice with 6 units (\(\pm 1, \pm e^{2\pi i/3}, \pm e^{4\pi i/3}\)), leading to a multiplier of 6.
Once these geometric symmetries are factored out by dividing by the respective unit count, both systems calculate the number of essentially distinct, non-negative integer pairs using the exact same ceiling function formula. The generating primes dictate this final count, while the unique neutral prime in each system scales the base integer without creating new algebraic variations.