A set $M$ consists of $n$ elements. Find the greatest $k$ for which there is a collection of $k$ subsets of $M$ such that for any subsets $A_{1},...,A_{j}$ from the collection, there is an element belonging to an odd number of them
1. **Identify the Problem in Terms of Linear Algebra:**
   - Let \( M = \{1, 2, \ldots, n\} \).
   - Each subset \( A \) of \( M \) can be identified with a vector \( v = (x_1, x_2, \ldots, x_n) \) where \( x_i = 1 \) if \( i \in A \) and \( x_i = 0 \) otherwise.

2. **Define the Required Property:**
   - We need \( k \) subsets \( A_1, A_2, \ldots, A_k \) such that for any non-empty subset of these \( k \) subsets, there is an element belonging to an odd number of them.
   - In terms of vectors, this means that for any non-empty subset of the vectors \( v_1, v_2, \ldots, v_k \) corresponding to \( A_1, A_2, \ldots, A_k \), the sum (modulo 2) of the vectors in this subset is non-zero.

3. **Linear Independence Over \(\mathbb{Z}/2\mathbb{Z}\):**
   - The sum of vectors modulo 2 results in a zero in coordinate \( i \) if and only if \( i \) belongs to an even number of the sets in the sum.
   - Since there is always at least one \( i \) which belongs to an odd number of those sets, the sum is not the zero vector.
   - Therefore, the vectors \( v_1, v_2, \ldots, v_k \) must be linearly independent over the field \(\mathbb{Z}/2\mathbb{Z}\).

4. **Dimension Constraint:**
   - The vectors \( v_1, v_2, \ldots, v_k \) lie in \((\mathbb{Z}/2\mathbb{Z})^n\), which is a vector space of dimension \( n \).
   - Hence, the maximum number of linearly independent vectors in this space is \( n \).
   - Therefore, \( k \leq n \).

5. **Achieving \( k = n \):**
   - To achieve \( k = n \), consider the sets \( A_i = \{i\} \) for \( i = 1, 2, \ldots, n \).
   - Each set \( A_i \) corresponds to a vector with a 1 in the \( i \)-th position and 0 elsewhere.
   - These vectors are clearly linearly independent and satisfy the required property.

Conclusion:
\[
\boxed{k = n}
\]