Euler's criterion for eleventh power nonresidues (Q2422801)

Let \(e\ge 2\) be an integer, \(p\) a prime \(\equiv 1\pmod{e}\) and \(D\) an integer prime to \(p\). Then Euler's criterion is: \[ D^{\frac{p-1}{e}}\equiv 1\pmod{p} \] if and only if \(D\) is an \(e\)-th power residue modulo \(p\). The case \(e=11\) is studied here. The authors define \(a_i(n)\), for \(1\le i\le 10\), \(1\le n\le 9\), to be the unique solution to a system of six Diophantine equations. Five of the equations are from [\textit{J. C. Parnami} et al., Acta Arith. 41, 1--13 (1982; Zbl 0491.12019)]. A sixth equation is added to ensure a unique solution. They show that \(D=2\) is an 11th power residue modulo \(p\) if and only if \(\sum_{i=1}^{10} a_i(1) \equiv 0\pmod{2}\). There are similar results for \(D=7\), in terms of a polynomial of degree 7 in the \(a_i(1)\) modulo 7, and for \(D=11\) using a linear combination of \(a_i(1)\) and \(a_i(2)\) modulo 121. For the same \(D\), they also compute explicit values of \(D^{\frac{p-1}{11}}\pmod{p}\) when \(D\) is not an 11th power residue modulo 11.