A Missing Number in Decimal Expression

0
482

Abstract

When expressing rational numbers, fractional expressions are generally more efficient and convenient than decimal expressions in real-life applications. Thus, mathematicians have long sought to convert rational numbers expressed in decimal form into the corresponding fractional forms. However, numerous types of decimal expressions lack a known method of conversion into fractional form. This study aims to establish a method for converting a specific group of rational numbers from decimal to fractional form. Consider the decimal expression of 1/9^2, which is 0.\overline{012345679}. Interestingly, from the repetend, the digit 8 is missing from the ascending sequence from 0 to 9. Such type of rational number — where the repetend forms a sequence from 0 to 10^n-1 with exactly one missing digit — is the group of rational numbers to be generalized. This methodology was done through theoretical exploration of decimal expressions, utilizing geometric series and number theory. The process first began through generalizing rational numbers whose repeating decimal sequences have the missing digit 9\ldots8. Utilizing the result, generalization for all rational numbers with a repetend missing any single digit from 0 to 10^n-1 were done. Consequently, if one considers a decimal number whose repetend consists digits of (0\ldots0) to (9\ldots9) with one missing natural number k, the number can be represented as \frac{1}{(10^n-1)^2} + \frac{10^n(10^n-k-2)-1}{10^n(10^n-1)-1} \cdot \frac{10^n}{10^n-1}. Therefore, this generalization enables more efficient and precise usage of such rational numbers, helping data compression and computational efficiency. Also, the structured complexity of a missing digit holds practical value in fields such as cybersecurity and computational efficiency.

Keywords: rational number, decimal expression, fractional form, missing number

Introduction

Background

Every rational number can be expressed in both fractional and decimal forms. However, in many real-life applications, fractional forms are often more preferred. Unlike decimals, which can be lengthy and infinitely repeating, fractions offer a precise and exact representation. For instance, the lengthy decimal 0.\overline{142857} can be simply expressed as 1/7. Thus, fractional forms are preferred in pure mathematics for their clarity and ability to prevent complicated expressions, making it easier to manipulate algebraically. In computer science, while fractional forms provide accurate values, decimal expressions need to be rounded and cannot be stored exactly due to floating-point limitations. These small rounding errors lead to losses in precision and can be detrimental in fields like finance, engineering, and scientific simulations. The usage of fractional forms are also data-efficient. Instead of representing a rational number as a potentially lengthy decimal expansion, a fraction simply captures the same value using just two integers: a numerator and a denominator. This reduces the number of bits needed for storage and lowers the demand for memory allocation and processing time. This is especially important in systems that process large datasets, where performance and memory efficiency are critical. As a result, it has always been a goal for mathematicians to successfully convert every rational numbers in decimal forms to fractional forms.

The following are the conclusions mathematicians have reached1:

When a rational number is written in decimal form, it takes one of two possible expressions. The first type is when the length of the decimal expression is finite. For example, there is 1/40=0.025 or 1/160=0.00625. This case occurs when the denominator of the given rational number in irreducible form can only be divided by 2 or 5. Therefore, the fractional form for such decimal is expressed as

    \[r = \frac{n}{2^a \cdot 5^b}\]

This makes sense because every decimal expressions are based on base 10. Therefore, if the denominator of a fraction is a power of 10, its decimal representation will be finite in length. That is, when the given decimal expression is a_1.a_2a_3a_4\ldots a_{n-1}a_n, it can be converted to fractional form by

    \begin{align*} &a_1 + 10^{-1} \cdot a_2 + 10^{-2} \cdot a_3 + 10^{-3} \cdot a_4 + \cdots + 10^{-(n-2)} \cdot a_{n-1} + 10^{-(n-1)} \cdot a_n\end{align*}


    \begin{align*}\ &= \frac{10^{n-1} \cdot a_1 + 10^{n-2} \cdot a_2 + 10^{n-3} \cdot a_3 + 10^{n-4} \cdot a_4 + \cdots + 10^1 \cdot a_{n-1} + a_n}{10^{n-1}} \end{align*}

For further analysis, consider the rational number

    \[r = \frac{n}{2^a \cdot 5^b}\]


