Let's say you have a digit function, D(n), which equals the number of digits in the input (n). (e.g., 19 becomes 2, 142151 become 6...well, you see)(adsbygoogle = window.adsbygoogle || []).push({});

(where n!! is, well, a factorial of a factorial)

1) Now when will D(n!!) become a googol? A googolplex?

2) Now when will D(D(n!!)) become a googol? A googolplex?

3) In subjective but ""somewhat"" reasonable language, how fast do you think the sequence S(n)=D(n!)-n increases? (slow..med..fast...whichever way to describe it)

(For easy calculation of digits, just set your graphing calculator to "Scientific" exponential format in the MODE screen)

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Digit-Factorial question

Loading...

Similar Threads for Digit Factorial question | Date |
---|---|

Convergence or Divergence of Factorial Series | Apr 26, 2015 |

Digits of Accuracy | Jun 26, 2013 |

Measure of Irrationals with Even First Digit | May 12, 2010 |

Decimal Digits | Sep 20, 2008 |

Find the last digit of the sum of two numbers with large exponents. | May 23, 2005 |

**Physics Forums - The Fusion of Science and Community**