Consider the language PRIMES-{(p): p is a prime number) It is known (and you may assume for this question) that PRIMES is in P. Let DIV-{(a, b): a, b є N and a has a divisor d for some 1 d-b). Prove that DIV NP n cONP (it is not known if DIV is in P!). Show transcribed image text Consider the language PRIMES-{(p): p is a prime number) It is known (and you
OR
OR