# hw4 - • Basis: λ R = λ where λ is the empty string •...

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

CSE 321: Discrete Structures Assignment #4 Autumn 2008 Due: Wednesday, October 29 Problems: 1. Section 4.1, exercise 10 2. Section 4.1, exercise 30 3. Prove that 3 divides n 3 + 2 n whenever n is a positive integer. 4. Section 4.1, exercise 66 5. Section 4.2, exercise 10 6. Section 4.2, exercise 12 7. Section 4.3, exercise 16 8. If Σ is an alphabet, for x Σ * we deﬁne the reversal of x recursively as follows:
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: • Basis: λ R = λ where λ is the empty string • Recursive step: ( ua ) R = au R for a ∈ Σ ,u ∈ Σ * Show using structural induction on x ∈ Σ * that if w,x ∈ Σ * are two strings in Σ * then ( wx ) R = x R w R Please write about how many hours it took you to complete this assignment near where you write your name on the ﬁrst page....
View Full Document

## This note was uploaded on 10/12/2009 for the course CSE 321 taught by Professor Staff during the Winter '08 term at University of Washington.

Ask a homework question - tutors are online