Two Problems Solved with MS-Excel

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F44555601%3A13510%2F02%3A00002157" target="_blank" >RIV/44555601:13510/02:00002157 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Two Problems Solved with MS-Excel

Original language description

The first problem, arising from the theory of graph, is to find the maximum flow in a network. This is equivalent to the problem of finding a minimum cut, according zo 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 and concerns presenting the hint how to solve these two problems simply by application of the commonly used SW MS-Excel.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2002

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

IX. Polish - Czech Math. School

ISBN

1643-6555

ISSN

—

e-ISSN

—

Number of pages

4

Pages from-to

73-76

Publisher name

Uniwersytet Jagelonski

Place of publication

Krakow - Osiecany

Event location

Krakow - Osiecany

Event date

Jan 1, 2002

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—