Abstract
The problem of finding 2n when n is given is mathematically trivial, but computationally intractable. We show how to compute the most significant digit of the ternary representation of 2n in polynomial time.
Supported by the Academy of Finland under grant 44087.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Baker: Transcendental Number Theory. Cambridge University Press (1975).
A. Gelfond: Sur les approximations des nombres transcendants par des nombres algébriques. Dokl. Acad. Sci. URSS 2, 177–182, (in russian and french) (1935).
G. Rhin: Approximants de Padé et mesures effectives d’irrationalité. Séminaire de Théorie des Nombres, Paris 1985–86, 155–164, Progr. Math., 71, Birkhäuser Boston, Boston, MA (1987).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hirvensalo, M., Karhumäki, J. (2002). Computing Partial Information out of Intractable One — The First Digit of 2n at Base 3 as an Example. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_26
Download citation
DOI: https://doi.org/10.1007/3-540-45687-2_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44040-6
Online ISBN: 978-3-540-45687-2
eBook Packages: Springer Book Archive