Kelsey has a list of possible functions. Pick one of the g(x) functions below and then describe to Kelsey the key features of g(x), including the end behavior, y-intercept, and zeros.
g(x) = (x + 2)(x − 1)(x − 2)
g(x) = (x + 3)(x + 2)(x − 3)
g(x) = (x + 2)(x − 2)(x − 3)
g(x) = (x + 5)(x + 2)(x − 5)
g(x) = (x + 7)(x + 1)(x − 1)

x = central angle apc = measure of minor arc ac

the two angles x and 30 add to 180, so x+30 = 180 and x = 180-30 = 150. the measure of minor arc ac is 150 degrees.

what we need to do from here is find the circumference and then multiply it by x/360 since there are 360 degrees in a circle. in this case, x = 150, so x/360 = 150/360 = 15/36 = 5/12. the shortest distance along the curve from a to c is 5/12 of the distance around the entire circle (aka circumference)

c = circumference

c = pi*d

c = pi*24

c = 24pi

now multiply this by 5/12 to get

distance along minor arc ac = (5/12)*(circumference)

distance along minor arc ac = (5/12)*(24pi)

distance along minor arc ac = 10pi

the formula you can use is

l = (x/360)*pi*d

with

l = length of minor arc

x = central angle

d = diameter

which essentially is the steps we took though a bit differently.

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol