English Információ A lap Pontverseny Cikkek Hírek Fórum

Rendelje meg a KöMaL-t!

VersenyVizsga portál

Kísérletek.hu

Matematika oktatási portál

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 points)

Deadline expired on 10 December 2015.

Statistics on problem B. 4742.
 152 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. Unfair, not evaluated: 1 solution.

• Problems in Mathematics of KöMaL, November 2015

•  Támogatóink: Morgan Stanley