Mathematical and Physical Journal
for High Schools
Issued by the MATFUND Foundation
Already signed up?
New to KöMaL?
I want the old design back!!! :-)

Problem B. 4742. (November 2015)

B. 4742. Show that it is possible to label the edges of a complete graph of \(\displaystyle n\ge 3\) vertices with 1, 2 or 3, so that the product of the labels of the edges be different at each vertex.

(4 pont)

Deadline expired on December 10, 2015.


151 students sent a solution.
4 points:108 students.
3 points:27 students.
2 points:5 students.
1 point:1 student.
0 point:7 students.
Unfair, not evaluated:3 solutions.

Problems in Mathematics of KöMaL, November 2015