A solution to the congruence \(x^3\equiv a\pmod p\)
Let \(p\) be a prime with \(p>3\). In this paper the authors give an algorithm for determining all solutions of the cubic congruence \(x^3\equiv a\pmod p\), where \(a\) is an integer with \(p\nmid a\).
scientific article; zbMATH DE number 1649060