Let $P(x)$ be a polynomial with positive integer coefficients and degree 2015. Given that there exists some $\omega \in \mathbb{C}$ satisfying
$$\omega^{73} = 1\quad \text{and}$$
$$P(\omega^{2015}) + P(\omega^{2015^2}) + P(\omega^{2015^3}) + \ldots + P(\omega^{2015^{72}}) = 0,$$
what is the minimum possible value of $P(1)$?
1. **Understanding the problem:**
   We are given a polynomial \( P(x) \) with positive integer coefficients and degree 2015. We also know that there exists a complex number \( \omega \) such that \( \omega^{73} = 1 \). This means \( \omega \) is a 73rd root of unity. The problem states that the sum of the polynomial evaluated at certain powers of \( \omega \) equals zero:
   \[
   P(\omega^{2015}) + P(\omega^{2015^2}) + P(\omega^{2015^3}) + \ldots + P(\omega^{2015^{72}}) = 0.
   \]

2. **Analyzing the roots of unity:**
   Since \( \omega \) is a 73rd root of unity, we know that \( \omega^k \) for \( k = 0, 1, 2, \ldots, 72 \) are all distinct roots of unity. We need to understand the behavior of \( \omega^{2015^k} \mod 73 \).

3. **Simplifying the exponents:**
   We need to determine the behavior of \( 2015^k \mod 73 \). First, we reduce 2015 modulo 73:
   \[
   2015 \div 73 = 27 \quad \text{with a remainder of} \quad 2015 - 27 \times 73 = 34.
   \]
   Thus,
   \[
   2015 \equiv 34 \mod 73.
   \]
   Therefore,
   \[
   2015^k \equiv 34^k \mod 73.
   \]

4. **Checking the periodicity:**
   We need to check if \( 34^k \mod 73 \) cycles through all residues modulo 73. By Fermat's Little Theorem, since 73 is prime:
   \[
   34^{72} \equiv 1 \mod 73.
   \]
   This implies that the powers of 34 modulo 73 will cycle every 72 steps.

5. **Summing the polynomial evaluations:**
   The given condition is:
   \[
   P(\omega^{34}) + P(\omega^{34^2}) + \ldots + P(\omega^{34^{72}}) = 0.
   \]
   Since \( \omega^{34^k} \) are distinct 73rd roots of unity, the sum of the polynomial evaluated at these roots must be zero. This implies that the polynomial \( P(x) \) must be such that the sum of its evaluations at these roots is zero.

6. **Considering the polynomial coefficients:**
   Since \( P(x) \) has positive integer coefficients, the minimum value of \( P(1) \) must be such that the sum of the evaluations at the roots of unity is zero. The simplest polynomial with positive integer coefficients that satisfies this condition is \( P(x) = x - 1 \).

7. **Evaluating \( P(1) \):**
   For \( P(x) = x - 1 \), we have:
   \[
   P(1) = 1 - 1 = 0.
   \]
   However, since the coefficients must be positive integers, we need to consider the next simplest polynomial. The polynomial \( P(x) = x + 1 \) does not satisfy the condition because it does not sum to zero over the roots of unity.

8. **Finding the minimum polynomial:**
   The polynomial \( P(x) = x^{2015} + 1 \) satisfies the condition because it sums to zero over the roots of unity. Evaluating this polynomial at \( x = 1 \):
   \[
   P(1) = 1^{2015} + 1 = 2.
   \]

The final answer is \( \boxed{2} \).