Number of square numbers in the sequence?

Algebra Level 2

Given a sequence 49, 4489. 444889, 44448889, ....., 4444...4 × 100 88...888 × 99 9 \underbrace{4444...4}_{\times 100}\underbrace{88...888}_{\times 99}9

How many square numbers are there in this sequence?

Bonus: Bonus question gives a big hint to the answer (the hint is so big that you can instantly guess the answer), so I decided to post it with the solution!


The answer is 100.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

3 solutions

Mark Hennings
Mar 28, 2019

Consider the n n -digit number x n = 666 6 × n 1 7 x_n=\underbrace{666\cdots6}_{\times n-1}7 (which contains n 1 n-1 copies of 6 6 ). Then x n = 2 × 333 3 × n + 1 = 2 3 ( 1 0 n 1 ) + 1 = 1 3 ( 2 × 1 0 n + 1 ) x_n = 2 \times \underbrace{333\cdots3}_{\times n} + 1 = \tfrac23(10^n-1) + 1 = \tfrac13(2 \times 10^n + 1) and so x n 2 = 1 9 [ 4 × 1 0 2 n + 4 × 1 0 n + 1 ] = 1 9 [ 4 ( 1 0 2 n 1 ) + 4 ( 1 0 n 1 ) + 9 ] = 4 9 ( 1 0 2 n 1 ) + 4 9 ( 1 0 n 1 ) + 1 x_n^2 \; = \; \tfrac19\big[4 \times 10^{2n} + 4 \times 10^n + 1\big] \; = \; \tfrac19\big[4(10^{2n}-1) + 4(10^n-1) + 9\big] \; = \; \tfrac49(10^{2n}-1) + \tfrac49(10^n-1) + 1 Thus x n 2 x_n^2 is the number obtained by adding 444 4 × 2 n \underbrace{444\cdots4}_{\times 2n} (with 2 n 2n copies of 4 4 ) to 444 4 × n \underbrace{444\cdots4}_{\times n} ( n n copies of 4 4 this time), and then adding 1 1 . In other words x n 2 = 44 4 × n 88 8 × n 1 9 x_n^2 \; =\; \underbrace{44\cdots4}_{\times n}\underbrace{88\cdots8}_{\times n-1}9 which is the n n th number in this list.

This list consists of the numbers x 1 2 , x 2 2 , , x 100 2 x_1^2\,,\,x_2^2\,,\,\ldots\,,\,x_{100}^2 , and so there are 100 \boxed{100} squares in the list.

@Mark Hennings ,sir, how to write (×n-1) below 66...6667?

Mr. India - 2 years, 2 months ago

Log in to reply

The LaTeX command "\underbrace{12}_{23}" in Math mode gives 12 23 \underbrace{12}_{23} .

Mark Hennings - 2 years, 2 months ago

Log in to reply

t h a n k y o u s i r \underbrace{\underbrace{thank}_{you}}_{sir}

Mr. India - 2 years, 2 months ago
Chris Lewis
Mar 27, 2019

Here's an indirect attempt at the bonus.

Consider the number x = 2 3 + 1 3000 x=\frac{2}{3}+\frac{1}{3000} . Let's find x 2 x^2 . Expanding, we have x 2 = 4 9 + 4 9000 + 1 9000000 x^2=\frac{4}{9}+\frac{4}{9000}+\frac{1}{9000000} .

Now, consider the decimal expansions of these numbers.

x = 0.667 x=0.667 (note that the 1 3000 \frac{1}{3000} term "rounds" the fraction off at 3 3 decimal places)

4 9 = 0.444444444 \frac{4}{9}=0.444444444\ldots

4 9000 = 0.000444444 \frac{4}{9000}=0.000444444\ldots

1 9000000 = 0.000000111 \frac{1}{9000000}=0.000000111\ldots

Summing these, x 2 = 0.444889 x^2=0.444889 , which proves the third number in the sequence is a square.

Exactly the same argument holds if we put x = 2 3 + 1 3 1 0 n x=\frac{2}{3}+\frac{1}{3\cdot 10^n} , and proves the n t h n^{th} number in the sequence is a square for all n n .

(In particular, all 100 \boxed{100} of the numbers listed in the problem are squares.)

Tin Le
Mar 27, 2019

Bonus: Can you prove all numbers in that sequence (unlimited) are square numbers? In other word, prove 444...4488...889 (n fours, n-1 eights and 1 nine) is always a square number with n is a whole number.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...