|
%I #36 May 15 2019 00:34:22
%S 2,8,0,7,3,5,4,9,2,2,0,5,7,6,0,4,1,0,7,4,4,1,9,6,9,3,1,7,2,3,1,8,3,0,
%T 8,0,8,6,4,1,0,2,6,6,2,5,9,6,6,1,4,0,7,8,3,6,7,7,2,9,1,7,2,4,0,7,0,3,
%U 2,0,8,4,8,8,6,2,1,9,2,9,8,6,4,9,7,8,6,0,9,9,9,1,7,0,2,1,0,7,8
%N Decimal expansion of log(7)/log(2).
%H Vincenzo Librandi, <a href="/A020860/b020860.txt">Table of n, a(n) for n = 1..1000</a>
%H L. Adleman, <a href="http://www.jstor.org/stable/2885489">Molecular Computation of Solutions to Combinatorial Problems</a>, Science 266 (1994): 1021-1024.
%H Aran Nayebi, <a href="http://arxiv.org/abs/0912.0750">Fast matrix multiplication techniques based on the Adleman-Lipton model</a>, arXiv:0912.0750 [q-bio.QM], 2009-2011.
%H D. K. Nguyen, I. Lavallée, and M. Bui, <a href="http://dx.doi.org/10.1007/978-3-540-79409-7_31">A New Direction to Parallelize Winograd's Algorithm on Distributed Memory Computers</a>, Modeling, Simulation and Optimization of Complex Processes Proceedings of the Third International Conference on High Performance Scientific Computing, March 6-10, 2006, Hanoi, Vietnam: 445-457.
%H V. Pan, <a href="http://dx.doi.org/10.1137/1026076">How can we speed up matrix multiplication?</a>, SIAM Review, 26 (1984): 393-416.
%H S. Robinson, <a href="http://www.siam.org/news/news.php?id=174">Toward an Optimal Algorithm for Matrix Multiplication</a>, SIAM News 38 (2005): 1-3.
%H V. Strassen, <a href="http://dx.doi.org/10.1007/BF02165411">Gaussian elimination is not optimal</a>, Numer. Math. 13 (1969): 354-356. MR 40:2223.
%H Yahoo Questions, <a href="http://answers.yahoo.com/question/index?qid=20100921180347AAGwhF0">Prove log(base 2)7 is rational?</a>
%H <a href="/index/Tra#transcendental">Index entries for transcendental numbers</a>
%e 2.807354922...
%t RealDigits[Log[2, 7], 10, 100][[1]] (* _Vincenzo Librandi_, Aug 29 2013 *)
%o (PARI) log(7)/log(2) \\ _Charles R Greathouse IV_, May 15 2019
%Y Cf. A002162, A016630.
%K nonn,cons
%O 1,1
%A _N. J. A. Sloane_
|
