Introduction to Proofs, an Inquiry-Based approach

Categories:

Recommended

Chapter 1 – Numbers

We begin with results about the integers Z= { . . . −2,−1,0,1,2, . . . }. In this chapter, “number” means integer. Some statements refer to the natural numbers N= {0,1,2, . . . } or the positive integers Z+ = {1,2, . . . }.

Divisibility

1.1 Definition. For two integers ,we say that d divides n if there is an integer such that ·n. Here, is the divisoris the dividend, and is the quotient. (Alternative wordings are: d is a factor of nd goes evenly into nn is divisible by d , or n is a multiple of d .) We write d ∣∣ if is a divisor of n, or d ∣∣- if it is not.

1.2 Definition. A number is even if it is divisible by 2, otherwise it is odd. (We may instead say that the parity is even or odd.)
The notation ∣∣ signifies a relationship between two integers. It is different than the fraction d/n, which is a rational number: we can sensibly ask “Does 2 divide 5?” but “Does 2/5?” is not sensible.

1.3 Exercise. (Interaction with sigh) Each of these is a statement about integers. Prove each.
A. If a number is even then its negative is even. If a number is odd then its negative is odd.
B. If d ∣∣ then both −∣∣ and ∣∣−a. In addition, divides |a| (recall that the absolute value of a number, |a|, is if ≥ 0 and is −if < 0).

1.4 Exercise. (Interaction of party and addition) Prove or disprove. That is, for each decide if it is true or false and if it is true then prove it, while if it is false then give a counterexample.
A. The sum of two evens is even. The difference of two evens is even.
B. The sum of two odds is odd. The difference of two odds is odd.
C. For a,∈Z, the number +is even if and only if is even.

1.5 Exercise. Generalize the first item of the prior exercise to be a statement about sums of multiples of ∈Z, and then prove your statement.

1.6 Exercise. (Interaction of party and multiplication) Prove or disprove. (i) The product of two evens is even. (ii) The quotient of two evens, if it is an integer, is even.

1.7 Exercise. For the prior exercise’s first item, formulate and prove a generalization that applies to any integer.

1.8 Exercise. (Divisibility properties) Prove each. Assume that all the numbers are integers.
A. (Reflexivity) Every number divides itself.
B. Every number divides 0 while the only number that 0 divides is itself.
C. (Transitivity) If d ∣∣ and ∣∣ then d ∣∣ m. That is, if divides then so do n’s divisors.
D. (Cancellation) Where ,∈Z, if there is a nonzero integer such that ad ∣∣ an then ∣∣ n. And, if ∣∣ then ad ∣∣ an for all ∈Z.
E. (Comparison) For ,∈Z+, if is a multiple of then ≥ .
F. Every number is divisible by 1 and −1. The only numbers that divide 1 are 1 and −1.
G. The largest divisor of any nonzero ∈Z is |a|.
H. Every nonzero integer has only finitely many divisors.

1.9 Exercise. What conclusion can you make if both ∣∣ and b ∣∣ a?

1.10 Exercise. Suppose that a,b,∈Z.
A. Prove that if ∣∣ then a ∣∣ bc for all integers c.
B. Prove that if a ∣∣ and ∣∣ then divides the sum and difference − c.
C. (Linearity) This generalizes the prior item: if ∣∣ and a ∣∣ then divides ·b+·for any m,∈Z.

Category:

Attribution

Jim Hefferon (2021), Introduction to Proofs, an Inquiry-Based approach, URL: https://christophm.github.io/interpretable-ml-book/

This work is licensed under Attribution-ShareAlike 2.5 Generic License:  (https://creativecommons.org/licenses/by-sa/2.5/).

VP Flipbook Maker

Display your work as awesome digital flipbook and share it with others! Visual Paradigm Online is a professional tool for you to create flipbook. You can also convert your work in other formats to digital flipbook. Try it now!