You have a bag of marbles. there are 10 red marbles, 80 green marbles and 110 orange marbles. you get one marble out and record what it is before putting it back and shaking the bag. if you repeated this process 50 times, about how many green marbles would you get?

the answer is 175.4379

step-by-step explanation:

step-by-step explanation:

the true ones are a b and d

center (1,3) with radius 6

step-by-step explanation:

we must complete the square to find the center and radius of the circle.

first make sure the x and y squared terms have 1 as their coefficients. we also make sure x and y terms together.

we now create space between the x and y terms with parenthesis.

we complete the square by taking the middle terms -2x and the -6y - divide each and square them.

we add the squares to both sides.

simplify.

and write the quadratics in factored form.

the center is (h,k) or (1,3). the radius is the square root of 36 which is 6.

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