×

# #10

There are five cities $$A,B,C,D,E$$ on a certain island.Each city is connected to every other city by road . In how many ways can a person starting from city $$A$$ come back to $$A$$ after visiting a city more than once and without taking the same road more than once? (The order in which he visits the cities also matters e.g the routes $$A\rightarrow B \rightarrow C \rightarrow A$$ and $$A\rightarrow C \rightarrow B \rightarrow A$$ are different.

Note by Vilakshan Gupta
5 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

There are no comments in this discussion.

×