Chapter 2: Direct Proofs Flashcards

1
Q

Definition of an even integer?

A

An integer n is even if n=2k for some integer k;

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Definition of an odd integer?

A

An integer n is odd if n=2k + 1 for some integer k;

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Proof:

Proposition that the sum of two even integers is even?

A
  • Let two random int. (m and n) be even so that m=2a and n= 2b where a,b are integers
  • Then,
    * n + m = 2a + 2b = 2 (a + b)
  • Given that the sum of two integers are also integers this meets the definition of an even number. ( n = 2k where k is any integer).
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Prove this Proposition:

The sum of two odd integers is even?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Prove the Proposition that:

If n is an odd integer, then N^2 is an odd integer?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the symbol in mathematics for “implies”?

A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the Structure of a Direct Proof?

A
  • Proposition. P ⟹ Q
  • Proof Assume P
    * “An Explanation of what P means
    * apply algebra, logic, techniques
    * Get to the definition of Q
  • Therefore Q
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is Proof by Cases?

A
  • Breaks up proofs into smaller proofs
  • E.g. in an example with all integers you may need to break this down into a case for even numbers and one for odd.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Prove the Proposition:

If n is an integer, then n^2 + n + 6 is even?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the definition of divisibility?

A

A nonzero integer a is said to divide an integer b if b = ak for some integer k.

When a does divide b, we write “ a|b” and when a does not divid b we write “a∤b”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Prove this Proposition:

Let a, b and c be integers. If a|b and b|c, then a|c?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the Division Algorithm Theorem?

A

For all integers a and m with m > 0 there exist unique integers q and r such that:

a = mq + r

where 0 <= r < m

EXAMPLESSSSS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the Definition of the Greatest Common Divisor?

A

Let a and b integer. If c|a and c| b, then c is said to be a common divisor of a and b

The greatest common divisor of a and b is the largest integer d such that d|a and d|b. This number is denoted gcd(a,b)

EXAMPLESSSSS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the Bézout Identity?

A

If a and b are positive integers, then there exist integers k and l such that:

gcd(a,b) = ak + bl

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is the Proof for the greatest common divisor?

A

GENERAL LOGIC –> ref proof

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the definition of Modular Congruence?

A

For integers a, r and m we say that a is congruent to r modulo m and we write a ≡ r (mod m), if m | (a-r)

*** EXAMPLES

17
Q

What are the two metaphors for Modular Congruence?

A
  1. Boxes
  2. Clocks
18
Q

What are the Properities of Modular Arithmetic?

A

Assume that a,b,c,d and m are integers, a ≡ b (mod m) and c ≡ d (mod m). Then,

i) a + c ≡ b+d (mod m)
i) a - c ≡ b-d (mod m)
i) a * c ≡ b*d (mod m)

19
Q

Prove this Proposition:

Assume that a,b,c,d and m are integers and a ≡ b (mod m) and c ≡ d (mod m), Then:

a + c ≡ b + d (mod m)

A
20
Q

What is the definition of a prime and composite number?

A

An integer p >= 2 is prime if its only positive divisors are 1 and p.

An integer n >= 2 is composite if it is not prime, Equivalently, n is composite if it can be written as n =st where s and t are integers and 1 < s,t < n

21
Q

What is the Lemma Required for the Proof of the Modular Cancellation Law?

A
22
Q

What is the Proof for the Prime Number Lemma?

A
23
Q

What is the Modular Cancellation Law?

A

Let a,b,k and m be integers with k ≠ 0. If ak ≡ bk (mod m) and gcd(k,m) = 1, then a ≡ b(mod m).

24
Q

What is the Proof for the Modular Cancellation Law?

A
25
Q

What is Fermat’s Little Theorem?

A

If a is an integer and p is prime which does not divide a, then

ap-1≡1(mod p).

26
Q

What is the proof for the following Proposition:

Assume that x and y are positive numbers. If x >= y, then sqrt(x) >= sqrt(y).

A
27
Q

What is the AM-GM inequality?

A

If x and y are positive real numbers, then sqrt(xy) <= (x+y)/2

28
Q

What is the Proof for the AM-GM Inequality Theorem?

A