A solution to the congruence \(x^3\equiv a\pmod p\) (Q2744482)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A solution to the congruence x^3 a p |
scientific article; zbMATH DE number 1649060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A solution to the congruence \(x^3\equiv a\pmod p\) |
scientific article; zbMATH DE number 1649060 |
Statements
25 March 2002
0 references
algorithm
0 references
cubic congruence
0 references
A solution to the congruence \(x^3\equiv a\pmod p\) (English)
0 references
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\).
0 references
0.7922459840774536
0 references
0.7874972820281982
0 references
0.7860897779464722
0 references
