Is there a way to uniquely identify a string of primes? I was thinking about removing 2 and 5 from p and using radix shifting by multiplying each prime by the 10 times its index and then adding the index to the product. The problem is that this only saved the ordering of x by backtracking the algorithm.
I know I could concatenate the prime string itself and delimit with 2 for cases where a prime is itself a string primes (37 could be 2372)
I have some other ideas using exponents, but is there a name for this topic?
