How many perfect squares are there in the infinite set: { 1 1 6 1 , 1 1 1 5 6 1 , 1 1 1 1 5 5 6 1 , 1 1 1 1 1 5 5 5 6 1 , … , n + 1 1 1 1 ⋯ 1 n − 1 5 5 5 ⋯ 5 6 1 , … } This problem is part of the set Advent Calendar 2014 .
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.
As k approaches infinity, you can also say it approaches to becoming a perfect square as more zeros start appearing in the fractional part. Just something interesting I observed.
As 1 0 n ≡ ( − 1 ) n modulus 11, we have :
2 m 1 1 1 ⋯ 1 2 m − 2 5 5 5 ⋯ 5 6 1 ≡ ( − 1 + 1 − 1 ⋯ + 1 ) + ( − 5 + 5 − 5 ⋯ + 5 ) − 6 + 1 ≡ 6 modulus 11,
and
2 m + 1 1 1 1 ⋯ 1 2 m − 1 5 5 5 ⋯ 5 6 1 ≡ ( − 1 + 1 − 1 ⋯ − 1 ) + ( 5 − 5 ⋯ + 5 ) − 6 + 1 ≡ − 1 + 5 − 6 + 1 ≡ 1 0 modulus 11.
But no square is congruent to 6 or 10 modulus 11:
x ≡ | x 2 ≡ |
0 | 0 |
1 | 1 |
2 | 4 |
3 | 9 |
4 | 5 |
5 | 3 |
6 | 3 |
7 | 5 |
8 | 9 |
9 | 4 |
10 | 1 |
Problem Loading...
Note Loading...
Set Loading...
We prove that k 1 1 1 ⋯ 1 k − 2 5 5 5 ⋯ 5 5 6 is always a perfect square ( k ≥ 2 ).
We notice that it can be written in the form: 9 1 0 2 k − 1 + 4 × 9 1 0 k − 1 + 1 = 9 1 0 2 k − 1 + 4 × 1 0 k − 4 + 9 = 9 1 0 2 k + 4 × 1 0 k + 4 = ( 3 1 0 k + 2 ) 2 So it is a perfect square.
Also, 3 1 0 k + 2 ≥ 3 4 as it increases from k = 2 .
Now all the squares in the set are 5 more than these squares. But the next square numbers after these squares are always at least 3 4 + 3 5 after them. Hence no numbers in the set are perfect squares, and the answer is 0 as required.