All categories

3 years ago

Solve for 5+n/8=4 show your work

Mathematics

1 answer:

Aleks [24]3 years ago

5 0

Answer:

n = -8

Step-by-step explanation:

5+n/8=4

Subtract 5 from each side

5-5+n/8=4-5

n/8 = -1

Multiply each side by 8

n/8 * 8 = -1 *8

n = -8

You might be interested in

NOT GRADED. FIND THE MEASURE OF THE INDICATED ANGLE IN EACH TRIANGLE.

Setler [38]

Answer:

The angle in the box is always 50 and that other acute angle is 46

Hope this helps

Step-by-step explanation:

4 0

3 years ago

Read 2 more answers

Please answer as quickly as possible!!

Sav [38]

Answer:

15 points

Step-by-step explanation:

6 0

3 years ago

A box contains 10 tags, numbered 1 through 10, with a different number on each tag. A second box contains

Tju [1.3M]

Answer:

(E) 29.0

Step-by-step explanation:

If a tag is drawn at random from each box, the expected value of the sum of the tags is the sum of the expected values for each tag.

The expected value for each tag is the mean value of the numbers in its box.

$EV = \frac{1+2+3+4+5+6+7+8+9+10}{10} +\frac{20+21+22+23+24+25+26+27}{8} \\EV = 5.5 +23.5\\EV= 29$

The expected value of the sum of the numbers on the two selected tags is 29.

4 0

3 years ago

Create a list of steps, in order, that will solve the following equation 2(x+2)^2-5=93

solong [7]

Answer:

x = (-7,7)

Step-by-step explanation:

1.add 5 on both side

2.divide each side of the equation by 2

3.take the square root of each side of the equation to solve for x

7 0

3 years ago

In how many distinguishable ways can you arrange the letters in the word CONNECTICUT? *

borishaifa [10]

Answer:

The number of distinguishable arrangements are 1,663,200.

Step-by-step explanation:

The word is: CONNECTICUT

The number of ways to arrange a word when no conditions are applied is:

$\frac{n!}{k_{1}!\cdot k_{2}!\cdot k_{3}!...\cdot k_{n}!}$

Here k is the number of times a word is repeated.

In the word CONNECTICUT there are:

3 Cs

2 Ns

2 Ts

And there are a total of n = 11 letters

So, the number of distinguishable arrangements are:

$\frac{n!}{k_{1}!\cdot k_{2}!\cdot k_{3}!...\cdot k_{n}!}=\frac{11!}{3!\times 2!\times 2!}$

$=\frac{39916800}{6\times 2\times 2}\\\\=1663200$

Thus, the number of distinguishable arrangements are 1,663,200.

7 0

3 years ago