Fifteen pirates steal a stack of identical gold coins. when they try to divide them evenly, two coins are left over. a fight erupts and one of the pirates is killed. the remaining pirates try again to evenly distribute the coins. this time there is one coin left over. a second pirate is killed in the resulting argument. now when the remaining pirates try to divide the coins evenly there are no coins left over. use the chinese remainder theorem to find the smallest number of coins that could have been in the sack.

1 and 2

step-by-step explanation:

don't know what that says sorry i can't you

step-by-step explanation:

idk what it says

37/3

step-by-step explanation:

step 1: simplify both sides of the equation.

7x+8(x+

1

4

)=3(6x−9)−8

7x+(8)(x)+(8)(

1

4

)=(3)(6x)+(3)(−9)+−8(distribute)

7x+8x+2=18x+−27+−8

(7x+8x)+(2)=(18x)+(−27+−8)(combine like terms)

15x+2=18x+−35

15x+2=18x−35

tep 2: subtract 18x from both sides.

15x+2−18x=18x−35−18x

−3x+2=−35

step 3: subtract 2 from both sides.

−3x+2−2=−35−2

−3x=−37

step 4: divide both sides by -3.

−3x

−3

=

−37

−3

x=

37

3

answer:   rotate 270° clockwise about (7, 1) and reflect across the line x = 7

step-by-step explanation:

because i took test