Skip to main content

Self-Generating Numbers

A basic example of a self-generating number involves the subtraction of a number from its reverse (mirror) so that the original is once more obtained. And the simplest of these numbers involve just two digits.

However in base 10 no such numbers exist. So for example we confine ourselves to 2 digits, with a the first digit and b the second, there are no numbers for which ba – ab = ab.


Some time ago I was able to ascertain that such numbers do exist in other number bases, in fact in bases 2, 5, 8, 11, …

So for example in base 2, if ab = 01, then 10 – 01 = 01. (One might quibble however that this is a trivial case, as the first digit of 01 is redundant).

Likewise in base 5, if ab = 13, then ba = 31 and ba – ab = 31 – 13 = 13.

Then in base 8, if ab = 25, then ba = 52 and ba – ab = 52 – 25 = 25.

In fact there is a common pattern here. a = (b – 1)/2 and a + b = (n – 1).

So (b – 1)/2 + b = n – 1. Therefore (3b – 1)/2 = n – 1. Thus 3b – 1 = 2n – 2 so that 2n = 3b + 1, with n = (3b + 1)/2

Therefore for the next relevant number base, n = 11 so that 22 = 3b + 1, with b = 7 and a = 3.

Thus in base 11, 73 – 37 = 37.

 

Now if a 2-digit number is self-generating in this manner, then we can always find corresponding examples in the same base for 3-digit, 4-digit, 5-digit … n-digit numbers.

For again if ab is self-generating in 2-digit terms we can always insert the digit n – 1 as a new middle digit to obtain a 3-digit number that is likewise self generating.

So, as we have seen, 25 is a 2-digit self-generating number in base 8. Therefore 275 is likewise a new 3-digit self generating number.

Thus 572 – 275 = 275 (in base 8).

Just as there is only one 2-digit self-generating number in bases, 2, 5, 8, 11, …, equally there is only one 3-digit self-generating number in the corresponding number bases.

However as we continue on into higher digit numbers, the number of self-generating numbers in each relevant base increases.

So when  k = no. of digits in number, when k = 2 and k = 3, only one self-generating example in each relevant number base arises.

However when k = 4, we can easily demonstrate that now 2 self-generating numbers exist.

So, again in base 8,

5772 – 2775 = 2775; also 5252 – 2525 = 2525.

And likewise when k = 5, we have 2 self-generating numbers as

52052 – 25025 = 25025; also 57772 – 27775 = 27775.

Then when k = 6, we now can demonstrate 4 self-generating numbers in base 8.

So 525252 – 252525 = 252525; 577772 – 277775 = 277775; 572572 – 275275 = 275275 and 520025 – 250025 = 250025.

Likewise when k = 7, we can demonstrate 4 such numbers.

So 5720572 – 2750275 = 2750275; 5777772 – 2777775 = 2777775;

5200025 – 2500025 = 2500025 and 5257252 – 2527525 = 2527525 

So an interesting pattern is in evidence here.

When k = 2 or 3, we have 1 self-generating number i.e. 20

When k = 4 or 5, we have 2 self-generating numbers i.e. 21

When k = 6 or 7, we have 4 self-generating numbers i.e. 22

This implies that when k = 8 or 9, we have 8 self-generating number i.e. 23

And the 8 numbers when k = 8 are 25252525, 25025025, 25000025, 27777775, 27500275, 27752775, 27525275, 25277525

Thus in general terms for k or k + 1 digits,

 t = 2k/2 – 1 (where t = amount of self generating nos.)

 

Now we could make a further refinement by referring to such self-generating numbers as non-hierarchical (without reference to order of digits). Hierarchical by contrast requires that the digits are taken in ascending and descending scales of magnitude respectively.

In base 10, we do indeed have a good example of this latter hierarchical type with the number 495.

So when we arrange the digits is ascending order we get the number 459; then when we arrange the digits in descending order we get the number 954.

And 954 – 459 = 495

Then 6174 is a good example of a 4-digit hierarchical self-generating number in base 10.

