# HG changeset patch
# User Jason Scheirer
# Date 1340766433 25200
# Node ID 8c6d1865fe787a413745e6ae5166c083b081019c
# Parent ab94ef09deb39e60925bfbf0d7455435d91a7802
Work-in-progress
diff --git a/problem121.go b/problem121.go
--- a/problem121.go
+++ b/problem121.go
@@ -1,3 +1,15 @@
+/*
+Problem 121
+
+A bag contains one red disc and one blue disc. In a game of chance a player takes a disc at random and its colour is noted. After each turn the disc is returned to the bag, an extra red disc is added, and another disc is taken at random.
+
+The player pays £1 to play and wins if they have taken more blue discs than red discs at the end of the game.
+
+If the game is played for four turns, the probability of a player winning is exactly 11/120, and so the maximum prize fund the banker should allocate for winning in this game would be £10 before they would expect to incur a loss. Note that any payout will be a whole number of pounds and also includes the original £1 paid to play the game, so in the example given the player actually wins £9.
+
+Find the maximum prize fund that should be allocated to a single game in which fifteen turns are played.
+*/
+
package main
import (
@@ -5,16 +17,17 @@
)
func ProbabilityAtN(iteration uint64) float64 {
- return 1. / (float64(iteration) + 2.)
+ return 1. / (float64(iteration) + 1.)
}
func ProbabilityArrayForIterationCount(rounds uint64) []float64 {
- probability_array := make([]float64, rounds)
- for index := uint64(0); index < rounds; index++ {
- probability_array[index] = ProbabilityAtN(index)
+ probability := ProbabilityAtN(rounds)
+ if (rounds <= 1) {
+ return []float64{ probability }
}
- return probability_array
+ probarray := append(ProbabilityArrayForIterationCount(rounds - 1), probability)
+ return probarray
}
func main() {