Solution:

$2000

Explanation:
Profit from 1st transaction = $1000 (23000-22000)
Profit from 2nd transaction = $1000 (24000-24000)

So the overall profit will be = $2000.

Solution:

He simply suggested that one of the brothers will be allowed to divide the land but he must take into consideration that it will be the other one who will have a choice of selecting his land between the two halves first.

Thus both will be happy in such manner.

Solution:

10 prisoners must sample the wine. Bonus points if you worked out a way to ensure than no more than 8 prisoners die.

Number all bottles using binary digits. Assign each prisoner to one of the binary flags. Prisoners must take a sip from each bottle where their binary flag is set.

Here is how you would find one poisoned bottle out of eight total bottles of wine.

Bottle 1 Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle 6 Bottle 7 Bottle 8
Prisoner A X X X X
Prisoner B X X X X
Prisoner C X X X X
In the above example, if all prisoners die, bottle 8 is bad. If none die, bottle 1 is bad. If A & B dies, bottle 4 is bad.

With ten people there are 1024 unique combination so you could test up to 1024 bottles of wine.

Each of the ten prisoners will take a small sip from about 500 bottles. Each sip should take no longer than 30 seconds and should be a very small amount. Small sips not only leave more wine for guests. Small sips also avoid death by alcohol poisoning. As long as each prisoner is administered about a milliliter from each bottle, they will only consume the equivalent of about one bottle of wine each.

Each prisoner will have at least a fifty percent chance of living. There is only one binary combination where all prisoners must sip from the wine. If there are ten prisoners then there are ten more combination where all but one prisoner must sip from the wine. By avoiding these two types of combination you can ensure no more than 8 prisoners die.

One viewer felt that this solution was in flagrant contempt of restaurant etiquette. The emperor paid for this wine, so there should be no need to prove to the guests that wine is the same as the label. I am not even sure if ancient wine even came with labels affixed. However, it is true that after leaving the wine open for a day, that this medieval wine will taste more like vinegar than it ever did. C'est la vie.

Solution:

White should move the rook from
A1 to D1 and hence complete the castling move.

Solution:

There is no reason whatever why the customer's original deposit of Rs.100 should equal the total of the balances left after each withdrawal.
The total of withdrawals in the left-hand colum may equal Rs.100, but is is purely coincidence that the total of the right-hand column is close to Rs.100.
Let us show another example, but starting with Rs.200 in the bank:
Withdrawals Balance left
Rs.50 Rs.150
Rs.25 Rs.125
Rs.10 Rs.115
Rs.8 Rs.107
Rs.5 Rs.102
Rs.2 Rs.100
Rs.100 Rs.699
Moral of this story? Don't Total Balances

Solution:

Ganpat had a black suit and a brown suit.
Harish had a brown suit and a pink suit.
Manoj had a white suit and a black suit.
Tarun had a pink suit and a white suit.

Solution:

Can be found on the pic below.

Solution:

1653

Explanation:
For an ideal case, the batsman will hit a six on each ball. But if he hits six on the last ball of the over, the strike will change in the next over. Thus, the best he can do in the last ball is run 3 runs so that he retains the strike even in the next over. Thus the total runs that he can score in each over:
6 * 5 + 3 = 33
But this will have to go like it only till the 49th over. In the last over, he can hit a six in the last ball as well as that will be the last ball of the match.
Thus runs for the last over will be 6 * 6 = 36.
Hence the maximum runs = 33 * 49 + 36 = 1653

Solution:

457730 * 4 = 1830920
(DOLLAR * 4 = QUARTER)

Solution:

The first step that they will take will be a leap of logic. What it means is that they will deduce that every color must appear twice at least. Why? Because the master logician has assured them that the puzzle will not be impossible for anyone of them. And if a color appears only once in the circle, the person wearing it will have no clue about that color which will not be fair for him.

Then the logicians will follow the same and look for all the colors of hats in the circle. If one of them sees a color just once, he can safely assume that he is also wearing the hat of the same color as by leap of logic, no color can appear just once. Thus when the bell is rung, he will leave.

In the similar fashion, if anyone sees another color just once, he can determine that he is wearing the hat of the same color and will leave when the bell rings or will be disqualified and sent home. Unvaryingly, if a color is seen twice, they will be eliminated after the first bell. Hence, there must be at least three hats of any of the remaining color.

Assume that you are sitting in the circle and you don’t see a color once but see it twice. Then if they were the only two hats of the same color, the logicians must have left at the first bell already. But they did not. Which means that there are three hats of that color and you are wearing one. Thus you will leave after the second bell.

Solution:

One of the cop will move clockwise while the other will move anti-clockwise every day. In such a manner, they will catch the thief in minimum seven days.