Week7

Theorem: Every positive integer is a sum of (one or more) distinct powers of $2$. Binary expansions exist!

Definition For $n$ a positive integer, the binary expansion of $n$ is \[(a_{k-1} \cdots a_1 a_0)_b\] where $k$ is a positive integer, $a_0, a_1, \ldots, a_{k-1}$ are each $0$ or $1$, $a_{k-1} \neq 0$, and \[n = \sum_{i=0}^{k-1} a_{i} b^{i}\]

The idea in the “Least significant first" algorithm for computing binary expansions is that the binary expansion of half a number becomes part of the binary expansion of the number of itself. We can use this idea in a proof by strong induction that binary expansions exist for all positive integers $n$.

Assume (as the strong induction hypothesis, IH) that the property is true about each of $1, \ldots, n$.

By the IH, we can write $(n+1) \textbf{ div } 2$ as a sum of powers of $2$. In other words, there are values $a_{k-1}, \ldots, a_0$ such that each $a_i$ is $0$ or $1$, $a_{k-1} = 1$, and \[\sum_{i=0}^{k-1} a_i 2^i = (n+1) \textbf{ div } 2\] Define the collection of coefficients \[c_{j} = \begin{cases} a_{j-1} \qquad&\text{if $1 \leq j \leq k$}\\ (n+1) \textbf{ mod } 2 &\text{if $j = 0$} \end{cases}\] Calculating: \[\begin{aligned} {2} \sum_{j=0}^k c_j 2^j &= c_0 + \sum_{j=1}^k c_j 2^j = c_0 + \sum_{i=0}^{k-1} c_{i+1} 2^{i+1} &\qquad &\text{re-indexing the summation}\\ &= c_0 + 2 \cdot \sum_{i=0}^{k-1} c_{i+1}2^i &\qquad &\text{factoring out a $2$ from each term in the sum}\\ &= c_0 + 2 \cdot \sum_{i=0}^{k-1} a_{i} 2^i &\qquad &\text{by definition of $c_{i+1}$}\\ &= c_0 + 2 \left(~(n+1) \textbf{ div } 2 ~\right) &\qquad &\text{by IH} \\ &= \left(~ (n+1) \textbf{ mod } 2 ~\right ) + 2 \left(~(n+1) \textbf{ div } 2 ~\right) &\qquad &\text{by definition of $c_0$} \\ &= n+1 &\qquad&\text{by definition of long division} \end{aligned}\]

Representing positive integers with primes

Theorem: Every positive integer greater than 1 is a product of (one or more) primes.

Recursive step: Consider an arbitrary integer $n \geq 2$. Assume (as the strong induction hypothesis, IH) that the property is true about each of $2, \ldots, n$. WTS that the property is true about $n+1$: We want to show that $n+1$ can be written as a product of primes. Notice that $n+1$ is itself prime or it is composite.

Case 1: assume $n+1$ is prime and then immediately it is written as a product of (one) prime so we are done.

Case 2: assume that $n+1$ is composite so there are integers $x$ and $y$ where $n+1 = xy$ and each of them is between $2$ and $n$ (inclusive). Therefore, the induction hypothesis applies to each of $x$ and $y$ so each of these factors of $n+1$ can be written as a product of primes. Multiplying these products together, we get a product of primes that gives $n+1$, as required.

Since both cases give the necessary conclusion, the proof by cases for the recursive step is complete.

Sending old-fashioned mail with postage stamps

Suppose we had postage stamps worth $5$ cents and $3$ cents. Which number of cents can we form using these stamps? In other words, which postage can we pay?

\[\begin{aligned} &CanPay(0) \land \lnot CanPay(1) \land \lnot CanPay(2) \land \\ &CanPay(3) \land \lnot CanPay(4) \land CanPay(5) \land CanPay(6) \\ &\lnot CanPay(7) \land \forall n \in \mathbb{Z}^{\geq 8} CanPay(n) \end{aligned}\]

where the predicate $CanPay$ with domain $\mathbb{N}$ is \[CanPay(n) = \exists x \in \mathbb{N} \exists y \in \mathbb{N} ( 5x+3y = n)\]

Proof (idea): First, explicitly give witnesses or general arguments for postages between $0$ and $7$. To prove the universal claim, we can use mathematical induction or strong induction.

