Welcome to EverybodyWiki ! Nuvola apps kgpg.png Sign in or create an account to improve, watchlist or create an article like a company page or a bio (yours ?)...

Missing-digit sum

From EverybodyWiki Bios & Wiki
Jump to navigation Jump to search


In number theory, a -missing-digit sum in a given number base is a natural number that is equal to the sum of numbers created by deleting digits from the original number. For example, the OEIS lists these two integers as 1-missing-digit sums in base ten:

1,729,404 = 729404 (missing 1) + 129404 (missing 7) + 179404 (missing 2) + 172404 + 172904 + 172944 + 172940
1,800,000 = 800000 (missing 1) + 100000 (missing 8) + 180000 (missing first 0) + 180000 + 180000 + 180000 + 180000[1]

Definition[edit]

Let be a natural number. We recursively define the -missing-digit sum function for base to be the following:

where is the number of digits in the number in base .

A natural number is a -missing-digit sum if it is a fixed point for , which occurs if .

For example, the number 121 in base is a missing-digit sum with , because .

A natural number is a sociable missing-digit sum if it is a periodic point for , where for a positive integer , and forms a cycle of period . A missing-digit sum is a sociable missing-digit sum with , and a amicable missing-digit sum is a missing-digit sum with .

The number of iterations needed for to reach a fixed point is the missing-digit sum function's persistence of , and undefined if it never reaches a fixed point.

As a result of the recursive definition of the -missing-digit sum function, when digits are deleted from a -digit natural number, the number of natural numbers in the sum is equal to the binomial coefficient

.

For a given base , for every number , or n is a trivial missing-digit sum, defined below. This means that non-trivial missing-digit sums and cycles of only exist for .

Missing-digit sums for [edit]

b = k (trivial)[edit]

Let be a positive integer and the number base . Then for all integers :

  • is a trivial missing-digit-sum for for all , where the digits are and 0s.

b = 2k[edit]

Let be a positive integer and the number base . Then:

  • is a missing-digit-sum for for all , where the digits are , , and 0s.

Searching for missing-digit sums[edit]

Searching for 1-missing-digit sums is simplified when one notes that the final two digits of n determine the final digit of its missing-digit sum. One can therefore test simply the final two digits of a given n to determine whether or not it is a potential missing-digit sum. In this way, the search space is considerably reduced. For example, consider the set of seven-digit base-ten numbers ending in ...01. For these numbers, the final digit of the sum is equal to (digit-0 x 1 + digit-1 x 6) modulo 10 = (0 + 6) mod 10 = 6 mod 10 = 6. Therefore, no seven-digit number ending in ...01 is equal to its own missing-digit-sum in base ten.

Now consider the set of seven-digit base-ten numbers ending in ...04. For these numbers, the final digit of the sum is equal to (0 x 1 + 4 x 6) modulo 10 = (0 + 24) mod 10 = 24 mod 10 = 4. This set may therefore contain one or more missing-digit sums. Next consider seven-digit numbers ending ...404. The penultimate (last-but-one) digit of the sum is equal to (2 + 4 x 2 + 0 x 4) modulo 10 = (2 + 8 + 0) mod 10 = 10 mod 10 = 0 (where the 2 is the tens digit of 24 from the sum for the final digit). This set of numbers ending ...404 may therefore contain one or more missing-digit sums. Similar reasoning can be applied to sums in which two, three and more digits are deleted from the original number.

Missing-digit sums and cycles of Fm,b for specific m and b[edit]

All numbers are represented in base . This table is currently incomplete.

Missing-digit sums Cycles
1 2 100
1 3 112, 121, 1000, 2000
1 4 1200, 2223, 10000, 20000, 30000 1332→2121→2031→1332
1 5 33334, 100000, 200000, 300000, 400000
1 6 14000, 444445, 1000000, 2000000, 3000000, 4000000, 5000000
1 7 5555556, 10000000, 20000000, 30000000, 40000000, 50000000, 60000000
1 8 160000, 66666667, 100000000, 200000000, 300000000, 400000000, 500000000, 600000000, 700000000
1 9 777777778, 1000000000, 2000000000, 3000000000, 4000000000, 5000000000, 6000000000, 7000000000, 8000000000
1 10 1800000, 14358846, 14400000, 15000000, 28758846, 28800000, 29358846, 29400000, 1107488889, 1107489042, 1111088889, 1111089042, 3277800000, 3281400000, 4388888889, 4388889042, 4392488889, 4392489042, 4500000000,[2] 5607488889, 5607489042, 5611088889, 5611089042, 7777800000, 7781400000, 8888888889, 8888889042, 8892488889, 8892489042, 10000000000, 20000000000, 30000000000, 40000000000, 50000000000, 60000000000, 70000000000, 80000000000, 90000000000
1 11 9999999999A, 100000000000, 200000000000, 300000000000, 400000000000, 500000000000, 600000000000, 700000000000, 800000000000, 900000000000, A00000000000
1 12 1A000000, AAAAAAAAAAAB, 1000000000000, 2000000000000, 3000000000000, 4000000000000, 5000000000000, 6000000000000, 7000000000000, 8000000000000, 9000000000000, A000000000000, B000000000000
2 10 167564622641, 174977122641, 175543159858, 175543162247, 183477122641, 183518142444, 191500000000, 2779888721787, 2784986175699, 212148288981849, 212148288982006, 315131893491390, 321400000000000, 417586822240846, 417586822241003, 418112649991390, 424299754499265, 424341665637682, 526796569137682, 527322398999265, 533548288981849, 533548288982006, 636493411120423, 636531893491390, 642800000000000, 650000000000000, 738986822240846, 738986822241003, 739474144481849, 739474144482006, 739474144500000, 739512649991390, 745699754499265, 745741665637682, 746186822240846, 746186822241003, 751967555620423, 848722398999265, 849167555620423, 854948288981849, 854948288982006, 855396569137682, 862148288981849, 862148288982006, 957893411120423, 957931893491390, 965131893491390, 971400000000000
4 10 1523163197662495253514, 47989422298181591480943, 423579919359414921365511, 737978887988727574986738

Extension to negative integers[edit]

Missing-digit sums numbers can be extended to the negative integers by use of a signed-digit representation to represent each integer.

See also[edit]

  • Arithmetic dynamics
  • Dudeney number
  • Factorion
  • Happy number
  • Kaprekar number
  • Meertens number
  • Narcissistic number
  • Perfect digit-to-digit invariant
  • Perfect digital invariant
  • Sum-product number

References[edit]

  1. Jon Ayres. "Sequence A131639". Neil Sloane. Retrieved 10 March 2014.
  2. Jon Ayres. "Sequence A131639". Neil Sloane. Retrieved 10 March 2014.

External links[edit]

  • Miss This — missing-digit sums in base ten and other bases


This article "Missing-digit sum" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Missing-digit sum. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.


Compte Twitter EverybodyWiki Follow us on https://twitter.com/EverybodyWiki !

Farm-Fresh comment add.png You have to Sign in or create an account to comment this article !