3) 3000 vendors are selling ice-creams. There are n numbers of students. 1st student purchases from all vendors, 2nd from 2nd, 4th, 6th… vendors,3rd from 3rd, 6th, 9th……….! Who are the vendors from whom maximum number of students will purchase?

• 12 as everyone will pass upto 12
• 12 years agoHelpfull: Yes(7) No(3)
• multiple of 6..
  i.e. 6,12,18,......
  1st student purchase from all
  2nd frm 2,4,6,8,...
  3rd frm 3,6,9,
  so max purchase frm 6(i.e.) lcm of 2 & 3.
• 12 years agoHelpfull: Yes(7) No(0)
• The answer is : 2520.
  I don't know the logic but I made c++ program that calculates the shop no. that is divisible by maximum no of numbers. Here is the link. You can run it youself. http://ideone.com/fsZrK
• 12 years agoHelpfull: Yes(4) No(0)
• 996
  maximum no divisible by 2 and 3
  
• 12 years agoHelpfull: Yes(3) No(3)
• there are "n" no of students.
  it means the shop must be divisible with max no of digits starting from 1.
  if their were 1000 vendors, then the 840th shop would have got max students..i dnt know the ans in the range of 3000. i hope i am clear.:)
• 12 years agoHelpfull: Yes(2) No(2)
• please explain this
• 12 years agoHelpfull: Yes(1) No(1)
• hw it can b 12 as the 9th student will not pass by the 12 vendor and even not the 10 one ???/// xplain
• 12 years agoHelpfull: Yes(1) No(0)
• the corrrect ans can only be extracted if the no. of n is given. . the ans wl be the least common multiple and its subsequent multipls of the values 1 up to
• 12 years agoHelpfull: Yes(0) No(0)
• in the question n must be gven ,,, in many papers 1 saw n=3,then the ans will be 6
• 12 years agoHelpfull: Yes(0) No(0)