Question
Question: The numbers 49, 4489, 444889 ... obtained by inserting 48 into the middle of the preceding square nu...
The numbers 49, 4489, 444889 ... obtained by inserting 48 into the middle of the preceding square numbers are square of integers.
Solution
Every n-digit number in decimal (base 10) is of the form an−1×10n−1+...+a1×101+a0×100 , where an−1,...,a1,a0 are some digits from 0 to 9.
Express the general n-digit number of the given type in terms of number of 4s, 8s, 9s and n.
Use the formula for the sum of a geometric series:
Sn=a(r−1rn−1) , where a is the first term, r is the common ratio and n is the number of terms.
Complete step-by-step answer:
The number formed using the given conditions will have an even number of digits.
Let us consider the 2n+2 digit number 444...8889.
There are half as many 4s and half as many 8s but one 9.
The number of 4s will be n+1 , 8s will be n and 9s will be just 1.
n+14444...44n888...8819
The number can be written in expanded form as:
4×(102n+1+102n+...+10n+1)+8×(10n+10n−1+...+101)+9×100
Since the sums of powers of 10 form a geometric series, we can write it as:
= 4×[10n+1(10−110n+1−1)]+8×[10(10−110n−1)]+9
Separating 91 as a common factor from all the terms, we get:
= 91[4×10n+1(10n+1−1)+8×10(10n−1)+81]
On multiplying the terms inside the bracket, we get:
= 91(4×102n+2−4×10n+1+8×10n+1−80+81)
Let us put 10n+1=x for easier writing, observation and manipulation.
= 91(4x2+4x+1)
= 91(2x+1)2
= (32x+1)2
= (32×10n+1+1)2
Since the expression 2×10n+1+1 is always divisible by 3 for any value of n (the sum of the digits is always 3), we can say that the given number is the square of an integer, for any positive integer value of n.
Hence proved.
Note: The expanded form of a number is more useful in solving equations as it clearly shows the mathematical relation between the individual numbers (digits).
e.g. A two-digit number can be written as 10x+y , which is a more usable form in equations.
The number formed by recurring decimals is the sum of an infinite series whose common ratio is of the form 10n1 .
There are many number bases (like binary, hexa-decimal, etc.) used in various applications, but base 10 is the most widely used form since ancient times, chiefly because we have 10 fingers to count.