Apedlock has a four digit code that includes digits from 0 to 9, inclusive.
what is the probability that the code does not consist of all odd digits of the same digit is not used more than once in the code ? ?

point a is the center of the circle that passes through points e, f, and g and the center of the circle that passes through points x, y, and z.

example 2 – simplify: step 1: completely factor both the numerators and denominators of all fractions. step 2: change the division sign to a multiplication sign and flip (or reciprocate) the fraction after the division sign; essential you need to multiply by the reciprocal. step 3 : cancel or reduce the fractions.