Two problems solved with MS-Excel

Abstract

The first problem arising in the theory of graphs is to find the maximum flow in a network. This is equivalent to the problem of finding a minimum cut, according to Ford-Fulkerson algorithm, which is briefly explained. The second, the probabilistic problem solved by Bernoulli, is to calculate the probability that certain sum is obtained when throwing a dice several times. This contribution briefly presents a recurrent solution for a generalized dice with any number of possible values, with a hint how to solve these two problems simply using the commonly known SW MS-Excel.