Here is a strange problem, I submit to you, not without a wicked laugh (!) :
Let's imagine this algo
Code: Select all
2 *2 = 4 ; 2 is prime so multiply
4 *3 = 12 ; 3 is prime so multiply
12 -4 = 8 ; 4 is composite so substract
8 *5 = 40 ; 5 is prime so multiply
40 -6 = 34 ; 6 is composite so substract
etc...
If we could not know it, then could we know its size ? (number of digits)
If again unable, is there a source code which could prove it ?