Second place prize for Cipher0xp.
Please place bid for $50. This is a prize for "create predictive solution" contest. Please resubmit your solution here. The contest preview format is hard to read, and will allow me to enter only one winner. :)
Thanks!
Jonas
Calculates number of requests for a day:
t = current day
T = total days
P = total population
floor = a predefined function that rounds down to the nearest integer
req (t) = floor[sin(t/T(.9)) * p]
The req function grows rapidly at first then slows to almost nothing. It calculates how many people will request money per a given day. This function can be easily adjusted to the specific population resulting in stronger results.
Calculates amount of money per requester on a day ‘t’:
t = current day
T = total days
TAMT = total money for distribution
amtPRD (t) = [(TMAT / T) / req(t)] – amtPRD(t-1)
The amtPRD function calculates the amount of money to distributed on a given day ‘t’. It accomplishes this by first calculating the total amount of money that can be distributed on the given day ‘t’ then it evenly divides that value among the requesters. After that step it recursively subtracts the money given out on the previous day’(s) leaving you with the result.