# MTH 221 - Discrete Math for Information Technology

**Question description**

Chapter 4: | |||||||||||||||||||

4.1-4 | |||||||||||||||||||

A wheel of fortune has the integers from 1 to 25 randomly placed on it. Show that regardless of how the numbers are positioned on the wheel, there are three adjacent numbers whose sum is at least 39. | |||||||||||||||||||

4.3-4 | |||||||||||||||||||

If a, b, c ∈ Z^{+} and a|bc, does it follow that a|b or a|c? |
|||||||||||||||||||

Chapter 5: | |||||||||||||||||||

5.1-8 | |||||||||||||||||||

Logic chips are taken from a container, tested individually, and labeled defective or good. The testing process is continued until either two defective chips are found or five chips are tested in total. | |||||||||||||||||||

Using a tree diagram, exhibit a sample space for this process. | |||||||||||||||||||

5.7-6 | (See the definition 5.23 on page 290 for help with this problem.) | ||||||||||||||||||

Let f,g: Z^{+}→R be defined as follows: |
|||||||||||||||||||

Verify that f ∉ O(g) and g∉O(f) |

## Tutor Answer

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors