# CAT 2000 | Question: 104

939 views

There are three cities A, B and C, each of these cities is connected with the other two cities by at least one direct road. If a traveller wants to go from one city (origin) to another city (destination), she can do so either by traversing a road connecting the two cities directly, or by traversing two roads, the first connecting the origin to the third city and the second connecting the third city to the destination. In all there are $33$ routes from A to B (including those via C). Similarly there are $23$ routes from B to C (including those via A). How many roads are there from A to C directly?

1. $6$
2. $3$
3. $5$
4. $10$

## Related questions

$\text{A, B, C}$ are three numbers. Let $@ \text{(A, B)} =$ average of $\text{A}$ and $\text{B}$, $/ \text{(A, B)} =$ product of $\text{A}$ and $\text{B}$, and $\text{X... 0 votes 0 answers 3 820 views Answer the following question based on the information given below.For real numbers$x, y,$let$f(x, y) = \left\{\begin{matrix} \text{Positive square-root of}\; (x + y),\...
Answer the following question based on the information given below.For three distinct real numbers $x, y$ and $z,$ let$f(x, y, z) = \min(\max(x, y), \max(y, z), \max(z, x... 0 votes 1 answer 5 1,274 views Answer the following question based on the information given below.For three distinct real numbers$x, y$and$z,$let$f(x, y, z) = \min(\max(x, y), \max(y, z), \max(z, x...