Theorem Let p ≧ 3 be a
prime and e ≧ 1 any integer. Then there exists a group G which has exponent pe and
Engel length e(pe − pe−1) + (p − 3)∕2.
If e = 1, this reduces to a Theorem of Kostrikin [2], whose proof employed
other methods. Our method yields the additional information, that G is a
solvable group of class at most k + 1, where k is the least integer such that
2k−1 ≧ p − 2.
|