<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:py="http://codespeak.net/lxml/objectify/pytype" py:pytype="TREE"><text><body><div type="translation" n="urn:cts:greekLit:tlg0062.tlg063.perseus-eng3" xml:lang="eng"><div type="textpart" subtype="section" xml:base="urn:cts:greekLit:tlg0062.tlg063.perseus-eng3" n="42"><sp><speaker>HERMOTIMUS</speaker><p>What if you come on this one first or second, what will you do?</p></sp><sp><speaker>LYCINUS</speaker><p>It is not what <hi rend="italic">I</hi> shall do. <hi rend="italic">You</hi> are the National Judge, and I want to know what <hi rend="italic">you</hi> will do. Will you say at once that this man is given a bye, or will you have to go round them all, to see whether there is somewhere a corresponding letter? If you did not look at the lots of everyone, you would not discover who had the bye.</p></sp><sp><speaker>HERMOTIMUS</speaker><p>Oh, I should know quite easily, Lycinus. In the case of nine competitors, if I find epsilon first or second, I know that the one holding this lot is the one who has the bye.</p></sp><sp><speaker>LYCINUS</speaker><p>How, Hermotimus?</p></sp><pb n="v.6.p.343"/><sp><speaker>HERMOTIMUS</speaker><p>In this way: two have alpha, and similarly two have beta. Of the remaining four, two have surely drawn gamma and two delta, and four letters have already been used up for eight competitors. So it is clear that only the next letter, epsilon, could be odd, and he who has drawn this one gets the bye.</p></sp><sp><speaker>LYCINUS</speaker><p>Shall I praise you for your intelligence, or would you like me to explain the different view I have of the matter?</p></sp><sp><speaker>HERMOTIMUS</speaker><p>Certainly. But I fail to see what reasonable answer you can give to such an argument.</p></sp></div></div></body></text></TEI>