|
|
A225452
|
|
Digits of the 10-adic integer (1/9)^(1/7).
|
|
4
|
|
|
9, 6, 9, 8, 0, 8, 1, 2, 6, 9, 7, 5, 6, 7, 4, 1, 6, 7, 5, 2, 5, 5, 3, 4, 3, 0, 2, 7, 4, 2, 2, 5, 1, 5, 5, 9, 1, 5, 8, 6, 8, 0, 1, 6, 8, 2, 2, 1, 5, 7, 9, 3, 0, 3, 1, 3, 3, 9, 9, 8, 2, 9, 0, 1, 1, 3, 3, 9, 2, 7, 8, 6, 6, 4, 0, 2, 6, 6, 2, 6, 0, 5, 4, 5, 4, 7, 6, 2, 3, 2, 6, 4, 4, 6, 2, 2, 6, 6, 2, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
This is the 10's complement of A225443.
|
|
LINKS
|
|
|
EXAMPLE
|
9^7 == -1 (mod 10).
69^7 == -11 (mod 10^2).
969^7 == -111 (mod 10^3).
8969^7 == -1111 (mod 10^4).
8969^7 == -11111 (mod 10^5).
808969^7 == -111111 (mod 10^6).
|
|
PROG
|
(PARI) n=0; for(i=1, 100, m=(8*(10^i-1)/9)+1; for(x=0, 9, if(((n+(x*10^(i-1)))^7)%(10^i)==m, n=n+(x*10^(i-1)); print1(x", "); break)))
(PARI) Vecrev(digits(truncate(-(-1/9+O(10^100))^(1/7)))) \\ Seiichi Manyama, Aug 04 2019
(PARI) N=100; Vecrev(digits(lift(chinese(Mod((1/9+O(2^N))^(1/7), 2^N), Mod((1/9+O(5^N))^(1/7), 5^N)))), N) \\ Seiichi Manyama, Aug 04 2019
|
|
CROSSREFS
|
Digits of 10-adic integers:
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|