So after a 7 day series, I have decided to end the logic contest in this 4th part
Here only my questions will be posted.
Those who want their questions to be covered up here, give their problems to me in Direct Message in slack
This series consists of 5 questions, WITH NO TIME LIMIT
Each question is of 10 marks
Hope you will enjoy the questions.
If you like this contest, Upvote what I will send in slack in #general.
The wizards at Wall Street are up to it again. The Silverbags investment bank has invented the following machine. The machine consists of 6 boxes numbered 1 to 6. When you first get the machine, it contains 6 tokens, one in each box. You have two buttons A, B on the machine and you can press them as many times as you like and in any order. Button A Choose a number i from 1 to 5 and then take one token from box i and magically two tokens will be added to box i + 1.
Button B Choose a number i from 1 to 4 and then take one token from box i and then the contents of boxes i + 1 and i + 2 will be interchanged.
The machine sells for one trillion dollars. The contract says that you can take the machine back to the bank at any time and then the bank will give you one dollar for each token in the machine. Is the machine worth buying?Explain.
Sharky : 5 marks
The presidential elections are to be held in Anchuria. Of 20,000,000 voters only 1 percent (i.e. the regular army) support the current president Wobushko. He wants to be re-elected in a democratic way, which means the following. All voters are split into groups, all of equal size. Then each group can be split into smaller sub-groups of equal size, where is the same for all groups. Then each subgroup is split into equal sub-sub-groups, and so on. Each -group chooses by majority rule one representative to represent it at level i-1, and so on. (If there is a tie, the opposition wins.) Can Wobushko organize the groups and distribute his supporters so that he wins the elections?
Kaustubh: 5 marks, I dont want to give as he cheated, but still I have to!
A knight stays on the upper right corner of a mXm chessboard and wants to go to the bottom left square of the chessboard by passing only once on every square.
The question is if it is possible or not anyway and supply a proof for any of the answers
How many points are there on the earth where you could travel one mile south, then one mile east, then one mile north and end up in the same spot you started?