Related Searches
Definitions

# Self number

A self number, Colombian number or Devlali number is an integer which, in a given base, cannot be generated by any other integer added to the sum of its digits. For example, 21 is not a self number, since it can be generated by the sum of 15 and the digits comprising 15, that is, 21 = 15 + 1 + 5. No such sum will generate the integer 20, hence it is a self number. These numbers were first described in 1949 by the Indian mathematician D. R. Kaprekar.

The first few base 10 self numbers are

1, 3, 5, 7, 9, 20, 31, 42, 53, 64, 75, 86, 97, 108, 110, 121, 132, 143, 154, 165, 176, 187, 198, 209, 211, 222, 233, 244, 255, 266, 277, 288, 299, 310, 312, 323, 334, 345, 356, 367, 378, 389, 400, 411, 413, 424, 435, 446, 457, 468, 479, 490, 501, 512, 514, 525

In general, for even bases, all odd numbers below the base number are self numbers, since any number below such an odd number would have to also be a 1-digit number which when added to its digit would result in an even number. For odd bases, all odd numbers are self numbers.

The following recurrence relation generates base 10 self numbers:

$C_k = 8 cdot 10^\left\{k - 1\right\} + C_\left\{k - 1\right\} + 8$

(with C1 = 9)

And for binary numbers:

$C_k = 2^j + C_\left\{k - 1\right\} + 1,$

(where j stands for the number of digits) we can generalize a recurrence relation to generate self numbers in any base b:

$C_k = \left(b - 2\right)b^\left\{k - 1\right\} + C_\left\{k - 1\right\} + \left(b - 2\right),$

in which $C_1 = b-1$ for even bases and $C_1 = b-2$ for odd bases.

The existence of these recurrence relations shows that for any base there are infinitely many self numbers.

A search for self numbers can turn up self-descriptive numbers, which are similar to self numbers in being base-dependent, but quite different in definition and much fewer in frequency.

## Self primes

A self prime is a self number that is prime. The first few self primes are

3, 5, 7, 31, 53, 97, 211, 233, 277, 367, 389

In October 2006 Luke Pebody demonstrated that the largest known Mersenne prime that is at the same time a self number is 224036583-1. This is then the largest known self prime as of 2006.

## Selfness tests

### Reduction tests

Luke Pebody showed (Oct 2006) that a link can be made between the self property of a large number n and a low-order portion of that number, adjusted for digit sums:

a) In general, n is self if and only if m = R(n)+SOD(R(n))-SOD(n) is self

Where:

R(n) is the smallest rightmost digits of n, greater than 9.d(n)

d(n) is the number of digits in n

SOD(x) is the sum of digits of x, the function $S_\left\{10\right\}\left(x\right)$ from above.

b) If n = a.10^b+c, c<10^b, then n is self if and only if both {m1 & m2} are negative or self

Where:

m1 = c - SOD(a)

m2 = SOD(a-1)+9.b-(c+1)

c) For the simple case of a=1 & c=0 in the previous model (i.e. n=10^b), then n is self if and only if (9.b-1) is self

### Effective test

Kaprekar demonstrated that:

$n mbox\left\{ is self if \right\} \left[n - DR*\left(n\right) - 9 cdot i \right] + SOD\left(\left[n - DR*\left(n\right) - 9 cdot i \right] \right) neq n quad forall i in 0 ldots d\left(n\right)$

Where:

$DR*\left(n\right) = begin\left\{cases\right\} frac\left\{DR\left(n\right)\right\}\left\{2\right\}, & mbox\left\{if \right\} DR\left(n\right) mbox\left\{ is even\right\} frac\left\{DR\left(n\right) + 9\right\}\left\{2\right\}, & mbox\left\{if \right\} DR\left(n\right) mbox\left\{ is odd\right\} end\left\{cases\right\}$

begin\left\{align\right\} DR\left(n\right) &\left\{\right\}= begin\left\{cases\right\} 9, & mbox\left\{if \right\} SOD\left(n\right) mod 9 = 0 SOD\left(n\right) mod 9, & mbox\left\{ otherwise\right\} end\left\{cases\right\} &\left\{\right\}= \left(n - 1\right) mod 9 + 1 end\left\{align\right\}

$SOD\left(n\right) mbox\left\{ is the sum of all digits in \right\} n$

$d\left(n\right) mbox\left\{ is the number of digits in \right\} n$

## Excerpt from the table of bases where 2007 is self or Colombian

The following table was calculated in 2007.

BaseCertificateSum of digits
40$1959 = \left[1, 8, 39\right]_\left\{40\right\}$48
41--
42$1967 = \left[1, 4, 35\right]_\left\{42\right\}$40
43--
44$1971 = \left[1, 0, 35\right]_\left\{44\right\}$36
44$1928 = \left[43, 36\right]_\left\{44\right\}$79
45--
46$1926 = \left[41, 40\right]_\left\{46\right\}$81
47--
48--
49--
50$1959 = \left[39, 9\right]_\left\{50\right\}$48
51--
52$1947 = \left[37, 23\right]_\left\{52\right\}$60
53--
54$1931 = \left[35, 41\right]_\left\{54\right\}$76
55--
56$1966 = \left[35, 6\right]_\left\{56\right\}$41
57--
58$1944 = \left[33, 30\right]_\left\{58\right\}$63
59--
60$1918 = \left[31, 58\right]_\left\{60\right\}$89

## References

• Kaprekar, D. R. The Mathematics of New Self-Numbers Devaiali (1963): 19 - 20.
• Patel, R. B. "Some Tests for -Self Numbers" Math. Student 56 (1991): 206 - 210.
• B. Recaman, "Problem E2408" Amer. Math. Monthly 81 (1974): 407

Search another word or see selfnesson Dictionary | Thesaurus |Spanish