NOTE FOR EXPERTS:
THERE ARE MANY ANSWERS UP ON answers FOR VARIATIONS OF THIS
QUESTION. THERE ARE DIFFERENT NUMBERS OF X, V AND W IN EACH
QUESTION SO PLEASE ANSWER THIS QUESTION SPECIFICALLY MANUALLY AND
NOT COPY PASTE SOLUTIONS FROM ANOTHER VARIATION OF THIS QUESTION.
THANKS
Call a string of letters "legal" if it can be produced by concatenating (running together) copies of the following strings: 'U','ww', 'xx"yyy' and 'zzz'. For example, the string 'xxuu' is legal because it can be produced by concatenating' xx','U' and 'u', but the string 'xxxu' is not legal. For each integer n > 1, let to be the number of legal strings with n letters. For example, t1 = 1 ('u' is the only the legal string). t2 = 13 = in = a tn-1 + b1,-2 + ctn-3 for each integer n > 4 = where a = b= and c =
For each integer n > 1, let pn be the number of legal strings with n letters that also read the same right to left as they do left to right (like 'xxuxx', for example). Which of the following expressions is equal to P101? P50 + P49 Ot50 + 148 Otso + 2t49 OP100 + P99 P50 + 2p49 Ot50 + 149 Ot50 + 2t48 Ot100 + t99
NOTE FOR EXPERTS: THERE ARE MANY ANSWERS UP ON answers FOR VARIATIONS OF THIS QUESTION. THERE ARE DIFFERENT NUMBERS OF X,
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am