Solvability criteria for the equation in the field of -adic numbers
arXiv:1102.2156
Abstract
We establish the solvability criteria for the equation in the field of -adic numbers, for any in two cases: (i) is not divisible by ; (ii) . Using these criteria we show that any -adic number can be represented in finitely many different forms and we describe the algorithms to obtain the corresponding representations. Moreover it is showed that solvability problem of for any can be reduced to the cases (i) and (ii).
14 pages