For integer values of k ≥ 0 , is the following expression an integer?
1 1 1 1 1 1 1 . . . 1 1 1 1 1 1 2 k ones 1 ÷ 1 0 0 0 . . . 0 0 0 k zeroes 1
Note: the left number has two ones that are not covered with the brace, making the total number of digits in the left number 2 k + 2 .
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.
Note that 1 1 1 ⋯ 1 1 2 k 1 = 1 1 ⋯ 1 1 2 k + 2 = 9 9 9 ⋯ 9 9 2 k + 2 = 9 1 0 2 k + 2 − 1 = 9 ( 1 0 k + 1 + 1 ) ( 1 0 k + 1 − 1 ) and
1 0 0 ⋯ 0 0 k 1 = 1 0 0 ⋯ 0 0 k + 1 + 1 = 1 0 k + 1 + 1
Thus the problem becomes
9 ( 1 0 k + 1 + 1 ) ( 1 0 k + 1 − 1 ) × 1 0 k + 1 + 1 1 = 9 1 0 k + 1 − 1
Noting the way the first term was decomposed, it can be easily deduced that
9 1 0 k + 1 − 1 = 1 1 ⋯ 1 1 k + 1
Hence, the result is always an integer
Sir, can you please post a solution for this: https://brilliant.org/problems/confusing-question-no-way-out/
Problem Loading...
Note Loading...
Set Loading...
Note the following expansions to be used later:
( 1 1 . . . 1 1 k = 1 0 k − 1 + 1 0 k − 2 + 1 0 k − 3 . . . + 1 0 0
1 0 0 . . . 0 0 k 1 = 1 × 1 0 k + 1
When k = 0 , the value of 1 1 ÷ 1 1 = 1 is an integer. Then, for integers k ≥ 1 :
1 0 0 . . . 0 0 k 1 × 1 1 . . . 1 1 k = 1 0 k × ( 1 0 k − 1 + . . . + 1 0 0 ) + 1 × ( 1 0 k − 1 + . . . + 1 0 0 ) = 1 0 2 k − 1 + 1 0 2 k − 2 + 1 0 2 k − 3 + . . . + 1 0 k + 1 0 k − 1 + 1 0 k − 2 + 1 0 k − 3 + . . . + 1 0 0 = 1 1 1 . . . 1 1 2 k 1
∴ 1 1 1 . . . 1 1 2 k 1 ÷ 1 0 0 . . . 0 0 k 1 = 1 1 . . . 1 1 k
Together, this proves that the value is an integer for all integer values of $k \geq 0$. The answer is always an integer .