Given a sequence 49, 4489. 444889, 44448889, ....., × 1 0 0 4 4 4 4 . . . 4 × 9 9 8 8 . . . 8 8 8 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!
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.
@Mark Hennings ,sir, how to write (×n-1) below 66...6667?
Log in to reply
The LaTeX command "\underbrace{12}_{23}" in Math mode gives 2 3 1 2 .
Here's an indirect attempt at the bonus.
Consider the number x = 3 2 + 3 0 0 0 1 . Let's find x 2 . Expanding, we have x 2 = 9 4 + 9 0 0 0 4 + 9 0 0 0 0 0 0 1 .
Now, consider the decimal expansions of these numbers.
x = 0 . 6 6 7 (note that the 3 0 0 0 1 term "rounds" the fraction off at 3 decimal places)
9 4 = 0 . 4 4 4 4 4 4 4 4 4 …
9 0 0 0 4 = 0 . 0 0 0 4 4 4 4 4 4 …
9 0 0 0 0 0 0 1 = 0 . 0 0 0 0 0 0 1 1 1 …
Summing these, x 2 = 0 . 4 4 4 8 8 9 , which proves the third number in the sequence is a square.
Exactly the same argument holds if we put x = 3 2 + 3 ⋅ 1 0 n 1 , and proves the n t h number in the sequence is a square for all n .
(In particular, all 1 0 0 of the numbers listed in the problem are squares.)
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.
Problem Loading...
Note Loading...
Set Loading...
Consider the n -digit number x n = × n − 1 6 6 6 ⋯ 6 7 (which contains n − 1 copies of 6 ). Then x n = 2 × × n 3 3 3 ⋯ 3 + 1 = 3 2 ( 1 0 n − 1 ) + 1 = 3 1 ( 2 × 1 0 n + 1 ) and so x n 2 = 9 1 [ 4 × 1 0 2 n + 4 × 1 0 n + 1 ] = 9 1 [ 4 ( 1 0 2 n − 1 ) + 4 ( 1 0 n − 1 ) + 9 ] = 9 4 ( 1 0 2 n − 1 ) + 9 4 ( 1 0 n − 1 ) + 1 Thus x n 2 is the number obtained by adding × 2 n 4 4 4 ⋯ 4 (with 2 n copies of 4 ) to × n 4 4 4 ⋯ 4 ( n copies of 4 this time), and then adding 1 . In other words x n 2 = × n 4 4 ⋯ 4 × n − 1 8 8 ⋯ 8 9 which is the n th number in this list.
This list consists of the numbers x 1 2 , x 2 2 , … , x 1 0 0 2 , and so there are 1 0 0 squares in the list.