Math, asked by splendidsoccerplayer, 10 months ago

Let x1, x2, · · · , xn ∈ {0, 1}.
(a) Consider the equation x1 + x2 + · · · + xn = 0 mod 2. How many solutions
does this equation have? Express your answer in terms of n.
For example, if n = 2, x1 + x2 = 0 has 2 solutions: (x1, x2) = (0, 0) and (x1, x2) = (1, 1).

(b) Consider the equations
x1 + x2 + · · · + xn = 0 mod 2
x1 + x2 + · · · + x10 = 0 mod 2
for n ≥ 10.

How many solutions are there satisfying both equations?

Answers

Answered by samir4934
0

Step-by-step explanation:

Not sure about the answer!!!!

!!!Sorry!!!

Similar questions