Tverberg, H., On a coin tossing problem by G. Bennett, Discrete Mathematics 115 (1993) 293-294. For a certain class of games, Bennett proved that player B never has a smaller chance of winning than player A. Here we give a proof which keeps strictly to the original problem environment. Bennett [ 1
On a Generalised Two-Coin Tossing Problem
β Scribed by Mohanty, S. G.
- Publisher
- Wiley (John Wiley & Sons)
- Year
- 1966
- Weight
- 319 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0006-3452
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract This paper considers a sharing problem of distributing a given quantity of resources to a set of demand nodes in a network as equally as possible. We study the case in which the resources are of two distinct kinds and propose a polynomial time algorithm for it by reducing the problem to
## Abstract An exothermic binary chemical reaction of first order is studied, assuming that one of the reactants can undergo a change of phase. In the limit of low activation energy, a oneβdimensional problem is considered and the wellβposedness of the corresponding system of two parabolic equation