C language Problem

Question 26 (Programming) A number is prime if it has no divisors other than 1 and the number itself. A fellow student of yours has proposed the following conjecture. The product of two consecutive integers is an even number that lies between two odd numbers. The conjecture states that one of those odd numbers must be a prime. For example the product of 7 and 8 is 56 lies between 55 and 57. The number 57 is a prime. Write a C program to test all pairs of consecutive numbers where each number is between 1 and 1000 and count how many pairs do not satisfy the conjecture. (If the conjecture is true this number should be 0) Y ou can assume that you are given a function named prime which takes one argument of type int and returns 1 if it's argument is a prime number and 0 otherwise. You do not have to write a definition of this function