2011 USAJMO Problems/Problem 4
Revision as of 15:56, 29 April 2011 by Mathlieutenant (talk | contribs) (Created page with 'A word is defined as a finite sequence of letters. A ''palindrome'' is a word that reads the same forwards and backwards. Consider the sequence of words W0,W1,W2... such that W…')
A word is defined as a finite sequence of letters. A palindrome is a word that reads the same forwards and backwards. Consider the sequence of words W0,W1,W2... such that W0 = a, W1 = b, and for all n >= 2, Wn is the word formed by writing W(n-2) followed by W(n-1). Prove that for all n >= 1, the word formed by writing W1,W2,...,Wn in sequence is a palindrome.
