Mrthdrb

I was wondering if the following language belongs to NP class and if its complimentary belongs to NP class:

beginalign
C=leftlangle p,nranglemidright.& left. p text and $n$ are natural numbersright.\
&left.text and there's no prime number in the rangeleft[p,p+nright]right
endalign

could you please check if my reasoning is okay to deduce NP?
(I am not sure, but here's what I think):
for each word $langle p,nrangle in C$ we know that the word belongs to C because there exists a primal certificate - an nontrivial divisor to any of the numbers between $[p,p+n]$, though I am not really sure it is in NP.

regarding the complement: I think it is in NP because the compliment compositeness can be decided by guessing a factor nondeterministically. But again I am not so sure about it and I don't know how to correctly prove and show it.

Would really appreciate your input on that as I am quite unsure and also checked textbooks and internet (and this site) about it.

Edit: for the sake of solving the problem, due to xskxzr's comment, let's assume p and n are represented by binary, as there's a difference according to his comment between p and n being represented in unary and binary(this is also quite interesting).

Note that there's always a prime between $p$ and $2p$ for any $p$ thus we can eliminate $n$ as a complexity parameter, as for any non-trivial instance we have $n < p$.

The complement (there exists a prime in range $[p, p+n]$) is quite easy (due to the shoulders of giants). There are various well-known polynomial size certificates of primality of $q$ you could return along with some $q in [p, p+n]$ if that prime $q$ exists. Thus your language is in co-NP.

However the question of whether it is in NP or not seems very hard to me. Our input size is $b$ such that $2^b approx p$. You need the existence of a $O(b^c)$ sized certificate that in the worst case asserts the compositeness of an exponentially large ($|[p, p+n]| approx |[p, 2p]| approx p approx 2^b$) series of consecutive integers. From my intuition about number theory, finding such a certificate would be a major result, but disproving its existence would be as well. But perhaps someone with more number theoretic knowledge than me can pitch in if either of those turn out to be easy.

As orlp says, it's trivial to give a certificate if the answer is "YES" (just give a non-trivial factor of each of the numbers in question), the problem is whether this certificate is polynomial sized.

There is a conjecture, backed by heuristics and some computational evidence, that there is a constant c > 0 such that for any k-bit prime p, there is a prime between p and p + c * k^2. If this conjecture is true, then the certificate is actually of size O (k^3) whenever the answer is YES, so the problem is in NP. But, it's just a conjecture.

But of course if we might be able to prove the much weaker conjecture "for some c, there is always a prime between p and p + c * k^3" or the even weaker conjecture "there is a polynomial pol (k) such that there is always a prime between p and p + pol(k)", then this problem would also be in NP. So we can prove that is in NP by proving something about prime gaps.

There is also the possibility that a less obvious and shorter certificate exists.