Tessellate S.T.E.M.S - Computer Science - College - Set 2 - Problem 5

Computer Science Level pending

A $f$ is said to be a linear function from $\{0,1\}^n$ to $\{0,1\}^n$ if $f(x) + f(y) = f(x+y)$ , where $+$ here denotes bit wise xor. i.e, if $n = 3$ and $x = (0,1,0)$ and $y = (1,1,0)$ , then $x + y= (0,1,1)$ .

How many linear functions $f$ are there for a fixed $n$ ?

This problem is a part of Tessellate S.T.E.M.S.

2^{n^2 + n}

2^{n\choose 2}

2^{n^2}

2^n

2^{2n^2}

0 solutions

No explanations have been posted yet. Check back later!

Tessellate S.T.E.M.S - Computer Science - College - Set 2 - Problem 5

0 solutions

0 pending reports