A farmer must transport a fox, goose and bag of beans from one side of a river to another using a boat which can only hold one item in addition to the farmer, subject to
the constraints that the fox cannot be left alone with the goose, and the goose cannot
be left alone with the beans. What is the fewest number of trips the farmer has to take
in order to transport all three safely to the other side of the river?
Show working using any appropriate mathematical representation(s)

The man in the goose cross the river, with the fox and the beans together, he leaves the goose on the other side and goes back across.

The man then takes the fox across the river, and since he can’t leave the fox in the goose together, he brings that goose back.

Again, since the goose and the beans can’t be left together, he leaves the goose and he takes the beans across and leaves with the fox.

He returns to pick up the goose and heads back across the river one last time.

Step-by-step explanation:

4 trips.

Step-by-step explanation:

The man and the goose across the river, leaving the fox and the beans together, he leaves the goose on the other side and goes back across.

The man then takes the fox across the river, and since he can’t leave the fox in the goose together, he brings that goose back.

Again, since the goose and the beans can’t be left together, he leaves the goose and he takes the beans across and leaves with the fox.

He returns to pick up the goose and heads back across the river one last time.

#teamtrees #WAP (Water And Plant)

option c) graph of line going through 1, 4 and 3, 10

step-by-step explanation:

let y equal to margo's coin collection

let x equal to number of years

at the begining x=0, y=1 → point=(x,y)→point=(0,1)

she adds 3 coins per year, then y=1+3x

at x=1, y=1+3(1)=1+3→y=4→point=(x,y)→point=(1,4)

at x=3, y=1+3(3)=1+9→y=10→point=(x,y)→point=(3,10)

the graph of line going through (1, 4) and (3, 10), then the option c is the correct.