Approach 1, mathematical induction: if we have stamps that add up to $n$ cents, need to use them (and others) to give $n+1$ cents. How do we get $1$ cent with just $3$-cent and $5$-cent stamps?

The details of this proof by mathematical induction are making sure we have enough stamps to use one of these approaches.

Approach 2, strong induction: assuming we know how to make postage for all smaller values (greater than or equal to $8$), when we need to make $n+1$ cents, add one $3$ cent stamp to however we make $(n+1) - 3$ cents.

The details of this proof by strong induction are making sure we stay in the domain of the universal when applying the induction hypothesis.

Finding a winning strategy for a game

Consider the following game: two players start with two (equal) piles of jellybeans in front of them. They take turns removing any positive integer number of jellybeans at a time from one of two piles in front of them in turns.

Try out some games, starting with $1$ jellybean in each pile, then $2$ jellybeans in each pile, then $3$ jellybeans in each pile. Who wins in each game?

Notice that reasoning about the strategy for the $1$ jellybean game is easier than about the strategy for the $2$ jellybean game.

Formulate a winning strategy by working to transform the game to a simpler one we know we can win.

Player 2’s Strategy: Take the same number of jellybeans that Player 1 did, but from the opposite pile.

Why is this a good idea: If Player 2 plays this strategy, at the next turn Player 1 faces a game with the same setup as the original, just with fewer jellybeans in the two piles. Then Player 2 can keep playing this strategy to win.

Proof: By strong induction, we will prove that for all positive integers $n$, Player 2’s strategy guarantees a win in the game that starts with $n$ jellybeans in each pile.

Basis step: WTS Player 2’s strategy guarantees a win when each pile starts with $1$ jellybean.

In this case, Player 1 has to take the jellybean from one of the piles (because they can’t take from both piles at once). Following the strategy, Player 2 takes the jellybean from the other pile, and wins because this is the last jellybean.

Recursive step: Let $n$ be a positive integer. As the strong induction hypothesis, assume that Player 2’s strategy guarantees a win in the games where there are $1, 2, \ldots, n$ many jellybeans in each pile at the start of the game.

WTS that Player 2’s strategy guarantees a win in the game where there are $n+1$ in the jellybeans in each pile at the start of the game.

In this game, the first move has Player 1 take some number, call it $c$ (where $1 \leq c \leq n+1$), of jellybeans from one of the piles. Playing according to their strategy, Player 2 then takes the same number of jellybeans from the other pile.

Case 1: Assume $c = n+1$, then in their first move, Player 2 wins because they take all of the second pile, which includes the last jellybean.

Case 2: Assume $c \leq n$. Then after Player 2’s first move, the two piles have an equal number of jellybeans. The number of jellybeans in each pile is \[(n+1) - c\] and, since $1 \leq c \leq n$, this number is between $1$ and $n$. Thus, at this stage of the game, the game appears identical to a new game where the two piles have an equal number of jellybeans between $1$ and $n$. Thus, the strong induction hypothesis applies, and Player 2’s strategy guarantees they win.

Week 7 Wednesday: Recursive Data Structures

Definition The set of linked lists of natural numbers $L$ is defined recursively by \[\begin{array}{ll} \textrm{Basis Step: } & [] \in L \\ \textrm{Recursive Step: } & \textrm{If } l \in L\textrm{ and }n \in \mathbb{N} \textrm{, then } (n, l) \in L \end{array}\]

Example: the list with two nodes whose first node has $20$ and whose second node has $42$

Definition: The length of a linked list of natural numbers $L$, $length: L \to \mathbb{N}$ is defined by \[\begin{array}{llll} \textrm{Basis Step:} & & length(~[]~) &= 0 \\ \textrm{Recursive Step:} & \textrm{If } l \in L\textrm{ and }n \in \mathbb{N}\textrm{, then } & length(~(n, l)~) &= 1+ length(l) \end{array}\]

Definition: The function $prepend : L \times \mathbb{N} \to L$ that adds an element at the front of a linked list is defined by \[\phantom{prepend(~(l, n)~) = (n, l)}\]

Definition The function $append : L \times \mathbb{N} \to L$ that adds an element at the end of a linked list is defined by \[\begin{array}{llll} \textrm{Basis Step:} & \textrm{If } m \in \mathbb{N}\textrm{ then } & \phantom{append(~([], m)~)} & \phantom{= (m, []) }\\ \textrm{Recursive Step:} & \textrm{If } l \in L\textrm{ and }n \in \mathbb{N}\textrm{ and }m \in \mathbb{N}\textrm{, then } & \phantom{append(~(~(n, l), m~)~) } &\phantom{= (n, append(~(l, m)~)~)} \end{array}\]

