Leading numbers of tetration
I would like to solve this problem.
Question: Can the algorithm for finding the leading digits of some tetration with time complexity of iterational logarithm (or, ideally, the constant time complexity) exist? If yes, how this algorithm can be implemented?
The most wanted:
1) Mega,
2) 4096^^166,
3) Tritri (3^^^3)
4) Grahal (3^^^^3)
5) g1 in the construction of GrahamConway number (4^^^^4)
6) Any more?
Last fiddled with by tetramur on 20190125 at 11:29
