title: Find the biggest palindrome in multiple integers
body: <p>I have a problem with some algorithm. I must write a java app, 
  which find the biggest palindrome for the product of a predetermined amount of numbers (l) of a predetermined number of digits (n). For example for l=2 and n=2 the biggest palindrome is 9009 (91 * 99). </p>
  
  <p>A palindrome checker I was writed, but I have no idea how to multiply the appropriate amount of numbers with a given number of digits. </p>
  
  <p>Can anybody help me?</p>
  
  <p>Sorry for my English.</p>