You play a game against Bob Hough. You have a very big urn, and at the start of the game, there are twenty balls, two each numbered one through ten. At each turn, you throw out one ball, and Bob dumps in any (finite) number of his choice of balls with smaller (positive integer) labels. For example, if you throw out a ball labeled 2 ten, Bob could dump in a million balls labeled four. But if you throw out a ball labeled one, then Bob can’t do anything. You win if you can empty the urn. Can you win? What is your strategy?

option a, c,d are correct.

step-by-step explanation:

from the given figure, it is given that z is equidistant from the sides of the triangle rst, then from triangle tzb and triangle szb, we have

tz=sz(given)

bz=zb(common)

therefore, by rhs rule,δtzb ≅δszb

by cpctc, sz≅tz

also, from δctz and δasz,

tz=sz(given)

∠tcz=∠saz(90°)

by rhs rule, δctz ≅ δasz, therefore by cpctc, ∠ctz≅∠asz

also,from δasz and δzsb,

zs=sz(common)

∠zbs=∠saz=90°

by rhs rule, δasz ≅δzsb, therefore, by cpctc, ∠asz≅∠zsb

hence, option a, c,d are correct.

(- 1, 0 )

step-by-step explanation:

an x- intercept is where the function crosses the x- axis.

to find the x- intercept/s look for the value of x when f(x) = 0

from the given table there are 3 values of x where f(x) = 0

when x = - 1, x = 2, x = 3

the one that is listed is (- 1, 0 )

step-by-step explanation:

abc