One day King Lear visited his three daughters, Regan, Goneril and Cordelia.
Arriving at Regan's, he gave the guard one gold coin and gave Regan half the gold coins he had. On leaving, he gave the guard another gold coin.
Then he went to Generil's and Cordelia's and did exactly the same he did at Regan's, which made him penniless.
How many gold coins did Lear have at the beginning of his visit to his three daughters?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I really like this backward way. Still there is another nice way to solve it. Could you figure it out?
What if the King had n daughters?
Let c n be the least number of coins he would have to bring to keep n daughters (and their guards) happy. To leave a daughter with c coins in his royal pockets, he had to arrive with 2 c + 3 . Thus c n = 2 c n − 1 + 3 or c n + 3 = 2 ( c n − 1 + 3 ) , so that c n + 3 = 2 n ( c 0 + 3 ) = 3 × 2 n and c n = 3 ( 2 n − 1 ) .
For his three daughters he has to bring 3 × 7 = 2 1 coins.
Let the number of coins the king had be x then :
When he visits Regan he gives 1 coin to gaurd, now he is left with x − 1 coins,
Then he gives half to Regan and now is left with 2 ( x − 1 ) coins
Now he gives one to the gaurd again leaving him with 2 x − 3 coins.
Similarly, now he goes to visit Generil, gives one to gaurd and is left with 2 x − 5
Then he gives half to Generil and has 4 x − 5 coins left
Before leaving he gives a coin to the gaurd, now he has 4 x − 9 coins left.
Same goes with Coedelia, the King gives a coin to gaurd and is left with 4 x − 1 3
Now he gives half coins to Cordelia, so coins left = 8 x − 1 3
Then gives a coin to the guard, remaining coins = 8 x − 2 1
Now, since he has 0 coins left we equate 8 x − 2 1 to 0, therefore: 8 x − 2 1 = 0
x − 2 1 = 0
x = 2 1
Let the number of gold coins to start with be n , and the numbers Regan, Goneril and Cordelia get be r , g and c respectively.
Then n = 1 + r + 1 + 1 + g + 1 + 1 + c + 1 = r + g + c + 6
We note that:
r g c ⇒ n ⇒ 8 n ⇒ n = 2 n − 1 = 2 1 ( n − 2 n − 1 − 3 ) = 2 1 ( 2 2 n − n + 1 − 6 ) = 4 n − 5 = 2 1 ( n − 2 n − 1 − 4 n − 5 − 5 ) = 2 1 ( 4 4 n − 2 n + 2 − n + 5 − 2 0 ) = 8 n − 1 3 = 2 n − 1 + 4 n − 5 + 8 n − 1 3 + 6 = 8 4 n − 2 + 2 n − 1 0 + n − 1 3 + 4 8 = 7 n + 2 1 = 2 1
Wonderful. That's it.
If 8 n = 7 n − 2 1 wouldn't n = − 2 1 ????
Problem Loading...
Note Loading...
Set Loading...
Working Backwards is the Key!
0+1= 1; 1 2= 2; 2+1= 3; 3+1= 4; 4 2= 8; 8+1= 9; 9+1= 10; 10*2= 20; 20+1= 21
Bravo, 21.