Find with which are proof the number of subsets of r

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: is divisible by , with B–5 Given a finite string of symbols and , we write for the number of ’s in minus the number of ’s. For example, . We call a string balanced if every substring of (consecutive symbols of) has . Thus, is not balanced, since it contains the substring . Find, with proof, the number of balanced strings of length .     )# !     $0( '  # !  $¥( '&% E@"&& # !  6  A–5 If is a prime number greater than 3 and prove that the sum to . matrix Q…„!„s } E‚ƒ...
View Full Document

This note was uploaded on 04/28/2013 for the course MATH 191 taught by Professor Staff during the Fall '08 term at University of California, Berkeley.

Ask a homework question - tutors are online