WIP Add script for creating drawables (png files shown in the app)

app/src/main/res/values/strings.xml

@@ -620,7 +620,7 @@
         <item>This one is very similar to the fox problem: the answer is simple if you use linearity of expectation. If you focus on the women, for example, the answer is 8*E[X_1], where X_1 is the number of men sitting next to woman number one, i.e. X_1 is either 0, 1 or 2.</item>
         <item>Try solving the previous puzzle first (read its hint if you are stuck). The only difference here is accounting for the probability of sitting at the ends of the table, in which case you have only one neighbor. Intuitively, this should lead to a smaller number than in the previous puzzle. See https://stats.stackexchange.com/a/509919/9330 for a detailed solution.</item>
         <item>The definition of correlation is Corr[X, Y] = Cov[X, Y] / (Var[X]*Var[Y])^0.5, and you can reach the answer by following the definitions and integrating. A trick is to think of a regression of writing ability on math ability conditional on attending college &#8212; the slope of that regression line will give the correlation. Make sure you understand why that works!</item>
-        <item>Use the inclusion-exclusion principle. The two-event version is Pr[A or B] = Pr[A] + Pr[B] - Pr[A and B]; you need to use the n-event version where n is the number of people (and also the number of hats).</item>
+        <item>Use the inclusion-exclusion principle. The two-event version is Pr[A or B] = Pr[A] + Pr[B] - Pr[A and B]; you need to use the n-event version where n is the number of people (and also the number of hats). See https://stats.stackexchange.com/questions/464727/unexpected-result-from-very-simple-statistics-problem for a solution to a very similar problem.</item>
         <item>Starting at any positive initial wealth x, think about the probability of ever reaching state (x - 1). The answer you\'re looking for is just the square of that probability: to go broke you have to at some point reach a wealth of $1, and then, having gotten there, at some point reach a wealth of $0.</item>
         <item>Suppose I were asking about a resample of size five from a collection of five objects. Picture five dots and four bars laid out in a line, like this: oo|o||oo|. That particular sequence represents a resample in which the first object is sampled twice, the second once, the third never, the fourth twice, and the fifth never. How many distinct sequences can be generated using the same number of circles and bars?</item>
         <item>Start by calculating the expected number of total visits to the origin. What is the connection between that number and the probability of ever returning?</item>