|
|
A225456
|
|
10-adic integer x such that x^9 = 3.
|
|
2
|
|
|
3, 8, 4, 8, 6, 5, 6, 4, 6, 4, 5, 5, 2, 3, 6, 5, 5, 3, 6, 4, 9, 7, 9, 9, 7, 5, 6, 0, 7, 5, 8, 8, 9, 3, 7, 7, 1, 9, 0, 3, 1, 0, 8, 3, 6, 1, 4, 2, 7, 5, 6, 7, 3, 8, 7, 8, 8, 7, 3, 4, 2, 8, 0, 0, 8, 6, 6, 9, 6, 4, 9, 4, 5, 5, 5, 6, 7, 0, 6, 5, 1, 7, 3, 6, 4, 6, 3, 3, 4, 6, 3, 0, 9, 7, 7, 1, 6, 2, 7, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
EXAMPLE
|
3^9 == 3 (mod 10).
83^9 == 3 (mod 10^2).
483^9 == 3 (mod 10^3).
8483^9 == 3 (mod 10^4).
68483^9 == 3 (mod 10^5).
568483^9 == 3 (mod 10^6).
|
|
PROG
|
(PARI) n=0; for(i=1, 100, m=3; for(x=0, 9, if(((n+(x*10^(i-1)))^9)%(10^i)==m, n=n+(x*10^(i-1)); print1(x", "); break)))
(PARI) N=100; Vecrev(digits(lift(chinese(Mod((3+O(2^N))^(1/9), 2^N), Mod((3+O(5^N))^(1/9), 5^N)))), N) \\ Seiichi Manyama, Aug 07 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|