Ram wants to visit 5 places like c, b, m, d, k. he will visit atleast 3 places in one trip and c will be visited in every trip. If visiting different places is considered as different trips then how many ways can he go trips.

• C is in every trip -> So select this first in 1 way
  
  Next, from the remaining 4, whose 2 more , 3 more and all four for the cases for exactly 3 places visited, exactly 4 places visited and exactly 5 places visited
  
  1*(4C2 + 4C3 + 4C4) = 11 ?
  any body mail me recent ques urgent shyamleshd@gmail.com
• 12 years agoHelpfull: Yes(60) No(7)
• c is common
  atleast 3 places
  4C2+4C3= 16
• 12 years agoHelpfull: Yes(1) No(7)
• c is common i.e....... 1 way
  so now only we need to select 2 out of 4 i.e..... 4c2
  => 1*4c2=6
  *we cant select 3 or 4 since c is fixed and only visits at a time... :)
• 12 years agoHelpfull: Yes(1) No(5)
• c is common///
  Take 2 from 4 city it is done by 4c2*3!+4c3*4!+5!=252.....
  is it ryt frndss?
• 9 years agoHelpfull: Yes(1) No(1)
• if c is common in every trip,then no of trip is=5-1 =6
  c
  3-1
• 12 years agoHelpfull: Yes(0) No(13)