palindromes

This is actually asking for a particular type of palindromes -- those which are palindromic squares of palindromes.

True regular expressions don't have the expressive power to decide whether arbitrary-length strings are or aren't palindromes.

Unless generating palindromes is a very hard problem, iterating over them should be the obvious solution, as it obviously will mean a substantially smaller set of iterations.

To most people, programming looks as fun as filling out a tax return where all fields must be answered in Latin palindromes.

To me, the obvious solution is to generate the palindromes, not iterate through every number and check if it is a palindrome.

Two beautiful palindromes my father and his friend invented in a wonderful Berkely summer.

Having to handle varying length palindromes slightly complicates matters, but not much.

You shouldn't try to find the palindromes, but rather generate them.

I just figured out a rule that would generate all those palindromes with no checking.

Edit: as electrograv pointed out, another optimization is to generate palindromes from sqrt(start) to sqrt(end) rather than testing each number in the range for palindrome-ness.

I'm back to searching for numbers that are palindromes both in decimal and in binary.

This problem has a quite elegant solution - Suppose you know the fair palindromes (is a palindrome and a root of a palindrome) of length 2*k.

A man, a plan", I thought it was impossible to match palindromes with regex, am I wrong?

If you look in the examples section of the manual, they describe an "FSM" that can identify palindromes on the alphabet { '0', '1', 'c' }, where 'c' indicates the center.

FTA: "He loved puns, palindromes, limericks and wordplays." When my friend was shooting part of Dirty Pictures, he texted me to say "I just exchanged dirty limericks with Shulgin!"

For instance: any theorem in pure mathematics is logically necessary[2] and therefore has no observable consequences that you couldn't derive without it -- but it still seems reasonable to say, e.g., that a proof that even-length palindromes have to be multiples of 11 "explains" why I've never seen a palindromic prime number with 4, 6, 8,...