Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Digit-Factorial question

  1. Feb 24, 2005 #1
    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)
    (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)
     
  2. jcsd
  3. Feb 24, 2005 #2

    matt grime

    User Avatar
    Science Advisor
    Homework Helper

    You realize that D(n) is just floor{log(n)}+1, where I'm taking logs base 10.
     
  4. Feb 24, 2005 #3
    EXAcTLY! :biggrin: This was an AMC question somewhere :surprised , but I liked this problem cuz I couldn't find the method to solve the Double factorial that would quickly yield the solution in 2 to 5 minutes (it used to be on a test, about 2-5 minutes per problem)--anyway, the factorial I could take of, but the double factorial got more difficult; i tried expanding it as a sum of logs, but (until I wasted way 2much time for that) then it became more difficult; so, I was wondering what would be not only a method, but a 2 to 5 minute technique that found conceptually would have allowed to solve it, without going back and forth.
    The last question, about [D(n!)]-n, I was curious upon observation of the sequence graph; it appears as a concave upward shape with minimums of -3 for 'n' from 6 to 14 inclusively. But after that, it actually seemed to expand quite slowly (again, using the unfortunately "subjective" language again :frown: ) Until finally, I found that it bounded a sequence from below of a function previously found during the solving of this AMC problem. I thought it cool,
    but how would I solve the double factorial issue with a two to five minute technique?? :surprised i.e., what conceptual path should be followed here?
    The googol-googolplex issue was added for reasons unknown, (except maybe just to annoy me! :bugeye: )
     
  5. Feb 24, 2005 #4

    NateTG

    User Avatar
    Science Advisor
    Homework Helper

  6. Feb 24, 2005 #5
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?



Similar Discussions: Digit-Factorial question
  1. N factorial (Replies: 7)

  2. Limit with Factorials (Replies: 1)

  3. Factorial Question (Replies: 3)

Loading...