Consider an arbitrary: $l' \in L$, $n \in \mathbb{N}$, and we assume as the induction hypothesis that: \[length(~append(~(l', 100~)~)~) > length(l')\] Our goal is to show that $length(~append( ~(~(n,l'), 100~)~)~) > length(~(n,l')~)$ is also true. We start by working with one side of the candidate inequality: \[\begin{aligned} LHS &= length(~append( ~(~ (n,l'), 100~)~)~) \\ &= length(~(n, append(~(l', 100)~)~ )~) \qquad \text{by the recursive definition of $append$}\\ &= 1 + length(~ append(~(l', 100)~) ~) \qquad \text{by the recursive definition of $length$}\\ &> 1+ length(l') \qquad \text{by the induction hypothesis}\\ &= length( (n,l') ) \qquad \text{by the recursive definition of $length$}\\ &= RHS \end{aligned}\]

Prove or disprove: $\forall n \in \mathbb{N} ~\exists l \in L ~(~length(l) = n~)$

Week 7 Friday: Proof by Contradiction

Least and greatest

For a set of numbers $X$, how do you formalize “there is a greatest $X$” or “there is a least $X$”?

Extra examples: Prove or disprove that $\mathbb{N}$, $\mathbb{Q}$ each have a least and a greatest element.

Definition: Greatest common divisor Let $a$ and $b$ be integers, not both zero. The largest integer $d$ such that $d$ is a factor of $a$ and $d$ is a factor of $b$ is called the greatest common divisor of $a$ and $b$ and is denoted by $gcd(~(a, b)~)$.

Proof: Show that $1$ is a common factor of any two integers, so since the gcd is the greatest common factor it is greater than or equal to any common factor.

Claim: For any positive integers $a,b$, $gcd(~(a,b)~) \leq a$ and $gcd( ~(a,b)~) \leq b$.

Proof Using the definition of gcd and the fact that factors of a positive integer are less than or equal to that integer.

Claim: For any positive integers $a,b$, if $a$ divides $b$ then $gcd(~(a,b)~) = a$.

Claim: For any positive integers $a,b,c$, if there is some integer $q$ such that $a = bq + c$, \[gcd(~(a,b)~) = gcd (~(b,c)~)\] Proof Prove that any common divisor of $a,b$ divides $c$ and that any common divisor of $b,c$ divides $a$.

Lemma: For any integers $p, q$ (not both zero), $gcd \left(~ \left(~\frac{p}{gcd(~(p,q)~)}, \frac{q}{gcd(~(p,q)~)} ~\right) ~\right) = 1$ . In other words, can reduce to relatively prime integers by dividing by gcd.

Let $x$ be arbitrary positive integer and assume that $x$ is a factor of each of $\frac{p}{gcd(~(p,q)~)}$ and $\frac{q}{gcd(~(p,q)~)}$. This gives integers $\alpha$, $\beta$ such that \[\alpha x = \frac{p}{gcd(~(p,q)~)} \qquad \qquad \beta x = \frac{q}{gcd(~(p,q)~)}\] Multiplying both sides by the denominator in the RHS: \[\alpha x \cdot gcd(~(p,q)~)= p \qquad \qquad \beta x \cdot gcd(~(p,q)~)= q\] In other words, $x \cdot gcd(~(p,q)~)$ is a common divisor of $p, q$. By definition of $gcd$, this means \[x \cdot gcd (~(p,q)~) \leq gcd (~(p,q)~)\] and since $gcd(~(p,q)~)$ is positive, this means, $x \leq 1$.

Sets of numbers

We’ve seen multiple representations of the set of positive integers (using base expansions and using prime factorization). Now we’re going to expand our attention to other sets of numbers as well.

The set of rational numbers, $\mathbb{Q}$ is defined as \[\left\{ \frac{p}{q} \mid p \in \mathbb{Z} \text{ and } q \in \mathbb{Z} \text{ and } q \neq 0 \right\} \text{~~~~or, equivalently,~~~~} \{ x \in \mathbb{R} \mid \exists p \in \mathbb{Z} \exists q \in \mathbb{Z}^+ ( p = x \cdot q) \}\]

