Original: According to the fundamental theorem of arithmetic , any number obtained in this way can be uniquely factored into prime factors , so it is possible to recover the original sequence from its Gödel number ( for any given number n of symbols to be encoded ) .
Simplified: According to the fundamental theorem of arithmetic , any code obtained this way can be uniquely factored into prime factors , so it is possible to recover the original sequence .