for some natural number n and non-negative integers a and b. Under this setting, there are three possible cases

1. If a = b, the result is r = \frac{n}{10^a}

ex. r = \frac{11}{2^2 \cdot 5^2} = \frac{11}{100} = 0.11

2. If a > b, 5^{a-b} is multiplied to both numerator and denominator to get r = \frac{n \cdot 5^{a-b}}{10^a}

ex. r = \frac{7}{2^5 \cdot 5^3} = \frac{7 \cdot 5^2}{2^5 \cdot 5^5} = \frac{175}{100000} = 0.00175

3. If a < b, 2^{b-a} is multiplied to both numerator and denominator to get r = \frac{n \cdot 2^{b-a}}{10^b}

ex. r = \frac{13}{2^2 \cdot 5^3} = \frac{13 \cdot 2}{2^3 \cdot 5^3} = \frac{26}{1000} = 0.026

The second type is when the length of the decimal expression of the rational number is infinite. This happens when the denominator of the given rational number in irreducible form can be divided by a prime number other than 2 or 5. Thus, the given rational number is expressed as

    \[r = \frac{n}{p \cdot 2^a \cdot 5^b}\]


for some natural number n, non-negative integers a and b, and natural number p coprime to 10.

ex.

    \begin{align*} r &= \frac{11}{7 \cdot 2^3 \cdot 5^1} = 0.039\overline{285714}\ r &= \frac{13}{3 \cdot 2^2 \cdot 5^3}\end{align*}


    \begin{align*}= 0.008\overline{6}\ r &= \frac{17}{13 \cdot 2^5 \cdot 5^2} = 0.00163\overline{461538} \end{align*}

One key feature of the decimal expression of such rational numbers is that it contains a periodic part. For example, 1/9=0.111111\ldots has 1′ as the repeating part, and 13/99=0.1313131313\ldots has13′ as the repeating part.

To demonstrate this periodicity, the understanding of the following equation is necessary:

    \begin{equation*}0.\overline{0\ldots01} = \frac{1}{10^n-1}\end{equation*}


where the periodic part contains n-1 zeros

This equation is proven by the formula of the sum of geometric series2. Since the initial term is 10^{-n} and the common ratio is also 10^{-n}, the following formula can be used:

    \[a + ar + ar^2 + \cdots = \frac{a}{1-r}\]

where a is the initial term and r is the common ratio to get

    \[0.\overline{0\ldots01} = 10^{-n} + 10^{-2n} + \cdots = \frac{10^{-n}}{1-10^{-n}} = \frac{1}{10^n-1}\]

Having proven (1), consider any natural number p which cannot be divided by neither 2 nor 5. Then, there exists an integer m such that pm = 10^n-1 for some natural number n. This is proven by the Euler theorem. From the Euler theorem3,4, 10^{\phi(p)} \equiv 1 \pmod{p}, since p and 10 has no common divisor. Now, take n = \phi(p) and m = \frac{10^{\phi(p)}-1}{p}.

Next, let any rational number of the second type to be referred as r = \frac{q}{p \cdot 2^a \cdot 5^b}. To make the denominator some kind of form of 10^a, multiply some number k to both numerator and denominator and have r = \frac{qk}{p \cdot 10^l} for some natural numbers p,q,k,l. Then, multiple m to both numerator and denominator to get r = \frac{qkm}{(10^n-1) \cdot 10^l}. As the objective is to prove the periodicity of the decimal expression, 10^l will be ignored since it translates the decimals. Therefore, it needs to be proven that 10^l r = \frac{qkm}{10^n-1} has a periodic part. If qkm < 10^n-1, no additional step is needed, but if qkm \geq 10^n-1, subtract some integer c to make 10^l r - c = \frac{d}{10^n-1} for some 0 < d < 10^{n-1}. Because the number of digits in d is less than or equal to n, d can be expressed as d = \overline{e_1e_2e_3\ldots e_n} (some e_k can be zero). Finally, using \frac{1}{10^n-1} = 0.\overline{0\ldots01}, \frac{d}{10^n-1} = 0.\overline{e_1e_2\ldots e_n} can be concluded, successfully proving the infinite periodicity of the expression.

