Six logicians finish dinner. The waitress asks, “Do you all want coffee?”
First logician: “I don’t know.”
Second logician: “I don’t know.”
Third logician: “I don’t know.”
Fourth logician: “I don’t know.”
Fifth logician: “I don’t know.”
Sixth logician: “No.”
Who gets coffee and why?
1) My uncle on my mom’s side is an only child. Explain.
2) A man who runs in front of a car gets _____. A man who runs behind a car gets _____.
3) Everyday at a company of 100 people there are 99 vehicles in the parking lot. Each employee leaves their house in the vehicle they own. How is this possible?
4) If the sky is yellow and a banana is red, then what color is grass?
5) Is it legal to marry your Great-aunt’s only sibling’s granddaughter’s only cousin?
6) 1 + 1 = ? (hint: not 2)
A young lady got lost in a museum. There is a 80% chance that she is in the dinosaur section, and a 20% chance that she is in the aquarium section. Six people are available to search for her. Each searcher has a 20% chance of finding her. If you can only do one search, what is the optimum way to split the six searchers up? e.g four searchers to the dinosaur section and two to the aquarium section.
This was said to be a complex estimation of how much water will seep out of a reservoir. One thing you should understand is the top surface area is given, but the seepage comes from the surface of the ground under the water. For a specific reservoir, a table can help you estimate the seepage. I will give you brief table and what the seepage would be for a specific volume. If you can understand how it was computed, I’ll ask you to give the seepage for a different volume.
When the reservoir surface is 38 acres, the seepage is 0.9 inches.
And if the reservoir is 71 acres, the seepage is 1.4 inches.
And when the reservoir is 209 acres, the seepage is 2.1 inches.
Ok… here’s one solution…
When the surface of the reservoir is 77.18 Acres
|the volume of seepage will be 7.78 Acre Feet
When the surface of the reservoir is 200 acres ,
what will be the seepage in Acre Feet?
Oh, this is an additional item. This is seepage for a month. The surface is measured at the first of the month and at the end of the month, seepage gave surface level went down in the given inches.
This a specific part of the USA’s National RESOP program written in Fortran in 1987.
A group of 10 people are seated at a circular table. They hadn’t noticed that they had places designated for them, and none of them sat in the right place. Prove that simply by rotating the table, that at least 2 of them can be sat in the right place.
Alice and Bob play the following card game. Each has a shuffled deck of cards. Each takes the top card from their deck. If they match, Alice wins. If they don’t match they take the next card from the top of the deck. They continue like this until either they draw a matching pair, and then Alice wins, or they never get a match and then Bob wins.
What is the probability that Alice wins the game?
You have a box with n shoelaces in it. You randomly pick two ends and tie them together. You then repeat this process until there are no free ends left.
On average, how many loops will you have created?
How many laces are needed to get (just over) 2 loops on average?
This is a non-trivial extension to the previous blockbuster problem.
Use b blue, 3 green and 3 red blocks, to form a ring. If no reds are allowed to touch each other, and no greens are allowed allowed to touch each other, how many unique patterns can you form?
To keep things simple, rotated versions of a pattern are to be regarded as distinct (just as was assumed in the previous blockbuster problem).
Under what circumstances is/isn’t C(n,r) divisible by n?
Assume that n and are r integers (include 0 and negatives).
C(n,r) = n! / ((n-r)! r!)
You might find it convenient to use e.g. a|b for “a divides b”
and a¦b for “a doesn’t divide b”
On my British keyboard, the | is next to the Z and
the ¦ is next to the top left 1 and is accessed with the Alt Gr key
Here’s a repost from many years ago. I have no idea how to do it or what the answer is.
A boy has four red blocks and eight blue blocks. He arranges the twelve blocks uniformly randomly, in a ring.
What is the probability that no two red blocks are next to each other?
As I strongly suspect that combinations are involved, use C(n,r) = n! / ((n-r)! r!) for consistent notation.