Are there known sharp upper bounds (in terms of $k$ or $\omega(k)$, the number of distinct prime divisors of $k$) for sums of the form $\sum_{p \mid k} \frac{1}{p+1}$ for $k > 1$ subject to the constraint $\sum_{p \mid k} \frac{1}{p+1} < 1$? (This would be a special case of the general result of O. Izhboldin and L. Kurliandchik referenced in the comment.)

A related question: Suppose $(p_i)$ is a set of $n$ consecutive primes which minimizes $1 - \sum_{i = 1}^n \frac{1}{p_i+1} > 0$ for a given $n > 1$. Are there known bounds for $1 - \sum_{i = 1}^{n} \frac{1}{p_i + 1}$ from below in terms of $n$, e.g., $n^{-\delta n}$ for some fixed $\delta > 0$?

Thanks!