This question is sort of in-between a computer science question and a math question. Let's say I'm representing a very large number as a prime factorization in order to not break the limitations of a variable size.
ex) n = 999,999,999 could be stored in an array as [3, 3, 3, 3, 37, 333667]
Is there a formula or technique that would allow me to perform addition on the prime factorization without converting the array back into it's whole number form?
n+1 = {number too large} = [?, ?, ?, ?, ?]