Consequently, these two different types of rational numbers can be summarized as the following:

Let r = \frac{p}{q} be a rational number where p and q are relatively prime natural numbers. If the prime factor of q is only 2 or 5, then the decimal expression of r is finite. If not, the decimal expression of r is infinite and has periodicity.

Purpose

In the case of the second type of rational number, expressed as r = \frac{n}{p \cdot 2^a \cdot 5^b}, there are significant limitations to its generalization. Since p can be any prime number other than 2 or 5, the scope of rational numbers that fall under this form is extremely broad. Therefore, it is necessary to further divide this category into subgroups and develop alternative fractional representations for each group of rational numbers. Through finding a generalized fractional representation for each subgroup, it would be easier to convert complex decimal expressions back into fractions which will aid in diverse fields like computer science. Consequently, this research paper aims to generalize a fractional representation for a specific subgroup of rational numbers — those whose decimal expressions exhibit a missing number between consecutive numbers 0 through 10^n-1 in their repetend. This will be discussed in detail in 1.3 Objectives.

Objective/Methodology

Now, consider following decimal expressions.

    \begin{align*} 0.\overline{012345679} &= \frac{1}{9 \cdot 9}\ 0.\overline{0001020304\ldots969799} &= \frac{1}{99 \cdot 99}\end{align*}


    \begin{align*}0.\overline{000001002003004\ldots996997999} &= \frac{1}{999 \cdot 999} \end{align*}

In each of the repetends of the decimal expressions, respectively, number 8, 98, and 998 are missing, but other non-negative integers less than 10, 100, 1000 are present. In fact, all numbers except for 9\ldots8 are arranged in increasing order.

Such rational number is expressed as

    \[r = 0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(9\ldots6)(9\ldots7)(9\ldots9)}\]

which will be generalized in Section 2 first.

It is important to note that Section 2 provides a generalization only for decimal expressions whose missing digit is 10^n-2 (i.e. 9\ldots8). However, the ultimate goal of this study is to generalize decimal expressions whose repetend forms a sequence of consecutive numbers from 0 to 10^n-1 in increasing order, with any single digit missing. Therefore, in Section 3, utilizing the result from Section 2, the generalization for cases where the missing digit is 0 and where it is 10^n-1 (i.e. 9\ldots9) will be done. Then, these cases serve as the foundation for the final generalization of decimal expression

    \[0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(0\ldots(k-1))(0\ldots(k+1))\ldots(9\ldots8)(9\ldots9)}\]

with positive integer k that encompasses all decimal expressions with any single missing digit from 0 to 10^n-1.

Decimal expression with missing digit 10^n-2

This section presents a generalization of the rational number r = 0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(9\ldots6)(9\ldots7)(9\ldots9)}, a class of repeating decimals in which the repetend consists of a consecutive sequence of numbers from 0 to 10^n-1, except for 10^n-2 (i.e. 9\ldots8).

To make some generalization, first observe the three simplest cases which are:

    \begin{align*} 0.\overline{012345679} &= \frac{1}{9 \cdot 9}\ 0.\overline{0001020304\ldots969799} &= \frac{1}{99 \cdot 99}\end{align*}


    \begin{align*}0.\overline{000001002003004\ldots996997999} &= \frac{1}{999 \cdot 999} \end{align*}

Such observation gives the following assumption:

Theorem

There is a decimal number whose repetend of the decimal expression is the sequence of consecutive numbers from 0 to 10^n-1 except for 10^n-2, where each number is written in n-digit numbers. For instance, 0 is written as 00\ldots000 (n zeros), 1 is written as 00\ldots01 (n-1 zeros), and 11 is written as 00\ldots011 (n-2 zeros). It is expressed as

    \[0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots9)}\]

The generalization of this rational number into fractional form is \frac{1}{(10^n-1) \cdot (10^n-1)}.

(Proof of Theorem)

The goal is to prove

    \[\frac{1}{(10^n-1) \cdot (10^n-1)} = 0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots9)}\]

First, analysis of the three simplest cases provides an insight.

