There are 6 cities, of which each is connected to every other city. How many different routes can one trace from A to B, such that no city is touched more than once in any one route

a) 48 b) 60 c) 65 d) 72

• c) 65
  direct=1
  if 1city is covered=4
  if 2CITies are covered=4*3=12
  if 3cities are coverd =4*3*2=24
  if 4 cities are covered=4*3*2*1=24
  total=65
• 13 years agoHelpfull: Yes(7) No(1)
• first draw the hexagon
  Place any where a and b places
  a-link-b=1 when link=0;
  a-link-b=4 when link=1;
  a-link-b=12 when link=2;
  a-link-b=24 when link=3;
  a-link-b=24 when link=4;
  link is the no.of cities between a and b
  So total ways from a to b are 65.
• 10 years agoHelpfull: Yes(3) No(1)