Riddle #782

logic

Engineers and Managers

You have just purchased a small company called Company X. Company X has N employees, and everyone is either an engineer or a manager. You know for sure that there are more engineers than managers at the company. Everyone at Company X knows everyone else's position, and you are able to ask any employee about the position of any other employee. For example, you could approach employee A and ask "Is employee B an engineer or a manager?" You can only direct your question to one employee at a time, and can only ask about one other employee at a time. You're allowed to ask the same employee multiple questions if you want. Your goal is to find at least one engineer to solve a huge problem that has just hit the company's factory. The problem is so urgent that you only have time to ask N-1 total questions. The major problem with questioning the employees, however, is that while the engineers will always tell you the truth about other employees' roles, the managers may lie to you if they like. You can assume that the managers will do their best to confuse you. How can you find at least one engineer by asking at most N-1 questions?
You can find at least one engineer using the following process: Put all of the employees in a conference room. If there happen to be an even number of employees, pick one at random and send him home for the day so that we start with an odd number of employees. Note that there will still be more engineers than managers after we send this employee home. Then call them out one at a time in any order. You will be forming them into a line as follows: If there is nobody currently in the line, put the employee you just called out in the line. Otherwise, if there is anybody in the line, then we do the following. Let's call the employee currently at the front of the line Employee_Front, and call the employee who we just called out of the conference room Employee_Next. So ask Employee_Front if Employee_Next is a manager or an engineer. If Employee_Front says "manager", then send both Employee_Front and Employee_Next home for the day. However, if Employee_Front says "engineer", then put Employee_Next at the front of the line. Keep doing this until you've called everyone out of the conference room. Notice that at this point, you'll have asked N-1 or less questions (you asked at most one question each time you called an employee out except for the first employee, when you didn't ask a question, so that's at most N-1 questions). When you're done calling everyone out of the conference room, the person at the front of the line is an engineer. So you've found your engineer! But the real question: how does this work? We can prove this works by showing a few things. First, let's show that if there are any engineers in the line, then they must be in front of any managers. We'll show this with a proof by contradiction. Assume that there is a manager in front of an engineer somewhere in the line. Then it must have been the case that at some point, that engineer was Employee_Front and that manager was Employee_Next. But then Employee_Front would have said "manager" (since he is an engineer and always tells the truth), and we would have sent them both home. This contradicts their being in the line at all, and thus we know that there can never be a manager in front of an engineer in the line. So now we know that after the process is done, if there are any engineers in the line, then they will be at the front of the line. That means that all we have to prove now is that there will be at least one engineer in the line at the end of the process, and we'll know that there will be an engineer at the front. So let's show that there will be at least one engineer in the line. To see why, consider what happens when we ask Employee_Front about Employee_Next, and Employee_Front says "manager". We know for sure that in this case, Employee_Front and Employee_Next are not both engineers, because if this were the case, then Employee_Front would have definitely says "engineer". Put another way, at least one of Employee_Front and Employee_Next is a manager. So by sending them both home, we know we are sending home at least one manager, and thus, we are keeping the balance in the remaining employees that there are more engineers than managers. Thus, once the process is over, there will be more engineers than managers in the line (this is also sufficient to show that there will be at least one person in the line once the process is over). And so, there must be at least one engineer in the line. Put altogether, we proved that at the end of the process, there will be at least one engineer in the line and that any engineers in the line must be in front of any managers, and so we know that the person at the front of the line will be an engineer.
93.98 %
42 votes

Similar riddles

See also best riddles or new riddles.

cleanfunnylogicshort

Chimney

What can go up a chimney down but not down a chimney up?
An umbrella.
89.07 %
38 votes

logic

Escaped from jail

Jay escaped from jail and headed to the country. While walking along a rural road, he saw a police car speeding towards him. Jay ran toward it for a short time and then fled into the woods. Why did he run toward the car?
Jay was just starting to cross a bridge when he saw a police car. He ran toward the car to get off the bridge before running into the woods.
84.80 %
46 votes

cleanlogicshort

It never gets past twelve

Had at work day and night, it counts the numbers over and over. Although it counts all its life, it never gets past twelve.
Clock.
89.58 %
40 votes

logicshortwhat am I

Five letter word

I am a five letter word. If you remove all letters one by one from the last, I sound the same! What am I?
QUEUE! QUEU! QUE! QU! Q!
90.04 %
42 votes

logicshortwhat am I

Present in sun, but not in rain

Only one color, but not one size. Stuck at the bottom, yet I easily fly. Present in sun, but not in rain. Doing no harm, and feeling no pain. What Am I?
Shadow.
88.20 %
48 votes

logicmathshort

Subtract 5 from 25

How many times can you subtract 5 from 25?
Just once, because after you subtract anything from it, it's not 25 anymore.
87.46 %
45 votes

cleanlogicshort

Stop the stealing

One company had two factories, in different parts of the country, that were making the same style of shoes. In both factories, workers were stealing shoes. How, without using any security, could that company stop the stealing?
Make one factory make the left shoe, and the other make the right shoe.
90.04 %
42 votes

logicmath

Note: This riddle must be done IN YOUR HEAD ONLY and NOT using paper and a pen. Take 1000 and add 40 to it. Now add another 1000. Now add 30. Another 1000. Now add 20. Now add another 1000. Now add 10. What is the total?
The answer is 4100, check it out on a calculator. Did you think it was 5000? Most people add the 100 as 1000 by mistake.
89.81 %
41 votes