Extra practice: Use the definition of set equality to prove that the definitions above give the same set.

\[\mathbb{Z}^{+} \subsetneq \mathbb{N} \subsetneq \mathbb{Z} \subsetneq \mathbb{Q} \subsetneq \mathbb{R}\]

Goal: The square root of $2$ is not a rational number. In other words: $\neg \exists x \in \mathbb{Q} ( x^2 - 2 = 0)$

Attempted proof: The definition of the set of rational numbers is the collection of fractions $p/q$ where $p$ is an integer and $q$ is a nonzero integer. Looking for a witness $p$ and $q$, we can write the square root of $2$ as the fraction $\sqrt{2 }/1$, where $1$ is a nonzero integer. Since the numerator is not in the domain, this witness is not allowed, and we have shown that the square root of $2$ is not a fraction of integers (with nonzero denominator). Thus, the square root of $2$ is not rational.

Lemma 1: For every two integers $a$ and $b$, not both zero, with $gcd(~(a,b)~) = 1$, it is not the case that both $a$ is even and $b$ is even.

Lemma 2: For every integer $x$, $x$ is even if and only if $x^2$ is even.

Proof: Towards a proof by contradiction, we will define a statement $r$ such that $\sqrt{2} \in \mathbb{Q} \to (r \land \lnot r)$.

Assume that $\sqrt{2} \in \mathbb{Q}$. Namely, there are positive integers $p, q$ such that \[\sqrt{2} = \frac{p}{q}\] Let $a= \frac{p}{gcd( ~(p,q)~)}$, $b = \frac{q}{gcd(~(p,q)~)}$, then \[\sqrt{2} = \frac{a}{b} \qquad \text{and} \qquad gcd(~(a,b)~) = 1\]

By Lemma 1, $a$ and $b$ are not both even. We define $r$ to be the statement “$a$ is even and $b$ is even”, and we have proved $\lnot r$.

By Lemma 2, this guarantees that $a$ is even too. So, by definition of even, there is some integer (call it $c$), such that $a = 2c$.

Plugging into the equation: \[2b^2 = a^2 = (2c)^2 = 4c^2\] and dividing both sides by $2$ \[b^2 = 2c^2\] and since $c^2$ is an integer, $b^2$ is even. By Lemma 2, $b$ is even too. Thus, $a$ is even and $b$ is even and we have proved $r$.

In other words, assuming that $\sqrt{2} \in \mathbb{Q}$ guarantees $r \land \lnot r$, which is impossible, so $\sqrt{2} \notin \mathbb{Q}$. QED

Review Quiz

Mathematical and strong induction for properties of numbers

In class, we proved the theorem that: Every positive integer is a sum of (one or more) distinct powers of $2$.

What’s wrong with the following attempted proof of this fact?

Attempted proof by mathematical induction, with $b=1$.

Basis step: WTS $1$ can be written as a sum of (one or more) distinct powers of $2$. Since $1 =2^0$, we are done.

