Homework Statement
I need to prove this
http://www.freeimagehosting.net/newuploads/66exd.jpg
R represents the reversal of...L1 and L2 represent languages, which can represent strings.
(L1L2) = the concatenation of L1 and L2
Ex.
L1 = 01001
L2 = 001
L1L2 = 01001001
(L1L2)^R...
Yes, that is correct...I've done equality inductive proofs, but have not encountered less than or greater than type proofs...so I'm not sure how to begin.
Homework Statement
i=1 Sigma n (1/i2) <= 2 - (1/n)
The Attempt at a Solution
I've done the basic step and assumption step...little stuck on the inductive step
So far I have...
show 1 + 1/4 + 1/9 + 1/16 +...+ (1/k2) + (1/(k+1)2) <= 2 - (1/k+1)
Homework Statement
show S1 U S2 = (S1' ∩ S2')'
The Attempt at a Solution
I'm pretty sure I have this right or I'm close
Let x ∈ S1 U S2
x ∈ S1 or x ∈ S2
Since x ∈ S1 or S2, then x ∉ S1' and S2'
If x ∉ S1' and S2', then x ∈ (S1' and S2')'
Therefore, S1 U S2 = (S1' ∩ S2')'
Homework Statement...