[Math4u] Need Help Plz......... Discrete Math-Recurrence Relationship

Dear all,

  Here i mention the problem which is there in my textbook, please and kindly provide the solution for that.

 

Problem:-

   A palindrome is a word that reads the same, whether read from left to right or from right to left, ROTOR for example. Let (An) be the number of words of length n, not necessarily meaningful, that are palindromes. We consider a signle letter also a palindrome,

i) What are A1,A2?

ii) Set up a recurrence for An.

iii) Check that

An=(Root26)^n+{ ((1+Root26)/2) + (-1)^n ((1-Root26)/2) }

is the solution to the recurrence.

 

Need the solution, Help Please.....

 

My Advance thanks

Regards,

H.Ashok

---

5, 50, 500, 5000 - Store N number of mails in your inbox. Click here. __._,_.___

Your email settings: Individual Email|Traditional
Change settings via the Web (Yahoo! ID required)
Change settings via email: Switch delivery to Daily Digest | Switch to Fully Featured
Visit Your Group | Yahoo! Groups Terms of Use | Unsubscribe

__,_._,___