login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A225457
10-adic integer x such that x^9 = 7.
2
7, 0, 6, 9, 4, 2, 3, 0, 7, 3, 6, 7, 9, 6, 2, 6, 7, 7, 2, 1, 4, 0, 9, 2, 6, 5, 6, 9, 7, 8, 9, 8, 9, 7, 5, 0, 3, 7, 3, 7, 8, 5, 2, 8, 0, 3, 2, 6, 6, 3, 1, 3, 4, 1, 3, 7, 5, 3, 4, 5, 3, 4, 6, 5, 3, 5, 8, 0, 9, 6, 7, 3, 9, 1, 6, 4, 4, 5, 9, 3, 8, 4, 1, 8, 6, 4, 1, 8, 5, 9, 6, 2, 6, 4, 3, 3, 3, 1, 9, 0
OFFSET
0,1
LINKS
EXAMPLE
7^9 == 7 (mod 10).
7^9 == 7 (mod 10^2).
607^9 == 7 (mod 10^3).
9607^9 == 7 (mod 10^4).
49607^9 == 7 (mod 10^5).
249607^9 == 7 (mod 10^6).
PROG
(PARI) n=0; for(i=1, 100, m=7; 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((7+O(2^N))^(1/9), 2^N), Mod((7+O(5^N))^(1/9), 5^N)))), N) \\ Seiichi Manyama, Aug 07 2019
CROSSREFS
Sequence in context: A076421 A196763 A321106 * A188928 A036479 A085966
KEYWORD
nonn,base
AUTHOR
Aswini Vaidyanathan, May 11 2013
STATUS
approved