a student committee on academic integrity has 132 ways to select a president and vice president from a group of candidates . the same person can not be both president and vice president . how many candidates are there ?
"xc 1 * ( x - 1 ) c 1 = 132 x ^ 2 - x - 132 = 0 ( x - 12 ) ( x + 11 ) = 0 x = 12 , - 11 - 11 ca n ' t possible . hence 12 should be the answer e"
divide(add(const_1, sqrt(add(multiply(const_4, 132), power(negate(const_1), const_2)))), const_2)