login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A225443 10-adic integer x such that x^7 == (10^n-1)/9 mod 10^n for all n. 1

%I

%S 1,3,0,1,9,1,8,7,3,0,2,4,3,2,5,8,3,2,4,7,4,4,6,5,6,9,7,2,5,7,7,4,8,4,

%T 4,0,8,4,1,3,1,9,8,3,1,7,7,8,4,2,0,6,9,6,8,6,6,0,0,1,7,0,9,8,8,6,6,0,

%U 7,2,1,3,3,5,9,7,3,3,7,3,9,4,5,4,5,2,3,7,6,7,3,5,5,3,7,7,3,3,7,3

%N 10-adic integer x such that x^7 == (10^n-1)/9 mod 10^n for all n.

%e 1^7 == 1 (mod 10).

%e 31^7 == 11 (mod 100).

%e 31^7 == 111 (mod 1000).

%e 1031^7 == 1111 (mod 10000).

%e 91031^7 == 11111 (mod 100000).

%e 191031^7 == 111111 (mod 1000000).

%o (PARI) n=0;for(i=1,100,m=(10^i-1)/9;for(x=0,9,if(((n+(x*10^(i-1)))^7)%(10^i)==m,n=n+(x*10^(i-1));print1(x", ");break)))

%K nonn,base

%O 1,2

%A _Aswini Vaidyanathan_, May 11 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 06:48 EDT 2019. Contains 322209 sequences. (Running on oeis4.)