There are 14 European cities that Sam would eventually like to visit. On his next vacation, though, he only has time to visit 3 of the cities: one on Monday, one on Tuesday, and one on Wednesday. He is now trying to make a schedule of which city he'll visit on which day. How many different schedules are possible? (Assume that he will not visit a city more than once.)

2184 different schedules

Step-by-step explanation:

Sam can make different schedules of the same three cities, so order of cities does matter, but no repetition is allowed. This makes this a permutation without repetition.

When we choose from n items, and we choose r of them, our formula is

n! / (n-r)!. We have 14 things to choose from, and 3 to choose, so our formula becomes

14! / (14-3)! = 14!/11! = 14*13*12 = 2184 different schedules

step-by-step explanation:

f

fa tha first one you gonna add y to both sides

it look like this

x-y+y=6+y

x=y+6

therefore your answer is

x =y+6

fa tha second one

you gonna flip tha equation

it gonna look like x-4y=y

then add 4 to both sides

it gonna look like tha

x-4 +4 =y +4

so therefore tha answer is x=y+4

step-by-step explanation: