Which multiplication problem can be used to determine how many possible combinations there are for a lock consisting of 3 digits from 0–9, if the digits can be repeated? (3)(3)(3) (9)(9)(9) (10)(9)(8) (10)(10)(10)

hello from mrbilldoesmath!

answer:

the domain is the set { -2, 0, 2, 3}

discussion:

the domain is the set of x values in the ordered pairs (x,y). taking the x, or first component, of each ordered pair gives   -2, 0, 2, 3.

you,

mrb

step-by-step explanation:

f(gx)=f(1/x+2)

=(1/x+2)+2

=(1+2x)/2+2

=(1+2x+4)/2

= (2x+5)/2