Question 430300
In total, the player can get 0,1,2,3,4, or 5 heads. Let n(x) denote the number of ways to obtain x heads. We can see that n(0) = n(5), n(1) = n(4), and n(2) = n(3) by a symmetry argument. There are 2^5 = 32 total possible outcomes. Since n(0) + n(2) + n(4) = n(1) + n(3) + n(5), and {{{sum(n(i),i=0,5) = 32}}}, then n(0) + n(2) + n(4) = 16.