!{width: 250px; float: center; margin: 35px}problema/superpoligon?explicatie.png!
Exista $160$ de perechi de triunghiuri $confundabile$, cum ar fi ${ (0, 0), (2, 0), (1, 1) }$ cu ${ (3, 0), (3, 2), (4, 1) }$.

Observati ca ${ (0, 0), (2, 0), (1, 1) }$ si ${ (3, 0), (3, 2), (4, 1) }$ este considerata o perechie diferita de ${ (0, 0), (1, 1), (2, 0) }$ cu ${ (3, 0), (4, 1), (3, 2) }$.
Remarcati ca ${ (0, 0), (2, 0), (1, 1) }$ si ${ (3, 0), (3, 2), (4, 1) }$ este considerata o pereche identica cu ${ (2, 0), (1, 1), (0, 0) }$ si ${ (3, 2), (4, 1), (3, 0) }$.
De asemenea, ${ (0, 0), (2, 0), (1, 1) }$ si ${ (3, 0), (3, 2), (4, 1) }$ este considerata o pereche diferita de ${ (3, 0), (3, 2), (4, 1) }$ si ${ (0, 0), (2, 0), (1, 1) }$

Observati ca ${ (0, 0), (0, 2), (1, 1) }$ si ${ (3, 0), (3, 2), (4, 1) }$ este considerata o perechie diferita de ${ (0, 0), (1, 1), (0, 2) }$ cu ${ (3, 0), (4, 1), (3, 2) }$.
Remarcati ca ${ (0, 0), (0, 2), (1, 1) }$ si ${ (3, 0), (3, 2), (4, 1) }$ este considerata o pereche identica cu ${ (0, 2), (1, 1), (0, 0) }$ si ${ (3, 2), (4, 1), (3, 0) }$.
De asemenea, ${ (0, 0), (0, 2), (1, 1) }$ si ${ (3, 0), (3, 2), (4, 1) }$ este considerata o pereche diferita de ${ (3, 0), (3, 2), (4, 1) }$ si ${ (0, 0), (0, 2), (1, 1) }$

== include(page="template/taskfooter" task_id="superpoligon") ==