Question-1 : Do you Plan your typical day in Life (Personal as well as Professional work) ?

Why shou

Question-2 : When should we Not Plan ? (Planning is a Umbrella Process to all Execution - Make, So

Question-3 : Numbers from 1 to 40 are Written on the White Marker Board in any Order (not necessari
Then a Operation Step is done several times.
Each Operation Step involves Rubbing 2 Numbers from the Board and replacing it with th
e.g. : If 'a' and 'b' are rubbed off, write a+b-1 on the board. So If 14 and 5 are rubbed off,
This Operation is continuously done until finally only 1 Number is left on the Board.

What is the Number Left on the Board ?

Choices : 1 819
2 781
3 It is Impossible to Determine. There are too many Possibilities to Rub from boa
4 1560
5 It is Possible to Determine via a Computer iteratively. And There are a few Fini
6 39

Question-4 : There is a Recurring Number less than 1 such that it is of the form 0.abcabcabcabc ….
Where digits a, b and c are recurring. AND a,b and c cannot be all 0 at the same time.
e.g. : 0.138138138138138138138 …. Or 0.014014014014014014014 ….

By what number below if this number is multiplied will it always result in a Integer Number

Choices : 1 abc
2 198
3 Cannot be determined
4 1000
5 2997
6 1899

Question-5 : Repeat Question-3 above on 40 Numbers and keep doing the Operation until 3 Numbers

What can you say about the Numbers left on the Board ?

Choices : 1 The Sum of the Three Numbers will be 817

2 The Sum of the Three Numbers will be 1440
3 It is Impossible to Determine the 3 Numbers. There are too many Possibilities
4 The Three Numbers are 38, 39 & 40
5 The Sum of the Three Numbers will be 783
6 It is Possible to Determine via a Computer iteratively. And There are a few Fini

Question-6 : Numbers from 1 to 40 are Written on the White Marker Board in any Order (not necessari
Then a Operation Step is done several times.
Each Operation Step involves Rubbing 4 Numbers from the Board and replacing it with th
e.g. : If 'a', 'b', 'c','d' are rubbed off, write a+b+c+d-5 on the board. So If 12,5,1,2 are rubb
This Operation is continuously done until finally only 1 Number is left on the Board.
 What is the Number Left on the Board ?

Choices : 1 625
2 755
3 It is Impossible to Determine. There are too many Possibilities to Rub from boa
4 520
5 It is Possible to Determine via a Computer iteratively. And There are a few Fini
6 65

Question-7 : Four Friends 'A', 'B', 'C' and 'D' have to Cross a 200 Mtrs Long Bridge. Only 2 can max. C
to use a Single Oil Lantern that they have with them. When 2 Cross they have to walk at
A' can cross in 1 Minute, 'B' can cross in 2 Minutes, 'C' can cross in 7 Minutes and 'D' ca

In What Minimum time can all the four friends cross the Bridge in ?

Choices : 1 21
2 20
3 12
4 17
5 Not Possible to Determine

Question-8 : A Woman has a Quarrel and her Multi-threaded Pearl Necklace gets Broken. 1/3rd of the
Of the Remaining, One half of the Pearls fall elsewhere and then again One half of the Re
… Six Times … scatter everywhere else. Finally 16 Pearls are left in the broken Necklace

How many Pearls were there Originally in the Necklace ?

Choices : 1 192
2 1024
3 512
4 2048
5 96
al work) ? Why should "Planning" be done ahead of Execution time ? Planning is a MUST. Execution done withou

Execution - Make, Source, Deliver and Return Processes) Usually never, but Ok in case of Emergency

Order (not necessarily Sequential).

nd replacing it with the Sum of those Numbers minus one.

and 5 are rubbed off, 18 is added (14+5-1) back to the Board.
t on the Board.

*
bilities to Rub from board and add to Board to determine a Single answer.

d There are a few Finite Possibilities of answer. But not 1 answer.

.abcabcabcabc ….
all 0 at the same time.

lt in a Integer Number (no decimal).

ation until 3 Numbers are left on the Board.

oo many Possibilities to Rub from board and add to Board to determine a Single answer.

*
d There are a few Finite Possibilities of answer.

Order (not necessarily Sequential).

nd replacing it with the Sum of those Numbers minus FIVE.

So If 12,5,1,2 are rubbed off, 15 is added (12+5+1+2-5) back to the Board.
t on the Board.
 *
bilities to Rub from board and add to Board to determine a Single answer.

d There are a few Finite Possibilities of answer. But not 1 answer.

ge. Only 2 can max. Cross together at a time and it is night time so they have
s they have to walk at the Speed of the Slowest Partner.
n 7 Minutes and 'D' can cross in 10 Minutes.

s Broken. 1/3rd of the Pearls fall towards her and 1/6th of the Pearls scatter on the Bed.
ain One half of the Remaining Pearls and then again One half of the Remaining Pearls …. And so on …
the broken Necklace.

*
Execution done without Planning always leads to higher Cost (e.g. : Flight or Hotel Travel tickets Purchased last minute vs M

n case of Emergency (e.g. : Medical, Life-and-Death matter)

ased last minute vs Months in advance).

SUM of Numbers keeps reducing by 1 with Every Operation of Rubbing 2 Num

1000x = abc.abcabc…, x = 0.abcabc… So Subtracting & Evaluating, x = ab

The Three numbers cannot be determined, but their SUM will be 783 (820-37)
SUM of Numbers keeps reducing by 5, and 3 Numbers reduced with Every Op

Our Mind tends to put the slowest & fastest first to move the slowest fastest, b

Let Total Necklace Pearls =n. Initially n-n/3-n/6 = n/2 remains. This is then ha
tion of Rubbing 2 Numbers and adding 1 number pf SUM minus 1 … do 39 times for last number = n*(n+1)/2 - 39 times =

g & Evaluating, x = abc / 999. Number is divisible by 999 to get a Integer and 2997 is divisible by 999 (999x3)

M will be 783 (820-37). See Q1 above.

educed with Every Operation of Rubbing 4 Numbers and adding 1 number of SUM minus 5 … do 13 times (3*13=39) for las

the slowest fastest, but that's not the solution - they all lead to Solutions more than 21-27 minutes but the fastest solution is

mains. This is then halved 6 times = (n/2)*(1/2)*(1/2)…6 times = n/(2^(6+1)) = n/(2^7) = 16, so n = 16 * (2^7) = 16 * 128 =
*(n+1)/2 - 39 times = 820-39 = 781
imes (3*13=39) for last number = n*(n+1)/2 - (13*5) times = 820-65 = 755

the fastest solution is something else. First A&B go & A returns = 2+1=3, then C & D goes and B returns = 10+2=12+3 pr

16 * (2^7) = 16 * 128 = 2048 pearls

turns = 10+2=12+3 prev =15 minutes, then A & B go = 2 minutes+ prev 15 = 17 Minutes Total