A269591 Digits of one of the two 5-adic integers sqrt(-4).

1, 2, 0, 2, 3, 0, 4, 2, 3, 3, 4, 4, 3, 1, 1, 3, 4, 0, 3, 1, 2, 0, 3, 1, 1, 0, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 4, 3, 2, 2, 3, 2, 4, 4, 0, 3, 1, 4, 0, 3, 3, 1, 0, 1, 3, 3, 2, 3, 3, 3, 4, 4, 3, 1, 3, 1

Offset

0,2

Comments

This is the scaled first difference sequence of A268922.

The digits of the other 5-adic integer sqrt(-4), are given in A269592. See also A268922 for the two 5-adic numbers sqrt(-4), called u and -u.

a(n) is the unique solution of the linear congruence 2*A268922(n)*a(n) + A269593(n) == 0 (mod 5), n>=1. Therefore only the values 0, 1, 2, 3 and 4 appear. See the Nagell reference given in A268922, eq. (6) on p. 86, adapted to this case. a(0) = 1 follows from the formula given below.

Links

Seiichi Manyama, Table of n, a(n) for n = 0..10000

BCMATH Congruence Programs, Finding a p-adic square root of a quadratic residue (mod p), p an odd prime.

Formula

a(n) = (b(n+1) - b(n))/5^n, n >= 0, with b(n) = A268922(n), n >= 0.

a(n) = -A269593(n)*(2*A268922(n))^3 (mod 5), n >= 1. Solution of the linear congruence see, e.g., Nagell, Theorem 38 pp. 77-78.

A268922(n+1) = sum(a(k)*5^k, k=0..n), n >= 0.

Example

a(4) = 3 because 2*261*3 + 109 = 1675 == 0 (mod 5).
a(4) = - 109*(2*261)^3 (mod 5) = -(-1)*(2*1)^3 (mod 5) = 8 (mod 5) = 3.
A268922(5) = 2136 = 1*5^0 + 2*5^1 + 0*5^2 + 2*5^3 + 3*5^4.

Prog

(PARI) a(n) = truncate(sqrt(-4+O(5^(n+1))))\5^n; \\ Michel Marcus, Mar 04 2016

Crossrefs

Cf. A210850, A210851, A268922, A269592 (companion), A269593.

Sequence in context: A274097 A265400 A181871 * A262878 A317239 A360174

Adjacent sequences: A269588 A269589 A269590 * A269592 A269593 A269594

Keyword

nonn,base,easy

Author

Wolfdieter Lang, Mar 02 2016

Status

approved