Recursive step: Consider an arbitrary integer $n \geq 1$. By the IH, we can write $n$ as a sum of distinct powers of $2$. Since $1 = 2^0$, it is a power of $2$ and we can add it as a term to this sum of powers of $2$. When we do so, the terms sum to $n+1$ and we are done.
1. The basis step is not sufficient.
2. The induction hypothesis is not stated correctly.
3. It’s wrong to say that $1$ is a power of $2$.
4. Adding the $2^0$ to the sum of powers doesn’t give the correct value.
5. Adding the $2^0$ to the sum of powers is problematic for a different reason.
In this question, we’ll consider two possible proofs of the statement \[\forall n \in \mathbb{Z}^{\geq 8} \exists x \in \mathbb{N} \exists y \in \mathbb{N} ( 5x+3y = n)\]
1. First approach, using mathematical induction ($b=8$).
  
  Basis step: WTS property is true about $8$. Consider the witnesses $x = 1$, $y=1$. These are nonnegative integers and $5 \cdot 1 + 3 \cdot 1 = 8$, as required.
  
  Recursive step: Consider an arbitrary $n \geq 8$. Assume (as the induction hypothesis, IH) that there are nonnegative integers $x, y$ such that $n = 5x + 3y$. WTS that there are nonnegative integers $x', y'$ such that $n+1 = 5x' + 3y'$. We consider two cases, depending on whether any $5$ cent stamps are used for $n$.
  
  Case 1: Assume $x \geq 1$ (we assume that at least one $5$ cent stamp is used for $n$). Define $x' = x-1$ and $y'=y+2$ (both in $\mathbb{N}$ by case assumption).
  
  Calculating: \[\begin{aligned} 5x' + 3y' &\overset{\text{by def}}{=} 5(x-1) + 3(y+2) = 5x - 5 +3y + 6 \\ &\overset{\text{rearranging}} = (5x+3y) -5 + 6\\ & \overset{\text{IH}}{=} n-5+6 = n+1 \end{aligned}\]
  
  Case 2: Assume $x = 0$. Therefore $n = 3y$, so since $n \geq 8$, $y \geq 3$. Define $x' = 2$ and $y'=y-3$ (both in $\mathbb{N}$ by case assumption). Calculating: \[\begin{aligned} 5x' + 3y' &\overset{\text{by def}}{=} 5(2) + 3(y-3) = 10 +3y -9 \\ &\overset{\text{rearranging}} = 3y +10 -9 \\ &\overset{\text{IH and case}}{=} n+10-9 = n+1 \end{aligned}\]
  
  Since the goal has been proved from each case, the proof by cases is complete and we have proved the recursive step. $\square$
  Why was the recursive step split into two cases?
  1. Because there are two variables $x$ and $y$ that need witnesses.
  2. Because the statement has alternating quantifiers $\forall$ and $\exists$
  3. Because the witness values need to be nonnegative and subtraction may lead to negative values.
  4. Because the domain is all integers greater than or equal to $8$.
  5. Because there are two steps in the recursive definition of $\mathbb{N}$
2. Second approach, by strong induction ($b=8$ and $j=2$)
  
  Basis step: WTS property is true about $8, 9, 10$
  - Consider the witnesses $x = 1$, $y=1$. These are nonnegative integers and $5 \cdot 1 + 3 \cdot 1 = 8$, as required.
  - Consider the witnesses $x = 0$, $y=3$. These are nonnegative integers and $5 \cdot 0 + 3 \cdot 3 = 9$, as required.
  - Consider the witnesses $x = 2$, $y=0$. These are nonnegative integers and $5 \cdot 2 + 3 \cdot 0 = 10$, as required.
  Recursive step: Consider an arbitrary $n \geq 10$. Assume, as the strong induction hypothesis, that the property is true about each of $8, 9, 10, \ldots, n$. WTS that there are nonnegative integers $x', y'$ such that $n+1 = 5x' + 3y'$.
  
  Since Blank 1, by the strong induction hypothesis, there are nonnegative integers $x, y$ such that $(n+1) - 3 = 5x + 3y$. Choosing Blank 2 works because \[5x' + 3y' = 5x + 3y + 3 = (n+1) - 3 + 3 = n+1.\]
  
  Choose a true and useful statement to fill in Blank 1.
  1. $n \geq 10$ and hence $(n+1) - 3 \geq 8$
  2. $n \geq 8$ and hence $(n+1)-3 \geq 8$
  3. $n \geq 8$ and hence $(n+1) \geq 9$
  Choose the appropriate statement to fill in Blank 2.
  1. $x' = x, y' = y$
  2. $x' = x+1, y' = y+1$
  3. $x' = x+1, y' = y$
  4. $x' = x, y' = y+1$
  5. $x' = x-1, y' = y-1$
  6. $x' = x-1, y' = y$
  7. $x' = x, y' = y-1$

Winning strategy.

Recall the game Nim from class.

Why did we use strong induction to prove that Player 2’s strategy guarantees a win?
1. Because there are two players in the game.
2. Because each turn can involve a player taking some positive number of jellybeans from a pile, not just one jellybean.
3. Because the strategy player 2 uses depends on what player 1 does.
4. Because the set of natural numbers is recursively defined.
If we modify the game so that in each turn, a player could take jellybeans from one or both piles, which player has a winning strategy?
1. Player 1.
2. Player 2.
3. Neither in general, the existence of a winning strategy for the players depends on how many jellybeans are in each pile to start.
If we modify the game so that in each turn, a player must take exactly one jellybean, which player has a winning strategy?
1. Player 1.
2. Player 2.
3. Neither in general, the existence of a winning strategy for the players depends on how many jellybeans are in each pile to start.

