All categories

3 years ago

According to Bayes' Theorem, the probability of event A, given that event B has occurred, is as follows.

Mathematics

1 answer:

zubka84 [21]3 years ago

8 0

Answer:

0.0625

Step-by-step explanation:

P(A) = 1/4

P(A') = 3/4

P(B|A)= 1/10

P(B|A') = 1/2

The probability of event A, given that event B has occurred is computed with the following equation:

P(A|B) = [P(A)*P(B|A)]/[P(A)*P(B|A)+P(A')*P(B|A')]

Replacing with data:

P(A|B) = [1/4*1/10]/[1/4*1/10+3/4*1/2] = 0.0625

You might be interested in

JIM'S BACKYARD IS A RECTANGLE THAT IS 15 5/6 YARDS LONG AND 10 2/5 YARDS WIDE. JIM BUYS SOD IN PIECES THAT ARE 1 1/3 YARDS LONG

Stolb23 [73]

Jim's backyard:
15 5/6 yd long
10 2/5 yd wide

Sod pieced:
1 1/3 yd long
1 1/3 yd wide

Area of backyard:
15 5/6 times 10 2/5 =
164 2/3 yd

Area of Sod Piece:
1 1/3 times 1 1/3 =
1 7/9 yd

Divide area of backyard by area of sod piece :
164 2/3 divided by 1 7/9 =
92 5/8

He will need to buy 93 pieces of sod to cover his backyard.

7 0

3 years ago

In the literal equation below, what do C and F represent? F = 9/5 C + 32

Fofino [41]

Celsius and Fahrenheit

7 0

3 years ago

Read 2 more answers

What's 0.1002 to the nearest thousandth

Valentin [98]

0.1
the 0 is in the thousandths place plus the 2 os next to is since 2<5 it is 0

6 0

3 years ago

For integers a, b, and c, consider the linear Diophantine equation ax C by D c: Suppose integers x0 and y0 satisfy the equation;

Dmitrij [34]

Answer:

$x = x_1+r(\frac{b}{gcd(a, b)} )\\y=y_1-r(\frac{a}{gcd(a, b)} )$

b. x = -8 and y = 4

Step-by-step explanation:

This question is incomplete. I will type the complete question below before giving my solution.

For integers a, b, c, consider the linear Diophantine equation

$ax+by=c$

Suppose integers x0 and yo satisfy the equation; that is,

$ax_0+by_0 = c$

what other values

$x = x_0+h$ and $y=y_0+k$

also satisfy ax + by = c? Formulate a conjecture that answers this question.

Devise some numerical examples to ground your exploration. For example, 6(-3) + 15*2 = 12.

Can you find other integers x and y such that 6x + 15y = 12?

How many other pairs of integers x and y can you find ?

Can you find infinitely many other solutions?

From the Extended Euclidean Algorithm, given any integers a and b, integers s and t can be found such that

$as+bt=gcd(a,b)$

the numbers s and t are not unique, but you only need one pair. Once s and t are found, since we are assuming that gcd(a,b) divides c, there exists an integer k such that gcd(a,b)k = c.

Multiplying as + bt = gcd(a,b) through by k you get

$a(sk) + b(tk) = gcd(a,b)k = c$

So this gives one solution, with x = sk and y = tk.

Now assuming that ax1 + by1 = c is a solution, and ax + by = c is some other solution. Taking the difference between the two, we get

$a(x_1-x) + b(y_1-y)=0$

Therefore,

$a(x_1-x) = b(y-y_1)$

This means that a divides b(y−y1), and therefore a/gcd(a,b) divides y−y1. Hence,

$y = y_1+r(\frac{a}{gcd(a, b)})$ for some integer r. Substituting into the equation

$a(x_1-x)=rb(\frac{a}{gcd(a, b)} )\\gcd(a, b)*a(x_1-x)=rba$

$x = x_1-r(\frac{b}{gcd(a, b)} )$

Thus if ax1 + by1 = c is any solution, then all solutions are of the form

$x = x_1+r(\frac{b}{gcd(a, b)} )\\y=y_1-r(\frac{a}{gcd(a, b)} )$

In order to find all integer solutions to 6x + 15y = 12

we first use the Euclidean algorithm to find gcd(15,6); the parenthetical equation is how we will use this equality after we complete the computation.

$15 = 6*2+3\\6=3*2+0$