There is a troupe of five mummers: a drummer, a dancing bear, a piper, a juggler, and a jester. One always tells the truth, one always tells lies, and the remaining three tell a mixture of truth and lies. To find out who tells what, the following clues are presented:
Drummer: I always tell a mixture of truth and lies.
Juggler: That is not true.
Jester: If the bear is always truthful, the juggler tells nothing but lies.
Bear: That is false.
Piper: The drummer always tells the truth.
Jester: The piper tells nothing but lies.
Can you figure out who tells what based on this information, and how?
]]>There are two which I still can't solve after driving myself nuts looking at them.
Perhaps this is a good place to get the problem solved?
The questions all involve a 3x3 matrix and there is usually a logic sequence going from left to right, and sometimes also up to down. The idea is to supply the missing corner chosen from the eight samples below.
]]>George got a birthday present which was 1 banknote of 100 (the currency does not matter. Lets name it "currency" just for convinience). Valid banknotes in the currency are: 100, 50, 20, 10, 5, 2 and 1.
So he decided to spent some of the money in the shopping mall (he did not take any other banknotes with him. Just the one banknote of 100). At the end of the shopping it turns out that:
1. In each and every shop he bought just one item and therefore just one payment was made.
2. The price of the item was a whole integer (no decimal points are allowed)
3. For each item he never had the exact sum that's why he always gives the nearest banknote (of which he had at the moment).
4. The sellers on the other hand always have enough money in different banknotes that's why they return the change with as less banknotes as possible. However, at the end it turns out that each seller aways return at least two banknotes to George.
The question is:
What is the maximum number of items that George can buy with these restrictions?
I have bolded the important parts in my opinion, so they pop out.
The approach that I took was the following:
1. In each shop the way I tried to figure out the price of the item is to have a change with as less as possible banknotes as change and with as much as higher value of the banknotes in the change
2. And as less as the price can be.
So the solution:
1. First Shop one buying of item that costs - 10
- The payment was made with the available banknote - 100
- The change was - 50 20 20
- Available banknotes for George - 50 20 20 = 90
2. Second Shop one buying of item that costs - 9
- The payment was made with the available banknote - 20
- The change was - 10 1
- Available banknotes for George - 50 20 10 1 = 81
3. Third Shop one buying of item that costs - 7
- The payment was made with the available banknote - 10
- The change was - 2 1
- Available banknotes for George - 50 20 2 1 1 = 74
4. Fourth Shop one buying of item that costs - 9
- The payment was made with the available banknote - 20
- The change was - 10 1
- Available banknotes for George - 50 10 2 1 1 1 = 65
5. Fifth Shop one buying of item that costs - 7
- The payment was made with the available banknote - 10
- The change was - 2 1
- Available banknotes for George - 50 2 2 1 1 1 1 = 58
6. Sixth Shop one buying of item that costs - 9
- The payment was made with the available banknote - 50
- The change was - 20 20 1
- Available banknotes for George - 20 20 2 2 1 1 1 1 1 = 49
7. Seventh Shop one buying of item that costs - 13
- The payment was made with the available banknote - 20
- The change was - 5 2
- Available banknotes for George - 20 5 2 2 2 1 1 1 1 1 = 36
8. Eight Shop one buying of item that costs - 17
- The payment was made with the available banknote - 20
- The change was - 2 1
- Available banknotes for George - 5 2 2 2 2 1 1 1 1 1 1 = 19
I tried different approaches and this gives me the highest number of items - 8. For the last three we have several options but they cannot give more than 8.
Is this the correct answer and if no how can you approach the problem to have more buyings. I found the rule that sellers should return at least two banknotes the most restrictive.
]]>
Original: http://brainden.com/forum/topic/11943--/
My Additions: http://brainden.com/forum/topic/12010--/
]]>This is an easy one... how many can get it first time?
]]>this is actually an old problem solved by vos Savant, and I can't get to the bottom of it. It goes like this:
A shopkeeper says she has two new baby beagles to show you, but she doesn't know whether they're male, female, or a pair. You tell her that you want only a male, and she telephones the fellow who's giving them a bath. "Is at least one a male?" she asks him. "Yes!" she informs you with a smile. What is the probability that the other one is a male?
Savant replied "one out of three".
I convinced myself pretty hard that the answer should be 2/3, so I'm looking for explanation of Savant's answer.
If at least one is a male, and you have 2 puppies, one yellow and one green collar, there are 3 possible combinations (I agree with her so far):
YM & GM
YM & GF
YF & GM
So, if you choose Y collar, there is 2/3 chances, that the other one is a male, and of course the same for G collar.
Where did I get it wrong?
]]>
In order to determine which of the 10201 cases is defective, the manufacturer has two scales at his disposal:
How can the manufacturer determine the defective case using only 2 times each of the 2 scales?
Second version of the riddle
A poker manufacturer has created 41010 cases each containing 100 chips.
41009 of these cases are perfect and each of their chips weighs 10g.
One of these cases is defective and its 100 chips weigh 11g each.
In order to determine which of the 41010 cases is defective, the manufacturer has two scales at his disposal:
How can the manufacturer determine the defective case using only 2 times each of the 2 scales?
]]>
Market segmenting is the process of dividing the market into groups who have distinct needs, wants, behaviour or who might want different products and services. Segmentation is usually done along demographic, geographic, attitudinal or behavioural lines. Small segments are often termed niche or speciality markets. However, all segments fall into either consumer or industrial markets.
Assuming the assertion in the above argument are true, which statement must be true?
A. Niche markets are primarily in the consumer space.
B. Segmentation starts with easier demarcations such as geographical and demographical boundaries, and over time, can move into finer directions, such a attitudes and behaviours.
c. The value of market segmentation is that it allows companies to hone and target their marketing messages to different groups , depending on where they live, what their attitudes are,and what behaviour they display.
d. A niche market maybe composed of a group of individuals that share specific characteristics across different segmentation lines , such as living in the same areas, being of a certain age, having similar attitudes, and engaging in similar behaviours.
e. Industrial markets tend to fall more along geographic lines and consumer markets more along demographic, attitudinal, and behavioural lines.
]]>
She said I was a genius. But I said there were two ways to arrive at the answer, and I simply chose the easier way.
A 6-inch [long] hole is drilled through [the center of] a sphere.
What is the volume of the remaining portion of the sphere?
The hard way involves calculus. The easy way uses logic.
]]>Grid 1:
Grid 2:
Note: Since it are 2 seperate grids, the sequence logic is different.
]]>
1) I went into the forest and I got it. When I got it I looked for it, but couldn't find it, so I brought it home in my hand.
2) Born long ago, but made yesterday.
and only employed when others sleep.
What few would wish to give away,
But none would wish forever to keep.
3) I went to Boston and stopped there, and I never went there, and I came home again.
My attempt to make one: (I think it's not that bad )
4) Earth and Water, Fire and Air
Look o'er the earth, you’ll not see me there
Water I make when fire ignites
As air a harbinger of final rites
]]>Every time you open a box, the bug moves from one box to another (either left or right).
How can we find the bug?
]]>If they can guess their numbers, they are free to go.
- Person 1 gets asked if he knows his number. He says he doesn't.
- Person 2 gets asked the same, but also replies that he doesn't know
- Person 3 is being asked but doesn't know either.
Since none of them answered wrong. They get another chance.
- Person 1 again doesn't know.
- Person 2 also doesn't know.
- Person 3 however does know the answer this time: It's 148 on his head. This answer is correct and he is allowed to leave.
Question: What are the numbers on the heads of person 1 and 2 and how does person 3 know his own number?
]]>
After hearing two eyewitness accounts of the same accident, you begin to wonder about history.
]]>x^2+y^2=r; x+y=r, such that the line crosses the circle at exactly two places.
Obviously with two equations and three variables, we have a solution set of answers that can satisfy the given conditions. What I want to know is of the given solutions that satisfies this problem, what is the smallest and largest values x can possibly be?
]]>