let p be a prime number . if n = 7 p , how many divisors does n have ?
two . n = 7 * p , and both 7 and p are prime . so the answer is b .
add(divide(const_1, const_2), subtract(divide(7, const_2), const_2))