cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A225445 10-adic integer x such that x^7 = 7.

This page as a plain text file.
%I A225445 #12 Aug 08 2019 10:49:11
%S A225445 3,4,3,2,1,0,9,4,6,2,6,6,3,5,3,3,3,4,9,8,0,7,9,7,3,9,5,8,1,9,5,2,0,2,
%T A225445 3,5,9,5,9,0,0,7,4,3,9,1,6,4,5,0,2,8,4,9,1,8,9,7,8,9,8,1,0,5,6,9,5,9,
%U A225445 6,0,1,3,0,7,8,5,7,7,8,5,1,2,9,9,9,5,2,9,9,3,5,8,8,3,1,6,4,1,9,7
%N A225445 10-adic integer x such that x^7 = 7.
%H A225445 Seiichi Manyama, <a href="/A225445/b225445.txt">Table of n, a(n) for n = 0..10000</a>
%e A225445       3^7 == 7 (mod 10).
%e A225445      43^7 == 7 (mod 10^2).
%e A225445     343^7 == 7 (mod 10^3).
%e A225445    2343^7 == 7 (mod 10^4).
%e A225445   12343^7 == 7 (mod 10^5).
%e A225445   12343^7 == 7 (mod 10^6).
%o A225445 (PARI) n=0;for(i=1,100,m=7;for(x=0,9,if(((n+(x*10^(i-1)))^7)%(10^i)==m,n=n+(x*10^(i-1));print1(x", ");break)))
%o A225445 (PARI) N=100; Vecrev(digits(lift(chinese(Mod((7+O(2^N))^(1/7), 2^N), Mod((7+O(5^N))^(1/7), 5^N)))), N) \\ _Seiichi Manyama_, Aug 06 2019
%K A225445 nonn,base
%O A225445 0,1
%A A225445 _Aswini Vaidyanathan_, May 11 2013