-> Just enter the two numbers as required, and get their product with full precision, upto the last digit. -> Now, you can also do factorial. (v1.2) Added a factorial block, which can calculate the factorials of big numbers precisely. See inside for the block. If you want factorials of negative non-integers (e.g. -0.5!) or non-negative non-integers (0.5!), you might be looking for the gamma function, which is different and thus, not here... -> For the interested, here's more: https://en.wikipedia.org/wiki/Arbitrary-precision_arithmetic -> NOTE: This ONLY works for non-negative integers (i.e. W) for now.
=> Uses basic schoolbook multiplication for less than 50 digits with chunking, and uses the faster Karatsuba algorithm thereafter, i.e. O(n^1.6) => For long numbers, please wait for a while. => I haven't fully optimized the code or run benchmarks yet, but after a brief overlook, there are a few places that could be faster if tweaked. => Uses strings to get full precision. For more details, view the notes and credits section of this project: https://scratch.mit.edu/projects/1265834029
