Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

  • (cur | prev) 19:21, 11 March 2009‎ Kshen (Talk | contribs)‎ . . (416 bytes) (+416)‎ . . (New page: You can do this by realizing that if the last letter is an a, b, or c you have a_n-1 choices for the first n-1 letters. However, if the last letter is d, you do not want cd or dd, so you c...)
Retrieved from "https://www.projectrhea.org/rhea/index.php/19._Find_a_recurrence_for_the_number_of_strings_using_the_letters_a,b,c,d_that_do_not_have_%22cd%22_nor_%22dd%22_in_them._(Hint:_start_at_the_end.)"
Shortcuts
Help Main Wiki Page Random Page Special Pages Log in
Search

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood