An cars maintenance state is scored by an integer number between 0 and A. We want to find and prove a condition under which we can guarantee that two cars obtain the same number of score for their checks. Using this create a definition for the predicate C(n,p) to capture the condition above. Make your assumption as weak as possible: if your assumption does not hold, it should imply that it is possible for all cars to receive a different number of scores.