From \frac{1}{9 \cdot 9} = 0.\overline{012345679}, the following equation can be derived:

    \[\frac{10}{9 \cdot 9} - \frac{1}{9 \cdot 9} = 0.\overline{123456790} - 0.\overline{012345679} = 0.\overline{111111111} = 0.\overline{1}\]

Similarly, from \frac{1}{99 \cdot 99} and \frac{1}{999 \cdot 999}, it derives

    \begin{align*} \frac{100}{99 \cdot 99} - \frac{1}{99 \cdot 99} &= 0.\overline{010203\ldots96979900} - 0.\overline{00010203\ldots969799} = 0.\overline{01}\ \frac{1000}{999 \cdot 999} - \frac{1}{999 \cdot 999} \end{align*}


    \begin{align*}&= 0.\overline{001002003\ldots997999000} - 0.\overline{000001002\ldots997999} = 0.\overline{001} \end{align*}

Such equation made by the three cases above now needs to be generalized to all n‘s.

Let A_n = 0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots9)}. From the insight given by the three previous examples, multiply 10^n to A_n to get

    \[10^n A_n = 0.\overline{(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots9)(0\ldots0)}\]

Then, the difference between 10^n A_n and A_n can be written as

    \[(10^n-1) A_n = 0.\overline{(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots9)(0\ldots0)}\]


    \[- 0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots9)}\]

which can be simplified as

    \[[(10^n-1) A_n = 0.\overline{(0\ldots1)(0\ldots1)\ldots(0\ldots1)(0\ldots2)(0\ldots0)}]\]

    \[[- 0.\overline{(0\ldots0)(0\ldots0)(0\ldots0)\ldots(0\ldots0)(9\ldots9)}]\]

Again, it can be further simplified to

    \begin{align*} (10^n-1) A_n &= 0.\overline{(0\ldots1)(0\ldots1)\ldots(0\ldots1)} = 0.\overline{(0\ldots1)} \end{align*}


    \begin{align*}= \frac{1}{10^n-1}\ \therefore A_n &= \frac{1}{(10^n-1)^2} \end{align*}

This is the generalization for a decimal expression with missing number 10^n-2.

Ex) When n = 5,

    \[(10^5-1) A_n = 0.\overline{000010000200003\ldots999979999900000}\]


    \[- 0.\overline{000000000100002\ldots999969999799999}\]


    \[= 0.\overline{0000100001\ldots000010000200000} -\]


    \[0.\overline{0000000000\ldots0000000009}\]


    \[= 0.\overline{00001} = \frac{1}{10^5-1}\]


therefore

    \[A_1 = \frac{1}{(10^5-1)^2}\]

Ex) When n = 6,

    \[(10^6-1) A_6 = 0.\overline{000001000002\ldots999997999999000000}\]


    \[- 0.\overline{000000000001000002\ldots999996999997999999}\]


    \[= 0.\overline{000001000001\ldots000001000002000000}\]


    \[- 0.\overline{000000000000\ldots000000000000999999}\]


    \[= 0.\overline{000001} = \frac{1}{10^6-1}\]


therefore

    \[A_6 = \frac{1}{(10^6-1)^2}\]

Further analysis gives an interesting insight.

