Is there a method which would allow me to precisely calculate length of the largest number which has been created during multiplying two numbers?
What I mean is this:
Multiplying the above we get:
11322 : this is result from multiplying 9 * 1258
75480: this is result from multiplying 6 * 1258 and one zero is added as a padding
629000:this is result from multiplying 5 * 1258 and two zeros are added as a padding
2516000: this is result from multiplying 2 * 1258 and three zeros are added as a padding
total = 11322 + 75480 + 629000 + 2516000 = 3231802 I'm interested in finding the length of the 2516000, which is is there a way which would allow me in advance (knowing lengths of two operands) calculate it's largest possible length (with padding zeros included)