Chapter 1: Q43E (page 109)
Prove that you can use dominoes to tile a rectangular checkerboard with an even number of squares.
Dominoes can be used to tile a rectangular checkerboard with an even number of squares.
Over 30 million students worldwide already upgrade their learning with Vaia!
All the tools & learning materials you need for study success - in one app.
Get started for free
You can upgrade your operating system only if you have a 32-bit processor running at 1 GHz or faster, at least 1 GB RAM, and 16 GB free hard disk space, or a 64- bit processor running at 2 GHz or faster, at least 2 GB RAM, and at least 32 GB free hard disk space. Express you answer in terms of u: “You can upgrade your operating system,” b32: “You have a 32-bit processor,” b64: “You have a 64-bit processor,” g1: “Your processor runs at 1 GHz or faster,” g2: “Your processor runs at 2 GHz or faster,” r1: “Your processor has at least 1 GB RAM,” r2: “Your processor has at least 2 GB RAM,” h16: “You have at least 16 GB free hard disk space,” and h32: “You have at least 32 GB free hard disk space.”
Translate these statements into English, where the domain for each variable consists of all real numbers.
(a)
(b)
(c)
Let p and q be the propositions
p: You drive over 65 miles per hour.
q: You get a speeding ticket. Write these propositions using p and q and logical connectives (including negations).
a) You do not drive over 65 miles per hour.
b) You drive over 65 miles per hour, but you do not get a speeding ticket.
c) You will get a speeding ticket if you drive over 65 miles per hour.
d) If you do not drive over 65 miles per hour, then you will not get a speeding ticket.
e) Driving over 65 miles per hour is sufficient for getting a speeding ticket.
f) You get a speeding ticket, but you do not drive over 65 miles per hour.
g) Whenever you get a speeding ticket, you are driving over 65 miles per hour.
Use De Morgan’s laws to find the negation of each of the following statements.
(a) Kewame will take a job in industry or go to graduate school.
(b) Yoshiko knows Java and calculus.
(c) James is young and strong.
(d) Rita will move to Oregon or Washington.
Let p, q, and r be the propositions p : You get an A on the final exam. q : You do every exercise in this book. r : You get an A in this class. Write these propositions using p, q, and r and logical connectives (including negations).
a)You get an A in this class, but you do not do every exercise in this book.
b) You get an A on the final, you do every exercise in this book, and you get an A in this class.
c) To get an A in this class, it is necessary for you to get an A on the final.
d) You get an A on the final, but you don’t do every exercise in this book; nevertheless, you get an A in this class.
e) Getting an A on the final and doing every exercise in this book is sufficient for getting an A in this class.
f ) You will get an A in this class if and only if you either do every exercise in this book or you get an A on the final.
What do you think about this solution?
We value your feedback to improve our textbook solutions.
