For all positive integers $n$, $k$, let $f(n, 2k)$ be the number of ways an $n \times 2k$ board can be fully covered by $nk$ dominoes of size $2 \times 1$. (For example, $f(2, 2)=2$ and $f(3, 2)=3$.) Find all positive integers $n$ such that for every positive integer $k$, the number $f(n, 2k)$ is odd.
1. **Initial Definitions and Examples:**
   - We are given a function \( f(n, 2k) \) which represents the number of ways to cover an \( n \times 2k \) board with \( nk \) dominoes of size \( 2 \times 1 \).
   - Examples provided are \( f(2, 2) = 2 \) and \( f(3, 2) = 3 \).

2. **Claim 1: \( n \) must be odd.**
   - **Proof:**
     - Suppose \( n \) is even. Consider the \( n \times n \) board.
     - Reflect the board over the diagonal from the top-left to the bottom-right corner. This reflection maps each tiling to a unique different tiling.
     - Since each tiling has a unique mapping, the number of tilings must be even.
     - Therefore, if \( n \) is even, \( f(n, n) \) is even, contradicting the requirement that \( f(n, 2k) \) is odd for all \( k \).
     - Hence, \( n \) must be odd. \(\blacksquare\)

3. **Claim 2: If \( f(n, 2k) \) is odd for each \( k \), then \( f(2n+1, 2k) \) is odd for each \( k \).**
   - **Proof:**
     - Consider the \( (2n+1) \times 2k \) board.
     - If a tiling is not vertically symmetric, pair it with its horizontal reflection. This results in an even number of such tilings.
     - Therefore, we only need to consider vertically symmetric tilings.
     - The midline of the board must be vertically tiled, dividing the board into two \( n \times 2k \) boards.
     - The number of ways to tile these two \( n \times 2k \) boards is \( f(n, 2k)^2 \), which is odd since the square of an odd number is odd.
     - Thus, \( f(2n+1, 2k) \) is odd. \(\blacksquare\)

4. **Conclusion:**
   - If \( n \) is an odd number that is not of the form \( 2^i - 1 \), we can subtract 1 and then divide by 2 until we reach an even number, which contradicts the requirement that \( f(n, 2k) \) is odd for all \( k \).
   - Therefore, \( n \) must be of the form \( 2^i - 1 \) for some positive integer \( i \).

5. **Verification for \( n = 1 \):**
   - For \( n = 1 \), \( f(1, 2k) \) represents the number of ways to cover a \( 1 \times 2k \) board with \( k \) dominoes.
   - Clearly, there is only one way to do this, so \( f(1, 2k) = 1 \), which is odd.

The final answer is \( \boxed{ 2^i - 1 } \) for positive integers \( i \).