All categories

3 years ago

Ajar contains 12 red balls, 7 green balls, 10 white balls, and 7 yellow balls.

Mathematics

1 answer:

USPshnik [31]3 years ago

8 0

Answer:

C. Independent, 49/1296

Step-by-step explanation:

A jar contains 12 red balls, 7 green balls, 10 white balls, and 7 yellow balls.

Total balls = 12+7+10+7

Total balls= 36

Two balls are chosen at random with replacement.

The probability that the both balls are green = probability of the first ball to he green * probability of the second ball to be green

The probability that the both balls are green= 7/36 * 7/36

The probability that the both balls are green= 49/1296

You might be interested in

Helen kulman is a secretary she earned $10.65 per hour she worked 38 hours last week what is her straight time pay

ivolga24 [154]

Answer:

404.7

Step-by-step explanation:

You multiply 10.65 by 38 to get 404.7

8 0

3 years ago

Read 2 more answers

Mr.gilliam is 3 years younger than his wife.the sum of their ages is 95.how old is mr.gilliam

Usimov [2.4K]

X = the age of Mr. Gilliam
His wife is 3 years older, so the age of Mr. Gilliam's wife = x+3
The sum of their ages is 95.

$x+x+3=95 \\
2x+3=95 \\
2x=95-3 \\
2x=92 \\
x=46$

Mr. Gilliam is 46 years old.

3 0

3 years ago

Read 2 more answers

Solve −2x2 +3x − 9 = 0

luda_lava [24]

-2x^2 + 3x - 9 = 0
The quadratic is not factorable so quadratic formula must be used.
x = (-b + - √(b^2 - 4ac))/2a
a = -2, b = 3, c = -9
x = (-3 + - √(9 - 4*-2*-9))/-4
x = (-3 + - √(-63))/-4
x = -3 + - 3i√7
   --------------
   -4
x = 3 + 3i√7 x = 3 - 3i√7
    ------------ ------------
   4 4

8 0

3 years ago

If you answer all of these I will give brainliest if it will let me!!!!!

Tamiku [17]

Answer:

1-8

Step-by-step explanation:

I was only able to finish one through eight The rest follow the same concept though

6 0

3 years ago

In a coin game, you repeatedly toss a biased coin (0.4 for head, 0.6 for tail). Each head represents 3 points and tail represent

Sladkaya [172]

Answer:

See answer in explanation

Step-by-step explanation:

State: current points if stop plus a terminal state, that is, 0,1,2,3,4,5,6,7,DONE

Action: Toss, Stop

2. What is the transition function and the reward function for this MDP?

Transition function:

T(Si , TOSS, Si+3) = 0.4 if i < 3

T(Si , TOSS, DONE) = 0.4 if i ≥ 3

T(Si , TOSS, Si+1) = 0.6 if i < 7

T(Si , TOSS, DONE) = 0.4 if i = 7

T(Si , STOP, DONE) = 1

Reward function:

R(Si , TOSS, ANY ) = 0

R(Si , STOP, DONE) = i

R(DONE, STOP, DONE) = 0

3. What is the optimal policy for this MDP? Please write down the steps to show how

you get the optimal policy.

Optimal policy: Toss for 0,1,2 ; STOP for others.

You should include the steps of value iteration. The value iteration will converge at

iteration 3. Result of iteration 3 is as follow,

V3: 0: 4.5 from Toss; 1: 5.4 from Toss; 2: 5.9 from Toss; 3: 3 from

Stop; 4: 4 from Stop; 5: 5 from Stop; 6: 6

5 0

3 years ago