In Problem 6, Euler turns his attention to finding the fair prize for a wager one écu. In this discussion, it is clear that Euler is considering a more elaborate lottery scheme than Roccolini's where, for example, a gambler playing terno must match all three of his k=3 selections. In the "Reflections" paper, Euler will award a prize F_{k,i} if i of the players' k numbers match the t numbers drawn, for any 0 < i £ k.
To do this, Euler simply chooses k positive numbers satisfying a_{k,1} + a_{k,2} + ¼+ a_{k,k} = 1, and award prizes
F_{k,i} = 
a_{k,i}
p_{k,i}

. 

Then the expected payoff for a ticket costing one
écu is

k
å
i=1

p_{k,i}F_{k,i} = 
k
å
i=1

a_{k,i} = 1. 

Absent a notation uniform in k, the discussion of this simple point is surprisingly tedious, and is handled one case at a time, ending at k=5. "It's not likely that we'd need to consider more than 5 numbers," Euler says, "as the prizes would be too exorbitant". Of course, it's precisely these `exorbitant' prizes that make so many contemporary lotteries so very irresistible.
The a_{k,i}s are not uniquely determined, unless k=1. So for k > 1, Euler discusses three possible weighting schemes:
 1. uniform weights
 2. binomial weights
 3. modified binomial weights
a_{k,i} = 
M_{k}

where M_{k} = 
k
å
i=1

(ki+1) 
æ
ç
ç
è 

ö
÷
÷
ø 


Euler motivates methods 2 and 3 as progressively minimizing the impact of large prizes, corresponding to large values of i, on the bank. Curiously, he gives neither formulas nor even explanations for these weights, but simply tabulates the coefficients up to the case k=5. I am grateful to Prof. Stephen Bloch of my department for help in solving the riddle of how the coefficients in method 3 were arrived at.
To illustrate these methods, let us compare in Table 3 the values of a_{5,i} in the three cases.
Method 
i=1 
i=2 
i=3 
i=4 
i=5 
1 





2 





3 





Table 3: coefficients for k=5 