I have A
(up to 10^6) in the set. I need to find in how many ways can I remove a subset, the size of which is a multiple of a given K
(0<k<11) - K, 2K, 3K, etc. So that the XOR of what remains is 0.
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.Sign up to join this community