Six jugs are in a row. The first three are filled with coke, and the last three are empty. By moving only one glass, can you arrange them so that the full and the empty glasses alternate?

Move and then pour all coke from second glass to fifth glass.

A poor miller living with his daughter comes onto hard times and is not able to pay his rent. His evil landlord threatens to evict them unless the daughter marries him.
The daughter, not wanting to marry the landlord but fearing that her father won't be able to take being evicted, suggests the following proposition to the landlord. He will put two stones, one white and one black, into a bag in front of the rest of the townspeople. She will pick one stone out of the bag. If she picks the white stone, the landlord will forgive their debt and let them stay, but if she picks the black stone, she will marry the landlord, and her father will be evicted anyway.
The landlord agrees to the proposal. Everybody meets in the center of the town. The landlord picks up two stones to put in the bag, but the daughter notices that he secretly picked two black stones.
She is about to reveal his deception but realizes that this would embarrass him in front of the townspeople, and he would evict them. She quickly comes up with another plan. What can she do that will allow the landlord save face, while also ensuring that she and her father can stay and that she won't have to marry the landlord?

The daughter picks a stone out, keeps it in her closed hand, and proclaims "this is my stone." She then throws it to the ground, and says "look at the other stone in the bag, and if it's black, that means I picked the white stone." The landlord will reveal the other stone, which is obviously black, and the daughter will have succeeded. The landlord was never revealed as a cheater and thus was able to save face.

Create a number using only the digits 4,4,3,3,2,2,1 and 1.
So I can only be eight digits.
You have to make sure the ones are separated by one digit, the twos are separated by two digits the threes are separated with three digits and the fours are separated by four digits.

Even though the odds are always in favor of the gambling house, why does the establishment insist on a house limit on stakes?

Every casino in the world would go bankrupt without a house limit on stakes. Without it, gamblers would keep doubling their stakes until they won. No matter how bad a losing streak they were on, they would eventually win. For more information, search: Martingale

Consider the following explanation for why 1=2:
1. Start out Let y = x
2. Multiply through by x xy = x2
3. Subtract y2 from each side xy - y2 = x2 - y2
4. Factor each side y(x-y) = (x+y)(x-y)
5. Divide both sides by (x-y) y = x+y
6. Divide both sides by y y/y = x/y + y/y
7. And so... 1 = x/y + 1
8. Since x=y, x/y = 1 1 = 1 + 1
8. And so... 1 = 2
How is this possible?

Step 5 is invalid, because we are dividing by (x-y), and since x=y, we are thus dividing by 0. This is an invalid mathematical operation (division by 0), and so by not followinng basic mathematical rules, we are able to get strange results like these.

At a dinner party, many of the guests exchange greetings by shaking hands with each other while they wait for the host to finish cooking.
After all this handshaking, the host, who didn't take part in or see any of the handshaking, gets everybody's attention and says: "I know for a fact that at least two people at this party shook the same number of other people's hands."
How could the host know this? Note that nobody shakes his or her own hand.

Assume there are N people at the party.
Note that the least number of people that someone could shake hands with is 0, and the most someone could shake hands with is N-1 (which would mean that they shook hands with every other person).
Now, if everyone at the party really were to have shaken hands with a different number of people, then that means somone must have shaken hands with 0 people, someone must have shaken hands with 1 person, and so on, all the way up to someone who must have shaken hands with N-1 people. This is the only possible scenario, since there are N people at the party and N different numbers of possible people to shake hands with (all the numbers between 0 and N-1 inclusive).
But this situation isn't possible, because there can't be both a person who shook hands with 0 people (call him Person 0) and a person who shook hands with N-1 people (call him Person N-1). This is because Person 0 shook hands with nobody (and thus didn't shake hands with Person N-1), but Person N-1 shook hands with everybody (and thus did shake hands with Person 0). This is clearly a contradiction, and thus two of the people at the party must have shaken hands with the same number of people.
Pretend there were only 2 guests at the party. Then try 3, and 4, and so on. This should help you think about the problem.
Search: Pigeonhole principle

A man comes to a small hotel where he wishes to stay for 7 nights. He reaches into his pockets and realizes that he has no money, and the only item he has to offer is a gold chain, which consists of 7 rings connected in a row (not in a loop).
The hotel proprietor tells the man that it will cost 1 ring per night, which will add up to all 7 rings for the 7 nights.
"Ok," the man says. "I'll give you all 7 rings right now to pre-pay for my stay."
"No," the proprietor says. "I don't like to be in other people's debt, so I cannot accept all the rings up front."
"Alright," the man responds. "I'll wait until after the seventh night, and then give you all of the rings."
"No," the proprietor says again. "I don't like to ever be owed anything. You'll need to make sure you've paid me the exact correct amount after each night."
The man thinks for a minute, and then says "I'll just cut each of my rings off of the chain, and then give you one each night."
"I do not want cut rings," the proprietor says. "However, I'm willing to let you cut one of the rings if you must."
The man thinks for a few minutes and then figures out a way to abide by the proprietor's rules and stay the 7 nights in the hotel. What is his plan?

The man cuts the ring that is third away from the end of the chain. This leaves him with 3 smaller chains of length 1, 2, and 4. Then, he gives rings to the proprietor as follows:
After night 1, give the proprietor the single ring
After night 2, take the single ring back and give the proprietor the 2-ring chain
After night 3, give the proprietor the single ring, totalling 3 rings with the proprietor
After night 4, take back the single ring and the 2-ring chain, and give the proprietor the 4-ring chain
After night 5, give the proprietor the single ring, totalling 5 rings with the proprietor
After night 6, take back the single ring and give the proprietor the 2-ring chain, totalling 6 rings with the proprietor
After night 7, give the proprietor the single ring, totalling 7 rings with the proprietor

Once upon a time, in the West Lake village, a servant lived with his master. After service of about 30 years, his master became ill and was going to die.
One day, the master called his servant and asked him for a wish. It could be any wish but just one. The master gave him one day to think about it. The servant became very happy and went to his mother for discussion about the wish. His mother was blind and she asked her son for making a wish for her eye-sight to come back. Then the servant went to his wife. She became very excited and asked for a son as they were childless for many years. After that, the servant went to his father who wanted to be rich and so he asked his son to wish for a lot of money. The next day he went to his master and made one wish through which all the three (mother, father, wife) got what they wanted. You have to tell what the servant asked the master.

The servant said, "My mother wants to see her grandson swinging on a swing of gold."