|
|
actually there is no restriction on the number of digits reason: divisibility by 11 :abcde(a,b,c,d,e are digits) condition is (a+c+e)-(b+d)=11k where k is whole number that is it can be equal to 0 or 11 or 22 etc now consider palindromes 2 digit number (11 itself obviously is divisible) 3 digits 121 4 digits 1001 5 digits 11011 .... so it is so easy to generate a palindrome divisible by 11 technique is even no of digits means put 1st and last digit as 1 rest as 0 odd no of digits means 1st 2 digits and last 2 digits as 1 and rest as 0 this ofcourse can include few of the possible palindromes rest can be derived similarly so there is no restriction on the no of digits
|