Chapter 2: Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Q31E
Let A be a set. Show that \(\phi \times A = A \times \phi = \phi \).
Q31E
Let A and B be subsets of a universal set U. Show that \(A \subseteq B\) if and only if \(\overline B \subseteq \overline A \).
Q31E
What is the value of each of these sums of terms of a geometric progression?
Q31E
Show that is countable by showing that the polynomial function with is one-to-one and onto.
Q31E
Construct a deterministic finite-state automaton that recognizes the set of all bit strings that begin and end with 11.
Q31E
Show that if \(a \ne {b^d}\) and\(n\)is a power of\(b\), then\(f(n) = {C_1}{n^d} + {C_2}{n^{{{\log }_b}a}}\), where \({C_1} = {b^d}c/\left( {{b^d} - a} \right)\) and\({C_2} = f(1) + {b^d}c/\left( {a - {b^d}} \right)\).
Q31E
Let . Find f(s) if
Q31E
In this exercise we show that the meet and join operations are commutative. Let A and B be zero-one matrices. Show that
a)
b)
Q31E
Question: Let . Find if
Q31SE
Determine a rule for generating the terms of the sequence that begins 2, 3, 3, 5, 10, 133 39,43, 172, 177, 885, 891. ..., and find the next four terms of the sequence.