Complete Latin squares of order \(p^n\) exist for odd primes \(p\) and \(n>2\) (Q1613496)

A Latin square \(L_{i,j}\) is row complete if the ordered pairs \(L_{i,j},L_{i,j+1}\) are distinct. A Latin square \(L_{i,j}\) is column complete if the ordered pairs \(L_{i+1,j},L_{i,j}\) are distinct. A Latin square is complete if it is both row and column complete. The author proves that complete Latin squares of order \(p^n\) exist, when \(p\) is an odd prime and \(n>2\), by producing a sequencing in a nonabelian group of order \(p^n\).