Linked lists.

Recall the definition of linked lists from class.

Consider this (incomplete) definition:

Definition The function $\textit{increment} : \underline{\hspace{6em}}$ that adds 1 to the data in each node of a linked list is defined by: \[\begin{array}{llll} & & \textit{increment} : \underline{\hspace{3em}} & \to \underline{\hspace{3em}} \\ \textrm{Basis Step:} & & \textit{increment}([]) & = [] \\ \textrm{Recursive Step:} & \textrm{If } l \in L, n \in \mathbb{N} & \textit{increment}((n, l)) & = (1 + n, \textit{increment}(l)) \end{array}\]

Consider this (incomplete) definition:

Definition The function $\textit{sum} : L \to \mathbb{N}$ that adds together all the data in nodes of the list is defined by: \[\begin{array}{llll} & & \textit{sum} : L & \to \mathbb{N} \\ \textrm{Basis Step:} & & \textit{sum}([]) & = 0 \\ \textrm{Recursive Step:} & \textrm{If } l \in L, n \in \mathbb{N} & \textit{sum}((n, l)) & = \underline{\hspace{8em}} \end{array}\]

You will compute a sample function application and then fill in the blanks for the domain and codomain of each of these functions.

Based on the definition, what is the result of $\textit{increment}((4, (2, (7, []))))$? Write your answer directly with no spaces.
Which of the following describes the domain and codomain of increment?
2
1. The domain is $L$ and the codomain is $\mathbb{N}$
2. The domain is $L$ and the codomain is $\mathbb{N} \times L$
3. The domain is $L \times \mathbb{N}$ and the codomain is $L$
4. The domain is $L \times \mathbb{N}$ and the codomain is $\mathbb{N}$
5. The domain is $L$ and the codomain is $L$
6. None of the above
Assuming we would like $sum((5, (6, [])))$ to evaluate to $11$ and $sum((3, (1, (8, []))))$ to evaluate to $12$, which of the following could be used to fill in the definition of the recursive case of sum?
2
1. $\begin{cases} 1 + \textit{sum}(l) & \textrm{when } n \neq 0 \\ \textit{sum}(l) & \textrm{when } n = 0 \\ \end{cases}$
2. $1 + \textit{sum}(l)$
3. $n + \textit{increment}(l)$
4. $n + \textit{sum}(l)$
5. None of the above
Choose only and all of the following statements that are well-defined; that is, they correctly reflect the domains and codomains of the functions and quantifiers, and respect the notational conventions we use in this class. Note that a well-defined statement may be true or false.
2
1. $\forall l \in L \, (\textit{sum}(l))$
2. $\exists l \in L \, (\textit{sum}(l) \land \textit{length}(l))$
3. $\forall l \in L \, (\textit{sum}(\textit{increment}(l)) = 10)$
4. $\exists l \in L \, (\textit{sum}(\textit{increment}(l)) = 10)$
5. $\forall l \in L \, \forall n \in \mathbb{N} \, ((n \times l) \subseteq L)$
6. $\forall l_1 \in L \, \exists l_2 \in L \, (\textit{increment}(\textit{sum}(l_1)) = l_2)$
7. $\forall l \in L \, (\textit{length}(\textit{increment}(l)) = \textit{length}(l))$
Choose only and all of the statements in the previous part that are both well-defined and true.

Primes and divisors

Recall that a prime factorization is a product of primes (potentially with some of the primes occurring more than once). Select all and only the correct prime factorizations of positive integers.
1. $2\cdot 2 \cdot 2 \cdot 2$
2. $3$
3. $3 \cdot 4 \cdot 5$
4. $17 \cdot 21$
5. $2 \cdot 11$
We will prove that there is no greatest prime number

