The Fundamental Counting Principle 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?
O (3)(3)(3)
(9)(9)(9)
(10)(9)(8)
(10)(10)(10)

step-by-step explanation:

first you will have to convert 3/4 into a decimal

which is .75

then you will have to divide 1.5 by .75

which is 2

no you have to divide

guess at question:

a vertical line intersects the graph of g(x,y) = 0 at two points. what conclusion follows about the function f(x) implicitly defined by g(x,f(x)) = 0?

the domain of f(x) cannot include the x coordinate of any such vertical line.

informally, f(x) is not a function, and

g(x,y)=0 cannot be solved for y uniquely.

the relation r = {(x,y) such that g(x,y) = 0} is a function if

for all (a,b) ∊ r and (c,d) ∊ r, a=c implies b=d.

step-by-step explanation:

so the possibilities of the measurement of the side of the triangle are either it is longest side or not the longest side

when it is the longest side

s < 25 + 35s < 60

if it is not the longest side

35 < 25 + s10 < sso 10 < s < 60so the perimeter70 < p < 130

where is the option given