Small cancellation groups and translation numbers

In this paper we prove that C(4)-T(4)-P, C(3)-T(6)-P and C(6)-P small cancellation groups are translation discrete in the strongest possible sense and that in these groups for any and any there is an algorithm deciding whether or not the equation has a solution. There is also an algorithm for calculating for each the maximum such that is an -th power of some element. We also note that these groups cannot contain isomorphic copies of the group of -adic fractions and so in particular of the group of rational numbers. Besides we show that for and groups all translation numbers are rational and have bounded denominators.