Proof Assume, towards a BLANK1, that there is a greatest prime number, call it $n_{BIG}$. In particular, this means that there are finitely many primes. Let’s label them in order $p_1, \ldots, p_n$ where $p_1 = 2$ and $p_n = n_{BIG}$. Choose $r =$ BLANK2. We proved in class that $r$ is true. It remains to show that (under our assumption) $r$ is false, because that would complete the contradiction argument. Define the integer \[C = (p_1 \cdots p_n) + 1\] This is a positive integer greater than $1$. However, we will show that it does not have any prime factors and thus is not a product of primes. By our assumption, the only prime numbers are $p_1, \ldots, p_n$. Thus, to show that $C$ does not have any prime factors means to show that $p_i$ is not a factor of $C$ for each value of $i$ from $1$ to $n$. Towards a universal generalization, let $i$ be an arbitrary between $1$ and $n$ (inclusive). We need to prove that $p_i$ is not a factor of $C$. By definition of $C$, \[C = p_i ( p_1 \cdots p_{i-1} p_{i+1} \cdots p_n) + 1\] so $C \textbf{ div } p_i = p_1 \cdots p_{i-1} p_{i+1} \cdots p_n$ and $C \textbf{ mod } p_i = 1$ (because $p_i > 1$ since it is prime). Since $C \textbf{ mod } p_i \neq 0$, $p_i$ is not a factor of $C$. Thus $C$ witnesses that the universal claim is false, and we have proved that $r$ is false.
1. BLANK1
  1. universal generalization
  2. proof of existential by witness
  3. direct proof
  4. proof by contrapositive
  5. proof by cases
  6. proof by contradiction
2. BLANK2
  1. The least prime number is $2$.
  2. There is a greatest prime number.
  3. There is a least prime number.
  4. Every positive integer greater than $1$ is a product of primes.
  5. Every positive integer has a base expansion.
  6. There is a greatest integer.
  7. There is no greatest integer.
We will consider two ways for calculating the gcd. In each part of the question, you’ll calculate $gcd(~(306, 120)~$).
1. The first approach uses some of the claims we proved in class to get the following algorithm:
  
  procedure $\textit{Euclidean}$($a$: a positive integer, $b$: a positive integer) $x$ := $a$ $y$ := $b$ while $y \neq 0$ $r$ := $x \textbf{ mod } y$ $x$ := $y$ $y$ := $r$ return $x$ $\{ \textrm{the result of } gcd(~(a,b)~)\}$
  
  Tracing this algorithm, lines 2 and 3 initialize the variables \[x:= 306 \qquad y:=120\] Entering the while loop, the variable $r$ is initialized to \[r:= 66\] because $306 = 2 \cdot 120 + 66$ so $306 \textbf{ mod } 120 = 66$. Calculate and fill in the updated value of $r$ in each subsequent iteration of the while loop, and then give the value of $gcd(~(306, 120)~$).
2. The second approach uses the representation of positive integers greater than $1$ as products of primes. To calculate $gcd(~(a,b)~)$ we find the prime factorizations of each of $a$ and $b$, and then calculate the number that results from multiplying together terms $p^c$ where $p$ is a prime that appears in both prime factorizations of $a$ and $b$ and $c$ is the minimum number of times $p$ appears in the two factorizations.
  
  Select the prime factorizations for $306$ and $120$ and express their $gcd$ as a product of powers of primes.
  
  Possible factorizations:
  1. $306 = 2 \cdot 153$, $120 = 2 \cdot 60$
  2. $306 = 1 \cdot 2 \cdot 3 \cdot 3 \cdot 17$, $120 = 1 \cdot 3 \cdot 5 \cdot 8$
  3. $306 = 2 \cdot 3 \cdot 3 \cdot 17$, $120 = 2 \cdot 2 \cdot 2 \cdot 3 \cdot 5$
  Possible $gcd$ choices:
  1. $2$
  2. $2 \cdot 3$
  3. $5 \cdot 17$
  4. $2^3 \cdot 3^2$
  5. $2^3 \cdot 3^2 \cdot 5 \cdot 8 \cdot 17$

Proof strategies

1. To Show \(length(~append(~([], 100)~)~) > length(~[]~)\)	Because \([]\) is the only element defined in the basis step of \(L\), we only need to prove that the property holds for \([]\).

2. To Show \(length(~(100,[])~) > length(~[]~)\)	By basis step in definition of \(append\).

3. To Show \((1 +length(~[]~)) > length(~[]~)\)	By recursive step in definition of \(length\).

4. To Show \(1+0 > 0\)	By basis step in definition of \(length\).

5. \(T\)	By properties of integers

QED	Because we got to \(T\) only by rewriting To Show to equivalent statements, using well-defined proof techniques, and applying definitions.

Week 7 at a glance

We will be learning and practicing to:

TODO:

Week 7 Monday: Mathematical and Strong Induction

Visualizing induction