Abstract
We establish the solvability criteria for the equation xq = a in the field of p-adic numbers, for any q in two cases: (i) q is not divisible by p; (ii) q = p. Using these criteria we show that any p-adic number can be represented in finitely many different forms and we describe the algorithms to obtain the corresponding representations. Moreover it is shown that solvability problem of xq = a for any q can be reduced to the cases (i) and (ii).
| Original language | English |
|---|---|
| Pages (from-to) | 853-864 |
| Number of pages | 12 |
| Journal | Bulletin of the Malaysian Mathematical Sciences Society |
| Volume | 37 |
| Issue number | 3 |
| State | Published - 2014 |
| Externally published | Yes |
Keywords
- Congruence
- Solvability of an equation
- p-adic number
Fingerprint
Dive into the research topics of 'Solvability criteria for the equation xq = a in the field of p-adic numbers'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver