Hi everyone! This online lesson is provided as a resource â€“ we will also go over this material in class.

Lesson 8: Negating Statements, Counting Lists

**Topic**. This lesson covers:

- Sec 2.10 Negating Statements
- Sec 3.1 Counting Lists
- Sec 3.2 Factorials

**Learning Outcomes.**

- Apply rules for negating various types of statements, both in formal logic and natural language
- Count collections of lists with various properties

**Homework**. There is one WeBWorK assignment on today’s material (Note: some of the material in this assignment will be covered in the next lesson):

**WeBWorK:**WeBWorK Assignment5-Sec3.1-3.4

**Lecture Notes:**

## Vocabulary

- list
- entry
- length
- empty list
- multiplication principle
- repetitive and non-repetitive lists
- factorial

## Negating Statements

Our final topic in Logic is something that will be of considerable use to us in proofs – rules for simplifying the negations of statements. We have already learned how negations work with conjunctions and disjunctions (De Morgan’s Laws), and today we complete our collection by learning how they work with conditional statements and quantifiers.

Rules for negating statements (quantifiers and conditional statements)

RECALL: Rules for negating conjunctions and disjunctions (De Morgan’s Laws)

**Example 1**. Find the negation of the sentence, both in symbols and in words.

a. : and are both odd.

b. : All prime numbers are odd.

c. The square of every real number is non-negative.

d. For every real number , there is a real number for which

e. If is odd, then is even.

*VIDEO: Negating Statements*

## Chapter 3: Combinatorics

In the course so far we have covered two very important topics related to proofs, Set Theory and Logic. We now take a slight detour into Combinatorics, or the science of counting. This will let us flex our logical reasoning muscles (as we develop various formulas for counting things), and will also provide great material that we will revisit later while proving things.

### Counting Lists

It turns out that *lists* are a very useful way to think about organizing and counting objects. A *list* is similar to a *set*, with some exceptions (the order matters, and objects can be repeated).

**Definition. **A **list** is an ordered sequence of objects (called **entries** in the list). The **length** of a list is simply the number of entries. A list is typically written enclosed in parentheses, with objects separated by commas. An ordered pair is simply a list of length 2.

- Example: is a list of length 5.
- Order matters in a list, so
- Objects can be repeated in a list: is a list of length 4.
- The
**empty list**, or list with no entries, is the only list with length 0.

**Example 2. **Make a list of length 3 in which the first entry comes from the set the second entry comes from the set and the third entry comes from the set . How many such lists are there?

*VIDEO: Introduction to Lists – Example 2*

**Multiplication Principle**. Suppose in making a list of length that there are possible choices for the first entry, possible choices for the second entry, possible choices for the third entry, and so on. The the number of different lists that can be made in this way is the product

**Example 3**. A standard license plate consists of three letters followed by four numbers. For example JRB-4412 and MMX-8901 are two different standard license places. How many different standard license plates are possible?

**Example 4**. Consider making lists from the set . How many length-4 lists are possible if:

a) repetition is allowed? *â€śrepetitive listsâ€ť*

b) repetition is NOT allowed? *â€śnon-repetitive listsâ€ť*

c) repetition is NOT allowed and the list must contain an *E*?

d) repetition is allowed and the list must contain an E?

*NOTE: Depending on your prior experience, you may be more familiar with the phrases â€świth replacementâ€ť (repetitive list), and â€świthout replacementâ€ť (non-repetitive list).*

*VIDEO: Counting Lists – Examples 3 and 4*

**Definition**. If *n* is a non-negative integer, then ** n factorial, **written n!, is the number of non-repetitive lists of length

*n*that can be made from

*n*symbols.

**Example 5. ***Using the definition*, calculate , , , . What is ?

#### Exit Question

This problem involves making lists of length from the set .

a) How many such lists are there if repetition is allowed?

b) How many such lists are there if repetition is allowed *and* the first three entries must be odd?

c) How many such lists are there if repetition is not allowed?

d) How many such lists are there if repetition is not allowed *and* the first three entries must be odd?

e) How many such lists are there in which repetition **is** allowed, and the list **must** contain at least one repeated number?

#### Answer

a)

b)

c)

d)

d)

## Leave a Reply