So in ascending order of digits we get 1467; in descending order, we get 7641;

and 7641 – 1467 = 6174.

In fact we can use all 9 digits from 1 to 9 to define another hierarchical self-generating number (in base 10) i.e. 864197532 as

987654321 – 123456789 = 864197532.

And indeed we can also use all 10 digits from 0 to 9 to define yet another such number i.e. 9753086421 as

9876543210 – 0123456789 = 9753086421.

 

We could make yet another distinction in referring to all these self-generating numbers viewed so far as linear self-generating numbers, where the reverse of a number entails taking the digits - literally - in the opposite linear sequence.

However cyclic numbers, which arise in certain number bases as the decimal sequence of the reciprocals of primes, provide a fascinating alternative example of circular self-generating numbers.

So for example in base 10, the reciprocal of the prime number 7, i.e. 1/7

= .142857 …, where the 6 digits continually recur in the same circular sequence.

And in this - as in all cases of such cyclic numbers - the number of unique recurring digits is one less than the prime number in question so that when we multiply by 1, 2, 3, …, p – 1, the same circular sequence of digits is preserved.

So starting once again with the last digit, in circular terms the reverse of 142857 is 714857. So we have just moved one place here while maintaining the same circular sequence.

And 714857 – 142857 = 571428 (with the circular sequence thereby maintained).

A simpler example in base 8 is given by the reciprocal of 5, i.e. 1/5, with the four digits 1463 continually recurring in the decimal sequence;

3146 – 1463 = 1463.

 

Again the simplest example of such cyclic numbers is given by the reciprocal of 3 (in all relevant bases) where the number of repeating digits is 2.

Interestingly in the 2-digit case, there is no distinction between the different types of self generating numbers, as both linear and circular sequences (and also hierarchical and non-hierarchical) are necessarily the same.

And all the 2-digit sequences we have encountered in fact represent the unique repeating digits of the reciprocal of 3 in bases 2, 5, 8, 11, …

So in fact we can see here that the 1st number base in question, i.e. 2 = p – 1. And subsequent number bases are 2p – 1, 3p – 1, 4p – 1, … 

So for example in base 8, 1/3 is .25 (recurring) and 2/3 is .52 (recurring).

Thus the numbers based on these unique recurring digits are 25 and 52.

Comments

Popular posts from this blog

Fascinating Properties 2

Once again the 2-digit self-generating numbers correspond to the unique recurring digits in the decimal sequence for the reciprocal of 3 (i.e. 1/3). Confining ourselves initially to the positive number bases these correspond to kp – 1, where k = 1,2,3,…, so when p = 3 these therefore occur in the number bases 2, 5, 8, 11, 14, … And the first five of these numbers, as we have seen, are 01, 13, 25, 37 and 49. Now what is fascinating is that when we obtain the square of one of these numbers and subtract from it the corresponding square of the previous number, the result can always be expressed as the difference of two (of the positively defined) octagonal numbers. Why this property may appear surprising is that all these numbers can now refer to their common identity in base 10 terms, whereas previously they were each defined with respect to ever changing distinct number bases! So for example whereas 01 and 13 were previously defined with respect to base 2 and base 5 respectivel...

Fascinating Properties 3

Once again we will start with the table from the preceding entry. Diff of 2-digit squares   Square values Diff result Diff of Octagonal Nos, Diff of Ordinal Rankings 59 2 – 47 2 3481 – 2209 1272 4408 – 3136 .38 th – .32 nd 47 2 – 35 2 2209 – 1225 984 2760 – 1776 .30 th – .24 th 35 2 – 23 2 1225 – 529 696 1496 – 800 .22 nd – .16 th 23 2 – 11 2 529 – 121 408 616 – 208 .14 th   – .8 th 11 2 – 01 2 121– 1 120 120 –  0 .6 th – .0 th   13 2 – 01 2 169 – 1 168 176 –  8 8 th – 2 nd 25 2 – 13 2 625 – 169 456 736 –  280 16 th –...