A_n has the length of the periodic part denoted as n \cdot (10^n-1) because there are `10^n-1‘ numbers written down with each number represented using the n-digit format. Thus, it can be expressed as

    \[[A_n = \frac{(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots9)}{10^{n(10^n-1)}-1} = \frac{1}{(10^n-1)^2}]\]

through multiplying 10^{n(10^n-1)}-1 to both sides,

    \[[\frac{10^{n(10^n-1)}-1}{(10^n-1)^2} = (0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots9)]\]

One interesting property of the above quality is that the left hand side is an integer. This means that 10^{n(10^n-1)}-1 can be divided by (10^n-1)^2. Then, the explicit formulation of the division can be written as the right hand side which has a complex structure.

Ex) When n = 1

    \[[\frac{10^{1 \cdot 9}-1}{(10^1-1)^2} = \frac{10^9-1}{81} = 12345679]\]

Ex) When n = 3

    \[[\frac{10^{3 \cdot 999}-1}{(10^3-1)^2} = \frac{10^{2997}-1}{998001} = 1002003004005\ldots996997999]\]

Generalization of decimal expression with any missing digit

In this part, first, generalization of decimal numbers with missing digits 10^n-1 and 0 will take place. This is done to show how the result from Section 2 can aid in constructing generalization of decimal expressions with other missing digits. Then, final generalization of decimal numbers with any missing digit from 0 to 10^n-1 will be done.

Missing 10^n-1 = (9\ldots9)

This case is when the missing number is 10^n-1. Such decimal expression can be written as follows:

    \[[0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots8)}]\]

To find the corresponding fractional form for such rational number, the following equation takes place:

    \[0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots8)}\]


    \[= 0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots9)}\]


    \[- 0.\overline{(0\ldots0)(0\ldots0)(0\ldots0)\ldots(0\ldots0)(0\ldots1)}\]


    \[= \frac{1}{(10^n-1)^2} - \frac{1}{10^{n(10^n-1)}-1}\]

    \[\therefore 0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots8)} =\]


    \[\frac{1}{(10^n-1)^2} - \frac{1}{10^{n(10^n-1)}-1}\]

Ex) When the missing number is 9,

    \[0.\overline{012345678} = 0.\overline{012345679} - 0.\overline{000000001}\]


    \[= \frac{1}{(10^1-1)^2} - \frac{1}{10^{1 \cdot (10^1-1)}-1} = \frac{1}{81} - \frac{1}{10^9-1}\]

Ex) When the missing number is 999,

    \[0.\overline{000001002003\ldots996997998} =\]


    \[0.\overline{000001002003\ldots997999} -\]


    \[0.\overline{000000000\ldots000001}\]


    \[= \frac{1}{(10^3-1)^2} - \frac{1}{10^{3 \cdot (10^3-1)}-1} = \frac{1}{998001} - \frac{1}{10^{2997}-1}\]

Missing zero = (0\ldots0)

This case is when the missing number is 0. Such decimal expression can be written as follows:

    \[[0.\overline{(0\ldots1)(0\ldots2)(0\ldots3)\ldots(9\ldots8)(9\ldots9)}]\]

To find the corresponding fractional form for such rational number, the following steps takes place.

First, multiply 10^n to \frac{1}{(10^n-1) \cdot (10^n-1)} = 0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots9)} and get

    \[\frac{10^n}{(10^n-1) \cdot (10^n-1)} = 0.\overline{(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots9)(0\ldots0)}\]

Next, the following equation takes place:

    \[0.\overline{(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots8)(9\ldots9)}\]


    \[= 0.\overline{(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots9)(0\ldots0)}\]


    \[- 0.\overline{(0\ldots0)(0\ldots0)(0\ldots0)\ldots(0\ldots0)(0\ldots1)}\]

Consequently,

    \[\therefore 0.\overline{(0\ldots1)(0\ldots2)\ldots(9\ldots7)(9\ldots8)(9\ldots9)}\]


    \[= \frac{10^n}{(10^n-1)^2} - \frac{1}{10^{n(10^n-1)}-1}\]

Ex) When the missing number is `0′,

    \begin{align*} 0.\overline{123456789} &= 0.\overline{123456790} - 0.\overline{000000001}\ &= 10^1 \times 0.\overline{012345679} - 0.\overline{000000001}\ &= \frac{10^1}{(10^1-1)^2} - \frac{1}{10^{1 \times (10^1-1)}-1}\ &= \frac{10}{81} - \frac{1}{10^9-1} \end{align*}

