Click on the Green Flag, input N, and the algorithm will compute N!. At some point the report of N! will shift into scientific notation when N! is computed. In other words, I have not tested to find the largest value for N where a digit by digit result is obtained. I will check this as time allows.
The algorithm used to compute FactorIal N is a very simple example of 'recursion' as it first computes N x (N - 1) and then that product x (N -2 ) etc. until N = 1. This project was written so that I could write the following two projects. I needed a 'factorial' Make a Block to write the Combinations project and the Combinations project to write the Random Walker Probabilities project. See: Combinations https://scratch.mit.edu/projects/86535264/ The Random Walk on the Integer Number Line Probabilities https://scratch.mit.edu/projects/86951083/
