1. Raj wants to paint a checkered pathway in a park (really really big) with red and green paints. He wants to paint all the squares on the pathway such that it has no rectangle with all the corners in the same color (Let us call them the mono-corner rectangles). The picture on the left shows a correct case and picture on the right shows a failure case i.e. a mono- corner rectangle (since all 4 corners of the rectangle have same color). (a) Prove that it is impossible for Raj to paint all the squares of the pathway without any mono-corner rectangles. (b) Prove that using 3 colors instead of 2 will not help avoid the mono- corner rectangles.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Needed urgently... do it fast as possible... do both parts (a) and (b)

1. Raj wants to paint a checkered pathway in a park (really really big) with
red and green paints. He wants to paint all the squares on the pathway
such that it has no rectangle with all the corners in the same color (Let
us call them the mono-corner rectangles). The picture on the left shows
a correct case and picture on the right shows a failure case i.e. a mono-
corner rectangle (since all 4 corners of the rectangle have same color).
(a) Prove that it is impossible for Raj to paint all the squares of the
pathway without any mono-corner rectangles.
(b) Prove that using 3 colors instead of 2 will not help avoid the mono-
corner rectangles.
Transcribed Image Text:1. Raj wants to paint a checkered pathway in a park (really really big) with red and green paints. He wants to paint all the squares on the pathway such that it has no rectangle with all the corners in the same color (Let us call them the mono-corner rectangles). The picture on the left shows a correct case and picture on the right shows a failure case i.e. a mono- corner rectangle (since all 4 corners of the rectangle have same color). (a) Prove that it is impossible for Raj to paint all the squares of the pathway without any mono-corner rectangles. (b) Prove that using 3 colors instead of 2 will not help avoid the mono- corner rectangles.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Probability Problems
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education