Ex) When the missing number is `000′,

    \[0.\overline{001002003\ldots997998999} = 0.\overline{001002003\ldots997999000}\]


    \[- 0.\overline{000000000\ldots000000001}= 10^3 \times 0.\overline{000001002\ldots996997999}\]


    \[- 0.\overline{000000000\ldots000000001}\]


    \[= \frac{10^3}{(10^3-1)^2} - \frac{1}{10^{3 \times (10^3-1)}-1}\]


    \[= \frac{1000}{998001} - \frac{1}{10^{2997}-1}\]

General case

In this case, generalization will occur for every single missing number. Specifically, consider a missing non-negative integer k, where 0 \leq k \leq 9\ldots9 = 10^n-1. Such decimal expression can be written as follows:

    \[[0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(0\ldots(k-1))(0\ldots(k+1))\ldots(9\ldots8)(9\ldots9)}]\]

To find the corresponding fractional form for such rational form, the following steps takes place:

First, take the decimal expression of \frac{1}{(10^n-1)^2}. As k is the missing number, add 1 to all numbers m in the decimal expression of \frac{1}{(10^n-1)^2}, where k \leq m \leq 10^n-2. This can be represented as follows:

    \begin{align*} &0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(0\ldots(k-1))(0\ldots(k+1))\ldots(9\ldots8)(9\ldots9)}\end{align*}


    \begin{align*}&= 0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(0\ldots(k-1))(0\ldots k)\ldots(9\ldots7)(9\ldots9)}\end{align*}


    \begin{align*}&\quad + 0.\overline{(0\ldots0)(0\ldots0)(0\ldots0)\ldots(0\ldots 0)(0\ldots 1)\ldots(0\ldots1)(0\ldots0)} \end{align*}

In this representation, the first addend is \frac{1}{(10^n-1)^2}. The second addend is \frac{10^n + 10^{2n} + \cdots + 10^{n(10^n-k-2)}}{10^{n(10^n-1)}-1}. To elaborate further about the second addend, for 10^{n(10^n-1)}-1, n(10^n-1) represents the number of digits in the repetend. For 10^{n(10^n-k-2)}, 10^{2n}, 10^n, it represents the leftmost 1 in the second addend, the second-to-rightmost 1 in the second addend, and the rightmost 1 in the second addend, respectively.

Therefore, it can be written in the following:

    \begin{align*} &0.\overline{(0\ldots0)(0\ldots1)(0\ldots2)\ldots(0\ldots(k-1))(0\ldots(k+1))\ldots(9\ldots8)(9\ldots9)}\end{align*}


    \begin{align*}&= \frac{1}{(10^n-1)^2} + \frac{10^n + 10^{2n} + \cdots + 10^{n(10^n-k-2)}}{10^{n(10^n-1)}-1} \end{align*}

Through using the sum of geometric series, it can be further simplified as

    \begin{equation*}\therefore \frac{1}{(10^n-1)^2} + \frac{10^{n(10^n-k-2)}-1}{10^{n(10^n-1)}-1} \times \frac{10^n}{10^n-1}\end{equation*}

Ex) When the missing number is `4′,

    \[0.\overline{012356789}= 0.\overline{012345679} + 0.\overline{000011110}\]


    \[= \frac{1}{(10^1-1)^2} + \frac{10^{1 \times (10^1-4-2)}-1}{10^{1 \times (10^1-1)}-1} \times \frac{10^1}{10^1-1}\]


    \[= \frac{1}{81} + \frac{10^4-1}{10^9-1} \times \frac{10}{9}\= \frac{1}{81} + \frac{99990}{9 \times (10^9-1)}\]

