Problem #PRU-78150

Problems Combinatorics Painting problems Set theory and logic Algorithm Theory

Problem

There are two sets of numbers made up of 1s and \(-1\)s, and in each there are 2022 numbers. Prove that in some number of steps it is possible to turn the first set into the second one if for each step you are allowed to simultaneously change the sign of any 11 numbers of the starting set. (Two sets are considered the same if they have the same numbers in the same places.)