cleanlogicmathshortHow do you make the number one disappear by adding to it?
Add the letter 'G' and it becomes Gone.
cleanlogicshortThis old one runs forever, but never moves at all. He has not lungs nor throat, but still a mighty roaring call. What is it?
A waterfall.
logicmathshortI know a number which is spelled in an alphabetical order. Do you?
Forty.
logicmathThere are 5 pirates in a ship. Pirates have hierarchy C1, C2, C3, C4 and C5.C1 designation is the highest and C5 is the lowest. These pirates have three characteristics : a. Every pirate is so greedy that he can even take lives to make more money. b. Every pirate desperately wants to stay alive. c. They are all very intelligent.There are total 100 gold coins on the ship. The person with the highest designation on the deck is expected to make the distribution. If the majority on the deck does not agree to the distribution proposed, the highest designation pirate will be thrown out of the ship (or simply killed). The first priority of the pirates is to stay alive and second to maximize the gold they get. Pirate 5 devises a plan which he knows will be accepted for sure and will maximize his gold. What is his plan?
To understand the answer,we need to reduce this problem to only 2 pirates. So what happens if there are only 2 pirates. Pirate 2 can easily propose that he gets all the 100 gold coins. Since he constitutes 50% of the pirates, the proposal has to be accepted leaving Pirate 1 with nothing.
Now let’s look at 3 pirates situation, Pirate 3 knows that if his proposal does not get accepted, then pirate 2 will get all the gold and pirate 1 will get nothing. So he decides to bribe pirate 1 with one gold coin. Pirate 1 knows that one gold coin is better than nothing so he has to back pirate 3. Pirate 3 proposes {pirate 1, pirate 2, pirate 3} {1, 0, 99}. Since pirate 1 and 3 will vote for it, it will be accepted.
If there are 4 pirates, pirate 4 needs to get one more pirate to vote for his proposal. Pirate 4 realizes that if he dies, pirate 2 will get nothing (according to the proposal with 3 pirates) so he can easily bribe pirate 2 with one gold coin to get his vote. So the distribution will be {0, 1, 0, 99}.
Smart right? Now can you figure out the distribution with 5 pirates? Let’s see. Pirate 5 needs 2 votes and he knows that if he dies, pirate 1 and 3 will get nothing. He can easily bribe pirates 1 and 3 with one gold coin each to get their vote. In the end, he proposes {1, 0, 1, 0, 98}. This proposal will get accepted and provide the maximum amount of gold to pirate 5.
logicFind a short hidden message in the list of words below.
carrot fiasco nephew spring rabbit
sonata tailor bureau legacy corona
travel bikini object happen soften
picnic option waited effigy adverb
report accuse animal shriek esteem
oyster
Starting with the first two words, take the first and last letters, reading from left to right. Example: Carrot fiascO "from these pairs" the message is as follows:
CONGRATULATIONS CODE BREAKER
cleanlogicwhat am II’m teary-eyed but never cry,
silver-tongued, but never lie.
double-winged, but never fly,
air-cooled, but never dry.
What am I?
Mercury. The element looks shiny, silver, and is wet. The god Mercury has two wings but only uses them to run.
logicshortA king has 100 identical servants, each with a different rank between 1 and 100. At the end of each day, each servant comes into the king's quarters, one-by-one, in a random order, and announces his rank to let the king know that he is done working for the day. For example, servant 14 comes in and says "Servant 14, reporting in."
One day, the king's aide comes in and tells the king that one of the servants is missing, though he isn't sure which one.
Before the other servants begin reporting in for the night, the king asks for a piece of paper to write on to help him figure out which servant is missing. Unfortunately, all that's available is a very small piece that can only hold one number at a time. The king is free to erase what he writes and write something new as many times as he likes, but he can only have one number written down at a time.
The king's memory is bad and he won't be able to remember all the exact numbers as the servants report in, so he must use the paper to help him.
How can he use the paper such that once the final servant has reported in, he'll know exactly which servant is missing?
When the first servant comes in, the king should write down his number. For each other servant that reports in, the king should add that servant's number to the current number written on the paper, and then write this new number on the paper.
Once the final servant has reported in, the number on the paper should equal
(1 + 2 + 3 + ... + 99 + 100) - MissingServantsNumber
Since (1 + 2 + 3 + ... + 99 + 100) = 5050, we can rephrase this to say that the number on the paper should equal
5050 - MissingServantsNumber
So to figure out the missing servant's number, the king simply needs to subtract the number written on his paper from 5050:
MissingServantsNumber = 5050 - NumberWrittenOnThePaper
logicA new student met the Zen Master after traveling hundreds of miles by yak cart. He was understandably pleased with himself for being selected to learn at the great master's feet .
The first time they formally met, the Zen Master asked, "May I ask you a simple question?" "It would be an honor!" replied the student.
"Which is greater, that which has no beginning or that which has no end?" queried the Zen Master. "Come back when you have the answer and can explain why."
After the student made many frustrated trips back with answers which the master quickly cast off with a disapproving negative nod, the Zen Master finally said, "Perhaps I should ask you another question?"
"Oh, please do!" pleaded the exasperated student.
The Zen Master then asked, "Since you do not know that, answer this much simpler riddle. When can a pebble hold back the sea?" Again the student was rebuffed time and again. Several more questions followed with the same result. Each time, the student could not find the correct answer. Finally, completely exasperated, the student began to weep, "Master, I am a complete idiot. I can not solve even the simplest riddle from you!"
Suddenly, the student stopped, sat down, and said, "I am ready for my second lesson."
What was the Zen Master's first lesson?
The student's first lesson was that in order to learn from the Zen Master, the student should be asking the questions and not the Zen Master.
logicA fancy restaurant in New York was offering a promotional deal. A married couple could eat at the restaurant for half-price on their anniversary. To prevent scams, the couple would need proof of their wedding date. One Thursday evening, a couple claimed it was their anniversary, but didn't bring any proof. The restaurant manager was called to speak with the couple. When the manager asked to hear about the wedding day, the wife replied with the following: "Oh, it was a wonderful Sunday afternoon, birds were chirping, and flowers were in full bloom." After nearly 10 minutes of ranting, she comes to tell him that today was their 28th wedding anniversary.
"How lovely", the manager said, "However, you do not qualify for the discount. Today is not your anniversary, you are a liar".
How did the manager know that it wasn't their anniversary?
The calendar repeats itself every 28 years. So, if they were married on a Sunday 28 years ago, the day they were at the restaurant would also have to be a Sunday. Since it was a Thursday, the manager knew they were lying, and abruptly kicked them out of his restaurant.
logicThis is an unusual paragraph. I’m curious as to just how quickly you can find out what is so unusual about it. It looks so ordinary and plain that you would think nothing was wrong with it. In fact, nothing is wrong with it! It is highly unusual though. Study it and think about it, but you still may not find anything odd. But if you work at it a bit, you might find out. Try to do so without any coaching.
The letter "e", which is the most common letter in the English language, does not appear once in the long paragraph.
