In the following 6×6 array one can choose any k×k subarray with 1<k≤6 and add 1 to all its entries. Is it possible to perform the operation a finite number of times so that all the entries in the array are multiples of 3?
⎣⎢⎢⎢⎢⎢⎢⎡201010020110102010010210222220000000⎦⎥⎥⎥⎥⎥⎥⎤
How to do this question?
Please help. Thanks!
#NumberTheory
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Hint: Find an Invariant. What property must stay the same after any change?
Log in to reply
Update: My original idea failed to work.
I would be interested in a solution.
No, because following this Invariant principle we know that we will always have three different numbers x, x + 1 and x + 2. Since the differences between the numbers is 1 and 2, and not 3, this is not possible!
How about considering that we just need to make the whole array's elements 0 (mod 3), so we wrote 2 as -1? Well that help here? Sorry I'm not much of a helper :(