enzo and beatriz are playing games at their local arcade.
incredibly, enzo wins 5 tickets from every game, and beatriz wins 11 tickets from every game. when they stopped playing games, enzo and beatriz had won the same number of total tickets.
what is the minimum number of games that enzo could have played?

step-by-step explanation:

given that there are two triangles j'k'l' and jkl>

the former is got by dilating the second one.

when drawn on a grid, (graph paper) coordinates of vertices of first triangle is

(6,12)j, (9,6)k and (12,9)l

side jk has length = distance between j and k

=

side j'k'=distance between j' and k'

=

ie j'k'l' has sides 1/3 of that of corresponding sides of jkl.

hence scale factor of 1/3 is used to get j'k'l'from jkl