Discrete Mathematics: Introduction to Mathematical Reasoning
1st Edition
ISBN: 9780495826170
Author: Susanna S. Epp
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 2.1, Problem 17ES
To determine
Whether the given statement is logically equivalent with the help of truth table and include a sentence to justify the answer.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
By considering appropriate series expansions,
e². e²²/2. e²³/3.
....
=
= 1 + x + x² + ·
...
when |x| < 1.
By expanding each individual exponential term on the left-hand side
the coefficient of x- 19 has the form
and multiplying out,
1/19!1/19+r/s,
where 19 does not divide s. Deduce that
18! 1 (mod 19).
Proof: LN⎯⎯⎯⎯⎯LN¯ divides quadrilateral KLMN into two triangles. The sum of the angle measures in each triangle is ˚, so the sum of the angle measures for both triangles is ˚. So, m∠K+m∠L+m∠M+m∠N=m∠K+m∠L+m∠M+m∠N=˚. Because ∠K≅∠M∠K≅∠M and ∠N≅∠L, m∠K=m∠M∠N≅∠L, m∠K=m∠M and m∠N=m∠Lm∠N=m∠L by the definition of congruence. By the Substitution Property of Equality, m∠K+m∠L+m∠K+m∠L=m∠K+m∠L+m∠K+m∠L=°,°, so (m∠K)+ m∠K+ (m∠L)= m∠L= ˚. Dividing each side by gives m∠K+m∠L=m∠K+m∠L= °.°. The consecutive angles are supplementary, so KN⎯⎯⎯⎯⎯⎯∥LM⎯⎯⎯⎯⎯⎯KN¯∥LM¯ by the Converse of the Consecutive Interior Angles Theorem. Likewise, (m∠K)+m∠K+ (m∠N)=m∠N= ˚, or m∠K+m∠N=m∠K+m∠N= ˚. So these consecutive angles are supplementary and KL⎯⎯⎯⎯⎯∥NM⎯⎯⎯⎯⎯⎯KL¯∥NM¯ by the Converse of the Consecutive Interior Angles Theorem. Opposite sides are parallel, so quadrilateral KLMN is a parallelogram.
By considering appropriate series expansions,
ex · ex²/2 . ¸²³/³ . . ..
=
= 1 + x + x² +……
when |x| < 1.
By expanding each individual exponential term on the left-hand side
and multiplying out, show that the coefficient of x 19 has the form
1/19!+1/19+r/s,
where 19 does not divide s.
Chapter 2 Solutions
Discrete Mathematics: Introduction to Mathematical Reasoning
Ch. 2.1 - Prob. 1ESCh. 2.1 - Prob. 2ESCh. 2.1 - Prob. 3ESCh. 2.1 - Prob. 4ESCh. 2.1 - Prob. 5ESCh. 2.1 - Prob. 6ESCh. 2.1 - Prob. 7ESCh. 2.1 - Prob. 8ESCh. 2.1 - Prob. 9ESCh. 2.1 - Prob. 10ES
Ch. 2.1 - Prob. 11ESCh. 2.1 - Prob. 12ESCh. 2.1 - Prob. 13ESCh. 2.1 - Prob. 14ESCh. 2.1 - Prob. 15ESCh. 2.1 - Prob. 16ESCh. 2.1 - Prob. 17ESCh. 2.1 - Prob. 18ESCh. 2.1 - Prob. 19ESCh. 2.1 - Prob. 20ESCh. 2.1 - Prob. 21ESCh. 2.1 - Prob. 22ESCh. 2.1 - Prob. 23ESCh. 2.1 - Prob. 24ESCh. 2.1 - Prob. 25ESCh. 2.1 - Prob. 26ESCh. 2.1 - Prob. 27ESCh. 2.1 - Prob. 28ESCh. 2.1 - Prob. 29ESCh. 2.1 - Prob. 30ESCh. 2.1 - Prob. 31ESCh. 2.1 - Prob. 32ESCh. 2.1 - Prob. 33ESCh. 2.1 - Prob. 34ESCh. 2.1 - Prob. 35ESCh. 2.1 - Prob. 36ESCh. 2.1 - Prob. 37ESCh. 2.1 - Prob. 38ESCh. 2.1 - Prob. 39ESCh. 2.1 - Prob. 40ESCh. 2.1 - Prob. 41ESCh. 2.1 - Prob. 42ESCh. 2.1 - Prob. 43ESCh. 2.1 - Prob. 44ESCh. 2.1 - Prob. 45ESCh. 2.1 - Prob. 46ESCh. 2.1 - Prob. 47ESCh. 2.2 - Prob. 1ESCh. 2.2 - Prob. 2ESCh. 2.2 - Prob. 3ESCh. 2.2 - Prob. 4ESCh. 2.2 - Prob. 5ESCh. 2.2 - Prob. 6ESCh. 2.2 - Prob. 7ESCh. 2.2 - Prob. 8ESCh. 2.2 - Prob. 9ESCh. 2.2 - Prob. 10ESCh. 2.2 - Prob. 11ESCh. 2.2 - Prob. 12ESCh. 2.2 - Prob. 13ESCh. 2.2 - Prob. 14ESCh. 2.2 - Prob. 15ESCh. 2.2 - Prob. 16ESCh. 2.2 - Prob. 17ESCh. 2.2 - Prob. 18ESCh. 2.2 - Prob. 19ESCh. 2.2 - Prob. 20ESCh. 2.2 - Prob. 21ESCh. 2.2 - Prob. 22ESCh. 2.2 - Prob. 23ESCh. 2.2 - Prob. 24ESCh. 2.2 - Prob. 25ESCh. 2.2 - Prob. 26ESCh. 2.2 - Prob. 27ESCh. 2.2 - Prob. 28ESCh. 2.2 - Prob. 29ESCh. 2.2 - Prob. 30ESCh. 2.2 - Prob. 31ESCh. 2.2 - Prob. 32ESCh. 2.2 - Prob. 33ESCh. 2.2 - Prob. 34ESCh. 2.2 - Prob. 35ESCh. 2.2 - Prob. 36ESCh. 2.2 - Prob. 37ESCh. 2.2 - Prob. 38ESCh. 2.2 - Prob. 39ESCh. 2.2 - Prob. 40ESCh. 2.2 - Prob. 41ESCh. 2.2 - Prob. 42ESCh. 2.2 - Prob. 43ESCh. 2.2 - Prob. 44ESCh. 2.2 - Prob. 45ESCh. 2.2 - Prob. 46ESCh. 2.3 - Prob. 1ESCh. 2.3 - Prob. 2ESCh. 2.3 - Prob. 3ESCh. 2.3 - Prob. 4ESCh. 2.3 - Prob. 5ESCh. 2.3 - Prob. 6ESCh. 2.3 - Prob. 7ESCh. 2.3 - Prob. 8ESCh. 2.3 - Prob. 9ESCh. 2.3 - Prob. 10ESCh. 2.3 - Prob. 11ESCh. 2.3 - Prob. 12ESCh. 2.3 - Prob. 13ESCh. 2.3 - Prob. 14ESCh. 2.3 - Prob. 15ESCh. 2.3 - Prob. 16ESCh. 2.3 - Prob. 17ESCh. 2.3 - Prob. 18ESCh. 2.3 - Prob. 19ESCh. 2.3 - Prob. 20ESCh. 2.3 - Prob. 21ESCh. 2.3 - Prob. 22ESCh. 2.3 - Prob. 23ESCh. 2.3 - Prob. 24ESCh. 2.3 - Prob. 25ESCh. 2.3 - Prob. 26ESCh. 2.3 - Prob. 27ESCh. 2.3 - Prob. 28ESCh. 2.3 - Prob. 29ESCh. 2.3 - Prob. 30ESCh. 2.3 - Prob. 31ESCh. 2.3 - Prob. 32ESCh. 2.3 - Prob. 33ESCh. 2.3 - Prob. 34ESCh. 2.3 - Prob. 35ESCh. 2.3 - Prob. 36ESCh. 2.3 - Prob. 37ESCh. 2.3 - Prob. 38ESCh. 2.3 - Prob. 39ESCh. 2.3 - Prob. 40ESCh. 2.3 - Prob. 41ESCh. 2.3 - Prob. 42ESCh. 2.3 - Prob. 43ESCh. 2.3 - Prob. 44ES
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Let 1 1 r 1+ + + 2 3 + = 823 823s Without calculating the left-hand side, prove that r = s (mod 823³).arrow_forwardFor each real-valued nonprincipal character X mod 16, verify that L(1,x) 0.arrow_forward*Construct a table of values for all the nonprincipal Dirichlet characters mod 16. Verify from your table that Σ x(3)=0 and Χ mod 16 Σ χ(11) = 0. x mod 16arrow_forward
- For each real-valued nonprincipal character x mod 16, verify that A(225) > 1. (Recall that A(n) = Σx(d).) d\narrow_forward24. Prove the following multiplicative property of the gcd: a k b h (ah, bk) = (a, b)(h, k)| \(a, b)' (h, k) \(a, b)' (h, k) In particular this shows that (ah, bk) = (a, k)(b, h) whenever (a, b) = (h, k) = 1.arrow_forward20. Let d = (826, 1890). Use the Euclidean algorithm to compute d, then express d as a linear combination of 826 and 1890.arrow_forward
- Let 1 1+ + + + 2 3 1 r 823 823s Without calculating the left-hand side, Find one solution of the polynomial congruence 3x²+2x+100 = 0 (mod 343). Ts (mod 8233).arrow_forwardBy considering appropriate series expansions, prove that ez · e²²/2 . e²³/3 . ... = 1 + x + x² + · ·. when <1.arrow_forwardProve that Σ prime p≤x p=3 (mod 10) 1 Р = for some constant A. log log x + A+O 1 log x ,arrow_forward
- Let Σ 1 and g(x) = Σ logp. f(x) = prime p≤x p=3 (mod 10) prime p≤x p=3 (mod 10) g(x) = f(x) logx - Ր _☑ t¯¹ƒ(t) dt. Assuming that f(x) ~ 1½π(x), prove that g(x) ~ 1x. 米 (You may assume the Prime Number Theorem: 7(x) ~ x/log x.) *arrow_forwardLet Σ logp. f(x) = Σ 1 and g(x) = Σ prime p≤x p=3 (mod 10) (i) Find ƒ(40) and g(40). prime p≤x p=3 (mod 10) (ii) Prove that g(x) = f(x) logx – [*t^¹ƒ(t) dt. 2arrow_forwardYou guys solved for the wrong answer. The answer in the box is incorrect help me solve for the right one.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALGlencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw Hill
Holt Mcdougal Larson Pre-algebra: Student Edition...
Algebra
ISBN:9780547587776
Author:HOLT MCDOUGAL
Publisher:HOLT MCDOUGAL
Glencoe Algebra 1, Student Edition, 9780079039897...
Algebra
ISBN:9780079039897
Author:Carter
Publisher:McGraw Hill
Propositional Logic, Propositional Variables & Compound Propositions; Author: Neso Academy;https://www.youtube.com/watch?v=Ib5njCwNMdk;License: Standard YouTube License, CC-BY
Propositional Logic - Discrete math; Author: Charles Edeki - Math Computer Science Programming;https://www.youtube.com/watch?v=rL_8y2v1Guw;License: Standard YouTube License, CC-BY
DM-12-Propositional Logic-Basics; Author: GATEBOOK VIDEO LECTURES;https://www.youtube.com/watch?v=pzUBrJLIESU;License: Standard Youtube License
Lecture 1 - Propositional Logic; Author: nptelhrd;https://www.youtube.com/watch?v=xlUFkMKSB3Y;License: Standard YouTube License, CC-BY
MFCS unit-1 || Part:1 || JNTU || Well formed formula || propositional calculus || truth tables; Author: Learn with Smily;https://www.youtube.com/watch?v=XV15Q4mCcHc;License: Standard YouTube License, CC-BY