Substitute each of the small letters by a different digit from 0 to 9 to satisfy this set of alphametic relationships. None of the numbers can contain any leading zero.
(elvis)*a + presley + 1935 + 1977 + p = ppppppp, and:
play is divisible by 17
A well-known method of dividing a cake between two people is to have the first person to cut the cake and have the second person to have the first pick. This will guarantee that the first person will cut the cake in half so that the second person cannot leave him with a smaller piece.
Now we want to divide the cake among n people. Let's make the following assumptions:
(a) Each person cannot cut the cake more than once
(b) Everyone is logical
(c) Everyone wishes to get the largest possible piece
(d) Everyone wishes to narrow the gap with those who have a bigger piece than he does
(e) No one cares about anyone who has a smaller piece than themselves.
Can you generalize the strategy to n people? Give your logical steps/proof that this strategy will yield a fair result.
Latest: 
Bonus: 
