Mathematical and Physical Journal
for High Schools
Issued by the MATFUND Foundation
Already signed up?
New to KöMaL?

Problem C. 1298. (May 2015)

C. 1298. The accompanying diagram shows a park with line segments representing the footpaths (in the diagram ``Bejárat'' = ``Entrance'', ``Kijárat'' = ``Exit''). In how many ways is it possible to get from the entrance to the exit if it is not allowed to leave the footpaths, and each footpath is walked at most once?

(5 pont)

Deadline expired on June 10, 2015.


Statistics:

40 students sent a solution.
5 points:Bindics Boldizsár, Bottlik Judit, Egyházi Anna, Fehér Balázs, Fekete Balázs Attila, Fényes Balázs, Fülöp Erik, Glasznova Maja, Jakus Balázs István, Kasó Ferenc, Klász Viktória, Knoch Júlia, Kocsis Júlia, Kósa Szilárd, Mándoki Sára, Schrettner Jakab, Sebastian Fodor, Souly Alexandra, Tevesz Judit.
4 points:Kormányos Hanna Rebeka, Marton Fruzsina.
3 points:3 students.
2 points:3 students.
1 point:1 student.
0 point:11 students.
Unfair, not evaluated:1 solution.

Problems in Mathematics of KöMaL, May 2015