0
\$\begingroup\$

This question already has an answer here:

May I ask a question about overflow? I was thinking an example of overflow calculation would be the number of googolplexes a number is because the computer can't count with that large numbers. AFAIK no computer language has a library for 512-bit numbers so I wanted to create a question where the programmer must create handling integers as linked lists or similar instead of using the builtin +,-,*,/.

Example how I want to ask

For a given very large number, detect how many googolplexes it is.

\$\endgroup\$

marked as duplicate by user62131, Wheat Wizard, mbomb007, Mego, Arjun May 14 '17 at 13:18

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

  • 1
    \$\begingroup\$ If you want to ask about whether a specific question would be appropriate for the site, the Sandbox is a good place for that (I've cast a duplicate vote to refer you there). It's worth pointing out though that many languages have bignum arithmetic by default (Python is the most famous example), and that most other languages would just treat this as a string handling task (a googolplex is a power of 10, after all). \$\endgroup\$ – user62131 May 13 '17 at 3:49
  • 1
    \$\begingroup\$ See: en.wikipedia.org/wiki/Arbitrary-precision_arithmetic \$\endgroup\$ – Calvin's Hobbies May 13 '17 at 3:56
  • 1
    \$\begingroup\$ Post it on Sandbox as if it was the real challenge, then you can get comments on how to tweak it before you post it for real :) \$\endgroup\$ – Stephen May 13 '17 at 19:07

Browse other questions tagged .