Lower Bound for a Diophantine Approximation Function.
This paper is concerned with non-trivial solvability in -adic integers of systems of additive forms. Assuming that the congruence equation has a solution with we have proved that any system of additive forms of degree with at least variables, has always non-trivial -adic solutions, provided . The assumption of the solubility of the above congruence equation is guaranteed, for example, if .
We study a family of quasi periodic -adic Ruban continued fractions in the -adic field and we give a criterion of a quadratic or transcendental -adic number which based on the -adic version of the subspace theorem due to Schlickewei.