 7.4.1E: When asked what it means to say that set A has the same cardinality...
 7.4.2E: Show that “there are as many squares as there are numbers” by exhib...
 7.4.3E: Let 3Z = {n ? Z  n = 3k, for some integer k}. Prove that Z and 3Z ...
 7.4.4E: Let O be the set of all odd integers. Prove that O has the same car...
 7.4.5E: Let 25Z be the set of all integers that are multiples of 25. Prove ...
 7.4.6E: Check that the formula for F given at the end of Example produces t...
 7.4.7E: Use the functions i and j defined in the paragraph following Exampl...
 7.4.8E: Use the result of exercise to prove that 3Z is countable.ExerciseLe...
 7.4.9E: Show that the set of all nonnegative integers is countable by exhib...
 7.4.10E: Let U = {x ? R  0S and U have the same cardinality.
 7.4.11E: Let V = {x ? R  2S and V have the same cardinality.
 7.4.12E: Let a and b be real numbers with a and suppose that W= {x ? R  a P...
 7.4.13E: Draw the graph of the function f defined by the following formula:F...
 7.4.14E: Define a function g from the set of real numbers to S by the follow...
 7.4.15E: Show that the set of all bit strings (strings of 0’s and 1’s) is co...
 7.4.16E: Show that Q, the set of all rational numbers, is countable.
 7.4.17E: Show that the set Q of all rational numbers is dense along the numb...
 7.4.18E: Must the average of two irrational numbers always be irrational? Pr...
 7.4.19E: Show that the set of all irrational numbers is dense along the numb...
 7.4.20E: Give two examples of functions from Z to Z that are onetoone but ...
 7.4.21E: Give two examples of functions from Z to Z that are onto but not on...
 7.4.22E: Define a function g: Z+ × Z+ ? Z+ by the formula g(m, n) = 2m3n for...
 7.4.23E: a. Explain how to use the following diagram to show that Znonneg × ...
 7.4.24E: Prove that the function H defined analytically in exercise b is a o...
 7.4.25E: Prove that 0.1999 … = 0.2.
 7.4.26E: Prove that any infinite set contains a countably infinite subset.
 7.4.27E: If A is any countably infinite set, B is any set, and g: A ? B is o...
 7.4.28E: Prove that a disjoint union of any finite set and any countably inf...
 7.4.29E: Prove that a union of any two countably infinite sets is countably ...
 7.4.30E: Use the result of exercise to prove that the set of all irrational ...
 7.4.31E: Use the results of exercises 1 and 2 to prove that a union of any t...
 7.4.32E: Prove that Z × Z, the Cartesian product of the set of integers with...
 7.4.33E: Use the results of exercises 3, 4, and 5 to prove the following: If...
 7.4.34E: Let be the set of all subsets of set S, and let T be the set of all...
 7.4.35E: Let S be a set and let be the set of all subsets of S. Show that S ...
 7.4.36E: The SchroederBernstein theorem states the following: If A and B ar...
 7.4.37E: Prove that if A and B are any countably infinite sets, then A × B i...
 7.4.38E: Suppose A1, A2, A3, … is an infinite sequence of countable sets. Re...
Solutions for Chapter 7.4: Discrete Mathematics with Applications 4th Edition
Full solutions for Discrete Mathematics with Applications  4th Edition
ISBN: 9780495391326
Solutions for Chapter 7.4
Get Full SolutionsSince 38 problems in chapter 7.4 have been answered, more than 25664 students have viewed full stepbystep solutions from this chapter. Chapter 7.4 includes 38 full stepbystep solutions. This textbook survival guide was created for the textbook: Discrete Mathematics with Applications , edition: 4th. Discrete Mathematics with Applications was written by and is associated to the ISBN: 9780495391326. This expansive textbook survival guide covers the following chapters and their solutions.

Augmented matrix [A b].
Ax = b is solvable when b is in the column space of A; then [A b] has the same rank as A. Elimination on [A b] keeps equations correct.

Circulant matrix C.
Constant diagonals wrap around as in cyclic shift S. Every circulant is Col + CIS + ... + Cn_lSn  l . Cx = convolution c * x. Eigenvectors in F.

Cofactor Cij.
Remove row i and column j; multiply the determinant by (I)i + j •

Column picture of Ax = b.
The vector b becomes a combination of the columns of A. The system is solvable only when b is in the column space C (A).

Commuting matrices AB = BA.
If diagonalizable, they share n eigenvectors.

Cross product u xv in R3:
Vector perpendicular to u and v, length Ilullllvlll sin el = area of parallelogram, u x v = "determinant" of [i j k; UI U2 U3; VI V2 V3].

Cyclic shift
S. Permutation with S21 = 1, S32 = 1, ... , finally SIn = 1. Its eigenvalues are the nth roots e2lrik/n of 1; eigenvectors are columns of the Fourier matrix F.

Elimination.
A sequence of row operations that reduces A to an upper triangular U or to the reduced form R = rref(A). Then A = LU with multipliers eO in L, or P A = L U with row exchanges in P, or E A = R with an invertible E.

Exponential eAt = I + At + (At)2 12! + ...
has derivative AeAt; eAt u(O) solves u' = Au.

Fibonacci numbers
0,1,1,2,3,5, ... satisfy Fn = Fnl + Fn 2 = (A7 A~)I()q A2). Growth rate Al = (1 + .J5) 12 is the largest eigenvalue of the Fibonacci matrix [ } A].

Fourier matrix F.
Entries Fjk = e21Cijk/n give orthogonal columns FT F = nI. Then y = Fe is the (inverse) Discrete Fourier Transform Y j = L cke21Cijk/n.

Free variable Xi.
Column i has no pivot in elimination. We can give the n  r free variables any values, then Ax = b determines the r pivot variables (if solvable!).

Hermitian matrix A H = AT = A.
Complex analog a j i = aU of a symmetric matrix.

Kronecker product (tensor product) A ® B.
Blocks aij B, eigenvalues Ap(A)Aq(B).

Linear combination cv + d w or L C jV j.
Vector addition and scalar multiplication.

Markov matrix M.
All mij > 0 and each column sum is 1. Largest eigenvalue A = 1. If mij > 0, the columns of Mk approach the steady state eigenvector M s = s > O.

Network.
A directed graph that has constants Cl, ... , Cm associated with the edges.

Orthogonal matrix Q.
Square matrix with orthonormal columns, so QT = Ql. Preserves length and angles, IIQxll = IIxll and (QX)T(Qy) = xTy. AlllAI = 1, with orthogonal eigenvectors. Examples: Rotation, reflection, permutation.

Pascal matrix
Ps = pascal(n) = the symmetric matrix with binomial entries (i1~;2). Ps = PL Pu all contain Pascal's triangle with det = 1 (see Pascal in the index).

Rank one matrix A = uvT f=. O.
Column and row spaces = lines cu and cv.