Relations

S = {0, 1, 2, 4, 6} Test the binary relations on S for reflexivity, symmetry ,antisymmetry, and transitivity. Also find the reflexive, symmetric and transitive closure of each relations. A) P = {(0,0), (1,1), (2,2), (4,4), (6,6), (0,1), (1,2), (2,4), (4,6) } B) P {(0,1), (1,0), (2,4), (4,2), (4,6), (6,4)} C) P ((0 ...continues

Relations

Test the binary relations on S for reflexivity, symmetry ,antisymmetry, and transitivity A) S = Q X p Y <-> ABS(X) <= ABS(Y) B) S = Z X p Y <-> x -y is an integral multiple of 3 C) S = N X P Y <-> X is odd D) S = Set of all squares in the place S1 p S2 <-> length of side of S1 = length of side S2 E) ...continues

Relations

For each case, think of a set S and a binary relation p on S for - A. p is reflexive and symmetric but not transitive b. p is reflexive and transitive but not symmetric c. p is reflexive but neither symmetric nor transitive

Functions

Let P be the power set of {A, B} and let S be the set of all binary strings of length 2. A function f: P -> S is defined as follows: For A in P, f(A) has a 1 in the high-order bit position (left end of string) if and only if a is in A. f(A) has a 1 in the low-order bit position (right end of string) if and only if b is in A. Is ...continues

Functions

Let P be the power set of {a,b,c}. A function: f: P -> Z follows: For A in P, f(A) = the number of elements in A. Is f one-to-one? Prove or disprove. Is f onto? Prove or disprove.

Functions

Which functions are one-to-one? Which functions are onto? Describe the inverse function A)F:Z^2-N where f is f(x,y) x^2 +2y^2 B)F:N->N where f is f(x) = x/2 (x even) x+1 (x odd) C)F:N->N where f is f(x) = x+1 (x even) x-1 (x odd) D)h:N^3 -> N where h(x,y,z) = x + y -z

Functions

Find the composition of the following cycles representing permutations on A = {1,2,3,4,5,6,7,8} Answer as a composition of one or more disjoint cycles. A) (1,3,4) . (5,1,2) B) (2,7,8) . (1,2,4,6,8) C) (1,3,4) . (5,6) . (2,3,5) . (6,1)

Recursive definition

I need to give a recursive definition with initial condition(s). a.) The sequence {an}, n = 1,2,3,… where an = 2n. b.) The Fibonacci numbers 1, 1, 2, 3, 5, 8, 13, ….

Mathematical induction

a.) Use the Principle of Mathematical Induction to prove that n3 > n2 + 3 for all n ≥ 2. b.) Use mathematical induction to prove that every amount of postage of six cents or more can be formed using 3-cent and 4-cent stamps.

Matrices (Matrix Product Rule); Geometric Series

1. Suppose that A = ... and C = ... (see attachment). Find a matrix for B such that AB = C or prove that no such matrix exists 2. Find the sum ... (see attachment)