Hey there everybody. I've been working on the Project Euler (projecteuler.net) problems for a while now, using Maple or J to solve the problems. Some of the problems involve using palindromes or testing for palindromes. I know I can convert the number into a string, reverse it with StringTools, and then parse it back into a number, but that requires a lot of time and resources (the PE problems should be solved in under 1 minute).