A thief steals half the total no of loaves of bread plus 1/2 loaf from a bakery. A second thief steals half the reaming no of loaves plus 1/2 loaf and so on. After the 5th thief has stolen there are no more loaves left in the bakery. What was the total no of loaves did the bakery have at the beginning.
No Answer is Posted For this Question
Be the First to Post Answer
4,44,444,4444. Something like this.
25 stations ,24 stations are inbetween- - - - - how many tickets should be required.
A and b can do a piece of work in 15 and 10 days. A and b work on it for sometime and then a leaves b completes the job in 5 days. For how long did a work.
how to clear online aptitude test
1 Answers Scope International,
Last year Jose sold a painting for $2000. If he made a 25% profit on the sale, how much had he paid for the painting?
Shortcut keys in excel : Ctrl + k Ctrl + d Ctrl + y
pls send the model question paper for clerical post in sbi bank on my email id.
0 Answers State Bank Of India SBI,
A works thrice as much as B. If A takes 60 days less than B to do a work then find the number of days it would take to complete the work if both work together?
0 Answers 3i Infotech, Canara Bank, EDS,
Argentina had football team of 22 player of which captain is from Brazilian team and goalki from European team. For remaining player they have picked 6 from Argentinian and 14 from European. Now for a team of 11 they must have goalki and captain so out of 9 now they plan to select 3 from Argentinian and 6 from European. Find out no. of methods available for it
there was a swimming pool of squre shape and it is having four trees at four ends....how to double the size of swimming pool without cutting the trees...?
f(X)= 2X-1 + f(X-1) if X is not equal to zeroandiff(X=0)=0, If f(X)= f(X-1)+f(X-2) for X>1 then X= ?
Alice and Bob play the following coins-on-a-stack game. 20 coins are stacked one above the other. One of them is a special (gold) coin and the rest are ordinary coins. The goal is to bring the gold coin to the top by repeatedly moving the topmost coin to another position in the stack. Alice starts and the players take turns. A turn consists of moving the coin on the top to a position i below the top coin (0 = i = 20). We will call this an i-move (thus a 0- move implies doing nothing). The proviso is that an i-move cannot be repeated; for example once a player makes a 2- move, on subsequent turns neither player can make a 2-move. If the gold coin happens to be on top when it's a player's turn then the player wins the game. Initially, the gold coinis the third coin from the top