Self number

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 that other integer's 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 (sequence A003052 in OEIS)

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.

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.

Contents

Recurrent formula

The following recurrence relation generates some base 10 self numbers:

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

(with C1 = 9)

And for binary numbers:

C_k = 2^j + C_{k - 1} + 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 = (b - 2)b^{k - 1} + C_{k - 1} + (b - 2)\,

in which C1 = b − 1 for even bases and C1 = b − 2 for odd bases.

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

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, ... (sequence A006378 in OEIS)

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 S10(x) 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{ is self if }
[ n - DR*(n) - 9 \cdot i ] + SOD([ n - DR*(n) - 9 \cdot i ] ) \neq n
\quad \forall i \in 0 \ldots d(n)

Where:

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

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

SOD(n) is the sum of all digits in n

d(n) is the number of digits in n

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

The following table was calculated in 2007.

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

References

  • Kaprekar, D. R. The Mathematics of New Self-Numbers Devaiali (1963): 19 - 20.
  • R. B. Patel (1991). "Some Tests for k-Self Numbers". Math. Student 56: 206–210. 
  • B. Recaman (1974). "Problem E2408". Amer. Math. Monthly 81 (4): 407. doi:10.2307/2319017. 
  • Weisstein, Eric W., "Self Number" from MathWorld.

Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Self-descriptive number — A self descriptive number is an integer m that in a given base b is b digits long in which each digit d at position n (the most significant digit being at position 0 and the least significant at position b 1) counts how many instances of digit n… …   Wikipedia

  • Self-advocacy — refers to the civil rights movement for people with developmental disabilities , also called cognitive or intellectual disabilities, and other disabilities. It is also an important term in the disability rights movement, referring to people with… …   Wikipedia

  • Self-stabilization — is a concept of fault tolerance in distributed computing. Distributed computing systems are challenging to debug and analyze. As a result, strong properties (properties that hold under a variety of circumstances) of such systems are especially… …   Wikipedia

  • SELF-DEFENSE — (in modern Jewish history). Jewish efforts against attacking mobs in Russia and in Austria Hungary from the end of the 19th century until shortly after World War I. The nature of the pogroms in this period (especially in the years 1881–82,… …   Encyclopedia of Judaism

  • Self-Monitoring, Analysis, and Reporting Technology — Self Monitoring, Analysis, and Reporting Technology, or S.M.A.R.T. (sometimes written SMART), is a monitoring system for computer hard disks to detect and report on various indicators of reliability, in the hope of anticipating… …   Wikipedia

  • Self-concept — Self construction redirects here. For other uses, see Self construction (disambiguation). Not to be confused with Self awareness, Self consciousness, Self image, or Self perception. Contents 1 Overview 2 A Brief History 3 Academic Self …   Wikipedia

  • Self-incompatibility in plants — Self incompatibility (SI) is a general name for several genetic mechanisms in angiosperms, which prevent self fertilization and thus encourage outcrossing. In plants with SI, when a pollen grain produced in a plant reaches a stigma of the same… …   Wikipedia

  • Self-pulsation — takes place at the beginning of laser action.As the pump is switched on, the gainin the active medium rises and exceeds the steady state value. The number of photons in the cavity increases, depleting the gain below the steady state value, and so …   Wikipedia

  • Self-replication — is any process by which a thing might make a copy of itself. Biological cells, given suitable environments, reproduce by cell division. During cell division, DNA is replicated and can be transmitted to offspring during reproduction. Biological… …   Wikipedia

  • Self-publishing — is the publishing of books and other media by the authors of those works, rather than by established, third party publishers. Although it represents a small percentage of the publishing industry in terms of sales, it has been present in one form… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”