This is the solution I wrote to the problem presented in Part 1.
Let:
I said to the programmer who had presented the problem: ‘Now, you said that the total of all probabilities must be equal to one, so we have’:
At this point another programmer who had come over to my desk said: ‘How the hell do you solve an equation with four unknowns?’
‘Well, first, we have more information, because he said that for every wizard, there should be two bladesmiths. This means that it is twice more probable to be a bladesmith than a wizard’, i.e.:
Similarly:
‘Since , and can be expressed in terms of , we really have only one unknown, ’. Which we solve by substituting eq. 2, eq. 3 and eq. 4 into eq. 1:
Having found the value of , we trivially find the values of , and by substituting eq. 5 back into eq. 2, eq. 3 and eq. 4: