Discrete Math: Logic Problems, Truth Table and Rules of Inference

Please see the attached file for the fully formatted problems. 1. Construct the truth table for the compound proposition: [p (q r)] (r p) p q r ------------------------------------------------------------- T T T T T F T F T T F F F T T F T F F F T F F F 2. What is the negation of the quantified statement: For every integer, x, there is an integer, y, such that x + y = 0. 3. Use the rules of inference to deduce the following conclusion from the following set of premises. Premises: p r r q p s t ~q ~r ᠑... click for more

Graphs and Digraphs : Edge-Connectivity

If G is a graph of order n>=2 such that for all distinct nonadjacent vertices u and v, d(u)+d(v)>=n-1, then the edge-connectivity k1(G)=Deta(G), where Deta(G) is the least degree of G.

Discrete Math: Logic and Directed Graphs

Please see the attached file for the fully formatted problems. 1. Circle T for True or F for False as they apply to the following statements: T F Every compound is either a tautology or a contradiction. T F Integers are Rational. T F The empty set has no subsets. T F Onto functions map smaller sets to bigger sets. T F Disjoint sets have non-empty intersections. T F In Logic, the Implication process is, in reality, a Disjunctive process. T F A Sequence is a Function with the inputs selected in an ordered fashion. T F Bijective functions maps sets of the same cardinality to one another. T F The converse and inverse of a conditional statement are logically equivalent. T F The neg... click for more

Planar Graph

Prove that the complete graph K5 is nonplanar.

Recurrence Relations

I need to solve the following recurrence relation: (please see the attached file).