Ex) When the missing number is `541′,

    \[0.\overline{000001002\ldots540542\ldots998999}\]


    \[= 0.\overline{000001002\ldots540541\ldots997999}\]


    \[+ 0.\overline{000000000\ldots000001\ldots001000}\]


    \[= \frac{1}{(10^3-1)^2} + \frac{10^{3 \times (10^3-541-2)}-1}{10^{3 \times (10^3-1)}-1} \times \frac{10^3}{10^3-1}\]


    \[= \frac{1}{998001} + \frac{10^{3 \times 457}-1}{10^{3 \times 999}-1} \times \frac{1000}{999}\]


    \[= \frac{1}{998001} + \frac{10^{1374}-1000}{999 \times (10^{2997}-1)}\]

As a matter of fact, this generalization also works when k = 10^n-2, k = 10^n-1, and k = 0 which was introduced in previous sections.

When k = 10^n-2, using the generalized formula from (2), the same equation from Section 2 derives.

    \[\frac{1}{(10^n-1)^2} + \frac{10^{n(10^n-(10^n-2)-2)}-1}{10^{n(10^n-1)}-1} \times \frac{10^n}{10^n-1}\]


    \[= \frac{1}{(10^n-1)^2} + \frac{10^{n \times 0}-1}{10^{n(10^n-1)}-1} \times \frac{10^n}{10^n-1}\]


    \[= \frac{1}{(10^n-1)^2} + \frac{0}{10^{n(10^n-1)}-1} \times \frac{10^n}{10^n-1}\]


    \[= \frac{1}{(10^n-1)^2}\]

When k = 10^n-1, using the generalized formula from (2), the same equation from Section 3.1 derives.

    \[\frac{1}{(10^n-1)^2} + \frac{10^{n(10^n-(10^n-1)-2)}-1}{10^{n(10^n-1)}-1} \times \frac{10^n}{10^n-1}\]


    \[= \frac{1}{(10^n-1)^2} + \frac{10^{-n}-1}{10^{n(10^n-1)}-1} \times \frac{10^n}{10^n-1}\]


    \[= \frac{1}{(10^n-1)^2} + \frac{1-10^n}{10^{n(10^n-1)}-1} \times \frac{1}{10^n-1}\]


    \[= \frac{1}{(10^n-1)^2} + \frac{(-1)}{10^{n(10^n-1)}-1}\]


    \[= \frac{1}{(10^n-1)^2} - \frac{1}{10^{n(10^n-1)}-1}\]

When k = 0, using the generalized formula from (2), the same equation from Section 3.2 derives.

    \[\frac{1}{(10^n-1)^2} + \frac{10^{n(10^n-0-2)}-1}{10^{n(10^n-1)}-1} \times \frac{10^n}{10^n-1}\]


    \[= \frac{1}{(10^n-1)^2} + \frac{10^{n(10^n-2)}-1}{10^{n(10^n-1)}-1} \times \frac{10^n}{10^n-1}\]


    \[= \frac{1}{(10^n-1)^2} + \frac{10^{n(10^n-1)}-10^n}{10^{n(10^n-1)}-1} \times \frac{1}{10^n-1}\]


    \[= \frac{1}{(10^n-1)^2} + \left(1 - \frac{10^n-1}{10^{n(10^n-1)}-1}\right) \times \frac{1}{10^n-1}\]


    \[= \frac{1}{(10^n-1)^2} + \frac{1}{10^n-1} - \frac{1}{10^{n(10^n-1)}-1}\]


    \[= \frac{1}{(10^n-1)^2} + \frac{10^n-1}{(10^n-1)^2} - \frac{1}{10^{n(10^n-1)}-1}\]


    \[= \frac{10^n}{(10^n-1)^2} - \frac{1}{10^{n(10^n-1)}-1}\]

Consequently, the generalized equation is correct.
For further analysis, to obtain the decimal part for such rational number, one needs to multiply 10^{(10^n-1)}-1 to the generalized format so that it eliminates the decimal. This can be represented as follows:

    \[(10^{n(10^n-1)}-1) \cdot \left(\frac{1}{(10^n-1)^2} + \frac{10^{n(10^n-k-2)}-1}{10^{n(10^n-1)}-1} \cdot \frac{10^n}{10^n-1}\right)\]


    \[= \frac{10^{n(10^n-1)}-1}{(10^n-1)^2} + \frac{10^{n(10^n-k-1)}-10^n}{10^n-1}\]


    \[= \frac{10^{n(10^n-1)} + 10^{n(10^n-k)} - 10^{n(10^n-k-1)} - 10^{2n} + 10^n - 1}{(10^n-1)^2}\]

Ex) When `5′ is the missing number,

    \[\frac{10^{1 \times (10^1-1)} + 10^{1 \times (10^1-5)} - 10^{1 \times (10^1-5-1)} - 10^2 + 10^1 - 1}{(10^1-1)^2}\]


    \[= \frac{10^9 + 10^5 - 10^4 - 10^2 + 10 - 1}{81} = 12346789\]

