Computing partial information out of intractable: powers of algebraic numbers as an example (Q1048926): Difference between revisions

The paper contains efficient algorithms for computing the leftmost digit in base 3 of the numbers \(2^n\) and the Fibonacci number \(F_n\). Using Baker's estimates on linear forms in logarithms, the authors prove that these two problems can be solved in polynomial time with respect to the length of \(n\).