0
$\begingroup$

Let $k<N$ and $P_1, ..., P_{2k+1}, \lambda_1, ..., \lambda_k$ be elements of a finite group $G$ of size $N$.

Find the minimum number of solution of the system

$$P_{2i} + P_{2i+1} = \lambda_i, \forall i\leq k$$

with the condition that the $P_1, ..., P_{2k+1}$ are pairwise distinct.

The law "+" on the $n-$bits strings is the "xor" ie we consider the n-bit strings as element of $(\mathbb{Z}/2\mathbb{Z})^n$.

$\endgroup$
2
  • $\begingroup$ How about fixing the typo(s) and motivating your question to convince the community that this is not a homework problem? $\endgroup$
    – Seva
    Commented Feb 11, 2013 at 14:35
  • $\begingroup$ I think this is just a fragment of a question -- significant parts of the text are missing. $\endgroup$
    – Stefan Kohl
    Commented Feb 11, 2013 at 19:42

0

You must log in to answer this question.