Say that an integer $n \ge 2$ is [i]delicious[/i] if there exist $n$ positive integers adding up to 2014 that have distinct remainders when divided by $n$.  What is the smallest delicious integer?
1. We need to find the smallest integer \( n \ge 2 \) such that there exist \( n \) positive integers adding up to 2014, and these integers have distinct remainders when divided by \( n \).

2. Let \( a_1, a_2, \ldots, a_n \) be the \( n \) positive integers. We know:
   \[
   a_1 + a_2 + \cdots + a_n = 2014
   \]
   and the remainders \( a_i \mod n \) are distinct for \( i = 1, 2, \ldots, n \).

3. The possible remainders when dividing by \( n \) are \( 0, 1, 2, \ldots, n-1 \). Therefore, the sum of these remainders is:
   \[
   0 + 1 + 2 + \cdots + (n-1) = \frac{n(n-1)}{2}
   \]

4. We need to check if there exists an \( n \) such that:
   \[
   \sum_{i=1}^n a_i = 2014
   \]
   and the remainders \( a_i \mod n \) are distinct.

5. Let's start with \( n = 2 \):
   - The possible remainders are \( 0 \) and \( 1 \).
   - The sum of two distinct positive integers with remainders \( 0 \) and \( 1 \) is not 2014 (since \( 2014 \) is even).

6. Next, consider \( n = 3 \):
   - The possible remainders are \( 0, 1, \) and \( 2 \).
   - The sum of three distinct positive integers with remainders \( 0, 1, \) and \( 2 \) is not 2014 (since \( 2014 \) is not divisible by 3).

7. Now, consider \( n = 4 \):
   - The possible remainders are \( 0, 1, 2, \) and \( 3 \).
   - We can choose the integers \( 502, 503, 504, \) and \( 505 \):
     \[
     502 + 503 + 504 + 505 = 2014
     \]
   - The remainders when divided by 4 are:
     \[
     502 \mod 4 = 2, \quad 503 \mod 4 = 3, \quad 504 \mod 4 = 0, \quad 505 \mod 4 = 1
     \]
   - These remainders are distinct.

8. Therefore, \( n = 4 \) satisfies the conditions.

The final answer is \( \boxed{4} \)