Question

The possible number of ways in which one can travel from A to R without crossing a city more than once is ______

Answer 1

Answer:

The answer is 144! .

When you are going to C to D there are 2 ways.

B to C 3 ways then

There are 3 ways

So you can use 3*2= 6

Ways to go B to D

Like wise that you can use 4*3*2= 24

Ways.

4! = 24

Then returning

There are 3 ways you can use B to A

2 ways C to B

One way D to C

Then back you can use 3*2*1 = 6 = 3!

So all you can use 24*6 = 144 ways.

Step-by-step explanation:

The answer is 144! .

When you are going to C to D there are 2 ways.

B to C 3 ways then

There are 3 ways

So you can use 3*2= 6

Ways to go B to D

Like wise that you can use 4*3*2= 24

Ways.

4! = 24

Then returning

There are 3 ways you can use B to A

2 ways C to B

One way D to C

Then back you can use 3*2*1 = 6 = 3!

So all you can use 24*6 = 144 ways.

Answer 2

Answer:

144 is the correct ans.

By the way, what's your grade?