This is for a discrete structures course. 1.(a). Use a truth table to verify the logical equivalence. below.(p^g)v(: p^g)v(p^: q) = pvq(b) Use Theorem 2.1.1 provided to you on exam paper to verify the given logicalequivalence. Give a reason from the Theorem for each step in your proof.Theorem 2.1.1 Logical EquivalencesGiven any statement variables p, q, and r, a tautology t and a contradiction c, the following logical equivalenceshold.1. Commutative laws:p vq mq v p(p v q) Vr = pv (q vr)p v (q Ar) = (p vq)A (p vr)2. Associative laws:(pAq) ar = pa (g ar)3. Distributive laws:PA (q vr) = (p A q) V (par)4. Identity laws:pat= ppVCm p5. Negation laws:pv ~p atPA~p = c6. Double negative law:(~p) p7. Idempotent laws:pv p= p8. Universal bound laws:pvt=tpAce(p v q) =~p A ngpA (p v q) = p9. De Morgan's laws:(p Aq) =~p v ng10. Absorption laws:11. Negations of t and e:pv (p Ag) = pe =t

Answered: Image /qna-images/answer/3356cdd6-f98c-4951-b5ff-ee66377b9ea6.jpg

1.(a). logic equiva (pag)v(: pag)v(pn: q)= pvq (b) Use Theorem 2.1.1 provided to you on exam paper to verify the given logical equivalence. Give a reason from the Theorem for each step in your proof. Theorem 2.1.1 Logical Equivalences Given any statement variables p, q, and r, a tautology t and a contradiction e, the following logical equivalences hold. p vq =q V p (p v q) vr = pv (q vr) p v (q ar) = (p vq) A (p vr) 1. Commutative laws: png =qAp 2. Associative laws: (pAq) Ar = p (a ar) 3. Distributive laws: pa (g vr) = (p ng) v (par) 4. Identity laws: 5. Negation laws: pat= p pVC= p pv ~p =t 6. Double negative law: (~p) = p 7. Idempotent laws: pvp = p pap=p 8. Universal bound laws: pvt=t (p v q) =~pA ng pA (p v q) = p 9. De Morgan's laws: (p Aq) =~p v ng 10. Absorption laws: pv (p Ag) p 11. Negations of t and e: e =t

1.(a). logic equiva (pag)v(: pag)v(pn: q)= pvq (b) Use Theorem 2.1.1 provided to you on exam paper to verify the given logical equivalence. Give a reason from the Theorem for each step in your proof. Theorem 2.1.1 Logical Equivalences Given any statement variables p, q, and r, a tautology t and a contradiction e, the following logical equivalences hold. p vq =q V p (p v q) vr = pv (q vr) p v (q ar) = (p vq) A (p vr) 1. Commutative laws: png =qAp 2. Associative laws: (pAq) Ar = p (a ar) 3. Distributive laws: pa (g vr) = (p ng) v (par) 4. Identity laws: 5. Negation laws: pat= p pVC= p pv ~p =t 6. Double negative law: (~p) = p 7. Idempotent laws: pvp = p pap=p 8. Universal bound laws: pvt=t (p v q) =~pA ng pA (p v q) = p 9. De Morgan's laws: (p Aq) =~p v ng 10. Absorption laws: pv (p Ag) p 11. Negations of t and e: e =t

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

Determine the maximum and minimum values of the objective function F(x,y) -2x +5y from the shaded area in the figure above! Please help me!!
During each 6-hour period of the day, the Bloomington Police Department needs at least the number of policemen shown in the following table. Policemen can be hired to work either 12 consecutive hours or 18 consecutive hours. Policemen are paid $15 per hour for each of the first 12 hours a day they work and are paid $22.5 per hour for each of the next 6 hours they work in a day. Formulate an LP that can be used to minimize the cost of meeting Bloomington’s daily police requirements and solve it via Excel. Time Period Number of required policemen 12:00AM----6:00AM 12 6:00AM----12:00PM 8 12:00PM----6:00PM 6 6:00PM----12:00AM 15
to part a, write the linear constraints necessary to enforce this restriction. 2) We have just solved a product-mix problem with 4 types of products (W, X, Y, Z), where the total profit (in $ US) is maximized and Excel Solver generates the sensitivity report given in the Table below. Please pick the best answer for the following questions regarding sensitivity analysis and give explanation for each answer. Variable Cells Objective Coefficient 450 Final Reduced Allowable Allowable Name Value 23.36 Cost Increase 300 Decrease 66.67 42.86 1E+30 Y 17.55 0. 1150 350 ??? 27.27 27.27 800 300 W ?2? -95.45 95.45 IE+30 Constraints Constraint Final Shadow Allowable Allowable Decrease Increase 1E-30 Name Value Price R.H. Side 254.55 5545.45 730 29200 33590 91 5800 730 29200 60500 Resouree 1 Resource 2 71.82 280 193 2800 8566.67 Resource 3 0.18 1E-30 26909.09 Resource 4 0.
Prime Paints manufactures two types of paints, one for interior painting and the other for exterior painting. Both types require the use of two raw materials - M1 and M2, so that the maximum daily availabilities of these materials are 24 tons and 6 tons, respectively. It is known that 1 ton of the interior type of paint requires 4 tons of M1 and 2 tons of M2. On the other hand, 1 ton of the exterior type of paint requires 6 tons of M1 and 1 ton of M2. It has been established that the daily demand for interior paint cannot exceed that for the exterior paint by more than 1 ton. Also, the maximum daily demand for interior paint is 2 tons. The company wants to determine the optimum product mix of interior and exterior paints to maximize the total daily profit given that the profit per ton of the interior paint is 4 thousand dollars and the profit per ton of the exterior paint is 5 thousand dollars.
A LP model is given as Max z = 3x1+ 2x2 Subj to 2x1 + 2x2 0 Obtain the dual of the model. Use the variables y1, Y2, Y3, · . . Objective function: Min w= Constraint 1: Constraint 2: With: >0
A chemical manufacturing plant can produce z units of chemical Z given p units of chemical P and r units of chemical R, where: Chemical P costs $100 a unit and chemical R costs $400 a unit. The company wants to produce as many units of chemical Z as possible with a total budget of $80,000. 2= 100p0.8.0.2 A) How many units each chemical (P and R) should be "purchased" to maximize production of chemical Z subject to the budgetary constraint? Units of chemical P, p = Units of chemical R, r = B) What is the maximum number of units of chemical Z under the given budgetary conditions? (Round your answer to the nearest whole unit.) Max production, z= units
i need the answer quickly
(4) Assume that a website www.funwithmath1600.ag has three pages: Page A: KingAlgebra Page B: Learn1600andWin • Page C: Linear AlgbraIsEverywhere Each page has some links to the other pages of this website and no pages links to any page outside this website. Page A has three links to page B and only one link to page C. • Page B has three links to page A and two links to page C. • Page C has one link to page A and two links to page B. A student decides to explore this website starting from page A. Since reading content is always a boring task (is it?!) they decide to choose one of the links in page A with equal probability and click on the link to see the next page. As a result, on the next step, they will end up on page B with probability 3/4 and on the page C with probability 1/4. This process is then continued by the student with the same rule: Go the next page by clicking, with equal probability, on one of the existing links that are on the present page. (Use only fractions in your…