I have attached a question from my homework, that I am not sure how to get started.
every walk goes north 4 east 6
E6 N4
N4 E6
N3 E5 N1 E1
N3 E4 N1 E2
N3 E3 N1 E3
N3 E2 N1 E4
N3 E1 N1 E5
N2 E5 N2 E1
N2 E5 N1 E1 N1
N2 E4 N2 E2
N2 E4 N1 E2 N1
N2 E4 N1 E1 N1 E1
N2 E3 N2 E3
N2 E3 N1 E3 N1
N2 E3 N1 E2 N1 E1
N2 E3 N1 E1 N1 E2
N1 E6 N3
N1 E5 N3 E1
N1 E5 N2 E1 N1
N1 E5 N1 E1 N2
N1 E4 N3 E2
N1 E4 N2 E2 N1
N1 E4 N1 E2 N2
N1 E3 N3 E3
N1 E3 N2 E3 N1
N1 E3 N2 E2 N1 E1
N1 E3 N2 E1 N1 E2
N1 E3 N1 E3 N2
N1 E3 N1 E2 N2 E1
N1 E3 N1 E1 N1 E1 N1
N1 E2 N3 E4
N1 E2 N2 E4 N1
N1 E2 N1 E4 N3
N1
I see that I could trace every possible route, but how can i apply the fundemental counting principle to this problem?
it seems like this might be an nCr problem, but I cannot figure that out. can anyone help???
Let me be frank with you. I usually do not open attachments.
I just figure that someone who wants help should be willing to learn to post correctly.
But in the case, given the responses you have gotten, I will step in.
How many ways to rearrange the string $\displaystyle EEEEEENNNN?$
Any rearrangement of that string describes a way to drive from home to school.
Notice, that is the number of ways to place six E’s into ten places.