All categories

3 years ago

The work of a student to solve a set of equations is shown:

2 answers:

5 0

If you would like to know in which step did the student first make an error, you can find this using the following steps:

y = 4 - 2z
4y = 2 - 4z
________________
-4(y) = -4(4 - 2z)
4y = 2 - 4z
________________
-4y = -16 + 8z ... Step 2
4y = 2 - 4z
________________
0 = -16 + 8z + 2 - 4z

16 - 2 = 4z

14 = 4z

z = 14/4 = 7/2

The correct result would be: Student made an error in Step 2.

KATRIN_1 [288]3 years ago

3 0

Answer:

Step 2

Step-by-step explanation:

y = 4 - 2z

4y = 2 - 4z

________________

-4(y) = -4(4 - 2z)

4y = 2 - 4z

________________

-4y = -16 + 8z ... Step 2

4y = 2 - 4z

________________

0 = -16 + 8z + 2 - 4z

16 - 2 = 4z

14 = 4z

z = 14/4 = 7/2

You might be interested in

I need help on all 3 of these questions

Jobisdone [24]

1) C is because it’s exactly double the size in both width and length while the others are only gaining one or the other. For example - the a length of the squares is 5 and the length on c is 10, the base on a is 3 long, the base on c is 6. The width on a is 1 and the width on c is 2. You can put these into fractions 5/10 3/6 1/2 but they all equal 1/2. So it’s double the size of a.

5 0

3 years ago

Pic below................................ answer ASAP

Free_Kalibri [48]

Answer:

The answer is C.-216

Step-by-step explanation:

7 0

3 years ago

Read 2 more answers

A medical researcher needs 37 people to test the effectiveness of an experimental drug. If 101 people have volunteered for the t

Rashid [163]

Answer:

The number of ways to select 37 people from 101 is, 5,397,234,129,638,871,133,346,507,775.

Step-by-step explanation:

In mathematics, the procedure to select k items from n distinct items, without replacement, is known as combinations.

The formula to compute the combinations of k items from n is given by the formula:

${n\choose k}=\frac{n!}{k!\cdot (n-k)!}$

Compute the number of ways to select 37 people from 101 as follows:

${101\choose 37}=\frac{101!}{37!\cdot (101-37)!}$

$=\frac{101!}{37!\times 64!}\\\\=\frac{101\times 100\times 99\times....64!}{37!\times 64!}\\\\=5397234129638871133346507775$

Thus, the number of ways to select 37 people from 101 is, 5,397,234,129,638,871,133,346,507,775.

5 0

2 years ago

A lock has two buttons: a "0" button and a "1" button.To open a door you need to push the buttons according to a preset 8-bit se

ratelena [41]

Answer:

Step-by-step explanation:

The problem relates to filling 8 vacant positions by either 0 or 1

each position can be filled by 2 ways so no of permutation

= 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2

= 256

b )

Probability of opening of lock in first arbitrary attempt

= 1 / 256

c ) If first fails , there are remaining 255 permutations , so

probability of opening the lock in second arbitrary attempt

= 1 / 255 .

7 0

3 years ago

Find the value of z in the isosceles triangle shown below. V20 V20 8

Andrews [41]

Answer:

Step-by-step explanation:

use Pythagorean theorem:

a² + b² = c²

where a = x

b = 8/2 = 4

c = √20

plugin values into the formula:

x² + 4² = (√20)²

x² + 16 = 20

x² = 20 - 16

x = √4

x = 2

5 0

2 years ago