Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Use a proof by exhaustion to show that a tiling using dominoes of a 4 × 4 checkerboard with opposite corners removed does not exist. [Hint: First show that you can assume that the squares in the upper left and lower right corners are removed. Number the squares of the original checkerboard from 1 to 16, starting in the first row, moving right in this row, then starting in the leftmost square in the second row and moving right, and so on. Remove squares 1 and 16. To begin the proof, note that square 2 is covered either by a domino laid horizontally, which covers squares 2 and 3, or vertically, which covers squares 2 and 6. Consider each of these cases separately, and work through all the subcases that arise.]

Short Answer

Expert verified

A tiling that uses dominoes of a checkerboard with opposite corners removed does not exist.

Step by step solution

01

Introduction

A standard checkerboard is a board with 8 rows and 8 columns, forming squares of equal size.

A domino is a rectangle, equal to the size of two squares attached either horizontally or vertically.

A board is tiled by dominoes when all its squares are covered with no overlapping dominoes and no dominoes overhanging the board.

02

Proof using exhaustion

First, we will number the squares from 1 to 16.

Now, we can rotate the board if necessary to make the removed squares be 1 and 16. A domino must cover square 2.

If that domino is placed to cover squares 2 and 6, then the following domino placements are forced in succession: 5-9, 13-14, and 10-11, at which point there is no way to cover square 15.

Otherwise, a domino placed at 2-3 must cover square 2. Then the following domino placements are forced: 4-8, 11-12, 6-7, 5-9, and 10-14, and again there is no way to cover square 15.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Let p and q be the propositions “Swimming at the New Jersey shore is allowed” and “Sharks have been spotted near the shore,” respectively. Express each of these compound propositions as an English sentence

a) ¬q

b) pq

c)¬pq

d)p¬q

e)¬qp

f )¬p¬q

g)p¬q

h)¬p(p¬q)

Write each of these statements in the form “if p, then q” in English. [Hint: Refer to the list of common ways to express conditional statements provided in this section.]


a) It is necessary to wash the boss’s car to get promoted.
b) Winds from the south imply a spring thaw.
c) A sufficient condition for the warranty to be good is that you bought the computer less than a year ago.
d) Willy gets caught whenever he cheats.
e) You can access the website only if you pay a subscription fee.
f ) Getting elected follows from knowing the right people.
g) Carol gets seasick whenever she is on a boat.

Are these system specifications consistent? “The router can send packets to the edge system only if it supports the new address space. For the router to support the new address space it is necessary that the latest software release be installed. The router can send packets to the edge system if the latest software release is installed, The router does not support the new address space.”


Use De Morgan’s laws to find the negation of each of the following statements.

(a) Jan is rich and happy.

(b) Carlos will bicycle or run tomorrow.

(c) Mei walks or takes the bus to the class.

(d) Ibrahim is smart and hard working.

Explain, without using a truth table, why \((p \vee \neg q) \wedge (q \vee \neg r) \wedge (r \vee \neg p)\) is true when \(p,\;q\), and \(r\) have the same truth value and it is false otherwise.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free