|
|
A325485
|
|
One of the four successive approximations up to 5^n for the 5-adic integer 6^(1/4). This is the 2 (mod 5) case (except for n = 0).
|
|
10
|
|
|
0, 2, 22, 22, 397, 397, 6647, 6647, 319147, 319147, 6178522, 6178522, 103834772, 592116022, 3033522272, 9137037897, 70172194147, 222760084772, 3274517897272, 3274517897272, 60494976881647, 441964703444147, 1395639019850397, 3779824810866022, 51463540631178522
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
For n > 0, a(n) is the unique number k in [1, 5^n] and congruent to 2 mod 5 such that k^4 - 6 is divisible by 5^n.
For k not divisible by 5, k is a fourth power in 5-adic field if and only if k == 1 (mod 5). If k is a fourth power in 5-adic field, then k has exactly 4 fourth-power roots.
|
|
LINKS
|
|
|
FORMULA
|
For n > 0, a(n) = 5^n - A325486(n).
|
|
EXAMPLE
|
The unique number k in [1, 5^2] and congruent to 2 modulo 5 such that k^4 - 6 is divisible by 5^2 is k = 22, so a(2) = 22.
The unique number k in [1, 5^3] and congruent to 2 modulo 5 such that k^4 - 6 is divisible by 5^3 is also k = 22, so a(3) is also 22.
|
|
PROG
|
(PARI) a(n) = lift(sqrtn(6+O(5^n), 4) * sqrt(-1+O(5^n)))
|
|
CROSSREFS
|
Approximations of p-adic fourth-power roots:
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|