Orkut Maths Puzzle

There are 12 flowers of same colour and 3 flowers of another colour. How many different garlands are possible.

Read Solution (Total 6)

15c3 = 455
15 years agoHelpfull: Yes(2) No(1)

52
15 years agoHelpfull: Yes(0) No(3)
total no. of garlands=(15-1)!/12!=182
15 years agoHelpfull: Yes(0) No(3)
91
15 years agoHelpfull: Yes(0) No(2)
Smallest integer greater than or equal to [15!/(12!x3!)]/15 = 455/15 = 30.333... = 31. So, 31 garlands can be made
15 years agoHelpfull: Yes(0) No(2)
51 if garland should contain atleast 1 flower
15 years agoHelpfull: Yes(0) No(2)

Orkut Other Question

In a book, there are 100 pages (on 50 leaves) numbered from 1 to 100.
Some pages are missing in the book.

Sum of page numbers of available pages is 4949.

Can you find out how many leaves are missing from book?

Can u give missing page numbers? You're an electrician working at a mountain. There are N wires running from one side of the mountain to the other. The problem is that the wires are not labeled, so you just see N wire ends on each side of the mountain. Your job is to match these ends (say, by labeling the two ends of each
wire in the same way).

In order to figure out the matching, you can twist together wire ends, thus electrically connecting the wires. You can twist as many wire ends as you want, into as many clusters as you want, at the side of the mountain where you happen to be at the time. You can also untwist the wire ends at the side of the mountain where you're at. You are equipped with an Ohm meter, which lets you test the connectivity of any pair of wires. (Actually, it's an abstract Ohm meter, in that it only tells you whether or not two things are connected, not the exact resistance.)

You are not charged [no pun intended] for twisting, untwisting, and using the Ohm meter. You are only charged for each helicopter ride you make from one side of the mountain to the other. What is the best way to match the wires? (Oh, N>2, for there is no solution when N=2.)