Question

A. King Take a break and solve this puzzle.. A king asks a learned man to visit his palace. The man says I will come any day next month. But give me gold in gms equal to the date on which I come. The king asks the jeweler to make rings of 1 to 31 gms. The jeweler was smart and makes only 5 rings. What was the weights of those rings?

Answer 1

n consecutive powers of 2 will give all the numbers till 2^(n+1) -1.

powers of 2 are

2^0 = 1 , 2^1 = 2 ,  2^2 =4 ,2 ^3 = 8 ,2^4 = 16,2^5 = 32

Lets take 8 which is ( 2 ^ 3[n+1] ) so with 2s power till 2(n) we should get all numbers till 8-1 = 7.

7 =  2^2 + 2^1 + 2^06 = 2^2 + 2^15 = 2^2+ 14=2^23 = 2^1 +12 = 2^11= 2^0

Similarly, 32 is 2 ^ 5.

so 2s power of 0,1,2,3,4 will give all numbers till 31.

so the answer is 1,2,4,8,16.

Answer 2

I think correct answer will be 155 gms

HOPE THIS HELPS YOU