Solve for the variable. find all solutions if any exist. (please show work)

I WILL MARK BRAINLIEST IF YOU GET IT CORRECT!

Novay_Z [31]

B would be the answer because 5/10=8/10 so 5/8=10/10

3 0

3 years ago

Hi guys... I'm a foreigner... I've completed my high Schools...nd I'd like to know what should I do to get into MIT? Help me

Blizzard [7]

Answer:A strong academic foundation in high school contributes to your own development, improves your odds of getting into MIT, and helps you make the most of the Institute when you’re here.

Step-by-step explanation:

high school years include the following:

One year of high school physics

One year of high school chemistry

One year of high school biology

Math, through calculus

Two years of a foreign language

Four years of English

Two years of history and/or social sciences

6 0

3 years ago

A local park is adding a new 14 ft long slide to the playground. The vertical height of the slide is h. The distance from the bo

barxatty [35]

Pls. see attachment for my answers.

5 0

3 years ago

Hensley earns $8.50 per hour at an amusement park. She received a 12% raise when she becomes a manager at the gift store. How mu

ICE Princess25 [194]

First, find 12% of $8.50.

12% of $8.50 = 12% * $8.50 = 0.12 * $8.50 = $1.02

The raise is $1.02 per hour.

$8.50 + $1.02 = $9.52

Hear new hourly earnings are $9.52/hour.

3 0

3 years ago

. A binary string containing M 0’s and N 1’s (in arbitrary order, where all orderings are equally likely) is sent over a network

Sophie [7]

Answer:

$P(k) = \frac{\binom{N}{k} \binom{(M+N) - N}{r-k}}{\binom{M+N}{r}}$

Step-by-step explanation:

We can model the string as a hypergeometric distribution, as each bit has two possible values, 1 or 0, and the chance of a 1 or 0 changes with every bit, as there are a finite number M of 0's and N of 1's and every bit takes one of those values.

If M+N (total size of the string) >> r (number of trials), we could model it as a binomial distribution as the probability of a 1 or 0 wouldn't change in a significant amount with every bit, but as we don't know the magnitude of M+N and r, we follow up with hypergeometric distribution.

The distribution has the following formula for probability:

$P(k) = \frac{\binom{K}{k} \binom{N - K}{n-k}}{\binom{N}{n}}$

Where k is the number of sucesses, K is how many total sucess states are in the population, N is the population size and n is the number of draws.

For our case, a 1 would be a sucess, i.e. k the number of 1's we want to know the probability, N our total number of 1's, M+N the length of the string (population size) and we want to analyse what happens in the first r bits (number of draws):

$P(k) = \frac{\binom{N}{k} \binom{(M+N) - N}{r-k}}{\binom{M+N}{r}}$

8 0

3 years ago