It is proved that for every odd $n \ge 1039$ there are two words $u(x, y), v(x,y)$ of length $\le 658n^2$ over the group alphabet $\{x,y\}$ of the free Burnside group $B(2 ,n),$ which generate a free Burnside subgroup of the group $B(2,n)$. This implies that for any finite subset $S$ of the group $B(m,n)$ the inequality $|S^t|>4\cdot 2.9^{[\frac{t}{658s^2}]}$ holds, where $s$ is the smallest odd divisor of $n$ that satisfies the inequality $s\ge1039$.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.