Last December, at Christmas Eve, Nagib called his three sons, Abdon, Fairuz and Samara, and gave them 90 turkeys to be sold at the fair.

- "Abdon, you will carry 10 turkeys. You, Fairuz, will carry 30 turkeys, and Samara the remaining 50 turkeys, and each one of you has to bring me $1,500 after selling all the turkeys.

Abdon is free to devise the strategy you all will use, that is, the price of one turkey established by Abdon for a group of turkeys must be exactly the same that you two have to follow.

Explaining better a two-step strategy: if Abdon decides to sell 4 of them by $1200 ($300 each), you two must sell any quantity you want, but by the same unit price ($300 each turkey). Then, if Abdon decides to sell the remaining 6 turkeys he has by $300 ($50 each), you two must sell your remaining turkeys by this same unit price ($50 each turkey).

But, I am not forcing that the strategy devised by Abdon must consist of only two steps. I gave you just an example which, by the way, doesn´t work for what I want. Moreover, in the strategy devised, in each step all three must sell at least one turkey, by an unitary price greater than zero."

What is the strategy devised by Abdon to insure that each one gathers exactly $1,500 for the turkeys they carried to the fair?

(In reply to additional solution for non-whole dollar prices by Charlie)

I read your 4 solutions. Maybe your program is missing something. If (A) decides to sell, say, 3 tk @ 100, the unitary price is 33,33333... which is valid, once the others sells multiples of 3 to achieve whole number of dollars.  

Posted by pcbouhid on 2008-12-03 12:46:31