Ex) When `333′ is the missing number,

    \[\frac{10^{3 \times (10^3-1)} + 10^{3 \times (10^3-333)} - 10^{3 \times (10^3-333-1)} - 10^6 + 10^3 - 1}{(10^3-1)^2}\]


    \[= \frac{10^{2997} + 10^{2001} - 10^{1998} - 10^6 + 10^3 - 1}{998001}\]


    \[= 1002003\ldots332334\ldots998999\]

This is one of the interesting corollary of the result.

Real-life applications

This study presents two key characteristics that provides area for real-life applications. The first characteristic is clarity and efficiency. By generalizing a specific group of complex decimal expressions, this research paper offers a method to represent such numbers in a more concise and precise form. This simplification allows shorter and simpler equations, making it easier to manipulate algebraically. It also improves data efficiency through minimizing the number of bits required and reducing processing time. Moreover, this clarity helps mitigate errors caused by floating-point limitations in computers, thereby ensuring great accuracy when applied in other fields like finance. Another usage due to clarity lies on encoding. The repeating decimal pattern can be used to encode information in a non-obvious way. For instance, the missing number in the repetend could represent a specific message. Anyone familiar with the system and its generalization could easily decode the value, aiding in digital communication. The second characteristic is complexity. The concept of omitting a single digit from the repetend within a consecutive sequence of numbers from 0 to 10^n-1 generates a wide range of complicated decimal expressions. Therefore, this provides real-life applications in cybersecurity. However, such usage has limitations in terms of security as these rational number isn’t fully secure by itself. Even if the decimal expression looks complex, this rational number can be determined by a simple generalization. However, when integrated into a larger system, it proves highly useful. One example is obfuscation which is about hiding information so that even if someone sees it, they won’t know what it means. For instance, from such rational number, if a certain digit is missing, that could potentially represent a secret piece of information. Through combining it with random positions and numbers, it increases the confidentiality of the information. It can be used in contexts like steganographic communications where political dissidents, journalists, and military units need to send secret messages. Another example is the generation of secure passwords. Due to its complex structure, it is still hard to reverse-engineer the password. Also, the complexity of the decimal expression adds another barrier to brute-force attacks. This would ultimately help people protect their private information from attackers.

Conclusion

Study of rational numbers with decimal representations missing a single digit from a consecutive sequence of numbers from 0 to 10^n-1 have been done. At first, conversion of the rational number with the missing digit 10^n-2 (i.e., 9\ldots8) to fractional form was done and was expressed in simple form (Section 2). Next, using the result from Section 2, the conversion of rational number with any missing digit was finalized. Specifically, the number could’ve been converted to the fractional form [\frac{1}{(10^n-1)^2} + \frac{10^{n(10^n-k-2)}-1}{10^{n(10^n-1)}-1} \times \frac{10^n}{10^n-1}] when k is the missing digit. Also, as a corollary, the way to express the repetend which consists of (0\ldots0) to (9\ldots9) without k was shown. This was expressed as [\frac{10^{n(10^n-1)} + 10^{n(10^n-k)} - 10^{n(10^n-k-1)} - 10^{2n} + 10^n - 1}{(10^n-1)^2}] The results from this study provides benefits in areas like cybersecurity, computational efficiency, digital communication, and pure mathematics. Further improvement could lie on the generalization of more complex decimal expressions such as the case when there are at least two missing digits. Generalizing more complex decimal representations could further enhance benefits in computational efficiency and cybersecurity. Nevertheless, this study provides significant value in mathematics that can lead to real-world innovation.

References

  1. Y. I. Manin, A. A.  Panchishkin. Introduction to Modern Number Theory: Fundamental Problems, Ideas and Theories. Springer Berlin Heidelberg (2005). []
  2. Mathematics LibreTexts, 24: The geometric series. https://math.libretexts.org/Bookshelves/Precalculus/Precalculus_(Tradler_and_Carley)/24%3A_The_Geometric_Series (2020). []
  3. K. C.  Chowdhury, A First Course in Theory of Numbers. (2007). []
  4. L. K. Hua, Introduction to Number Theory. Springer Science & Business Media(2012). []

LEAVE A REPLY

Please enter your comment!
Please enter your name here