[問題] 特南羅馬尼亞題
A word consists of n letters from the alphabet
{a,b,c,d}. Aword is called convoluted if it has two
consecutive identical blocks of letters. For
example,
caab and cababdc are convoluted, but abcab is not.
Prove that the number of non-convoluted words with
n letters is greater than 2^n
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 218.167.197.47
推
推 61.226.2.82 12/31, , 1F
推 61.226.2.82 12/31, 1F
推
推 61.64.193.59 12/31, , 2F
推 61.64.193.59 12/31, 2F
推
推218.164.130.247 01/01, , 3F
推218.164.130.247 01/01, 3F
推
推 218.164.138.23 01/01, , 4F
推 218.164.138.23 01/01, 4F