4.6: Section 6-Exercises
( \newcommand{\kernel}{\mathrm{null}\,}\)
Use the method of direct proof to prove the following statements.
Exercise 4.6.1
If x is an even integer, then x2 is even.
Exercise 4.6.2
If x is an odd integer, then x3 is odd.
Exercise 4.6.3
If a is an odd integer, then a2+3a+5 is odd.
Exercise 4.6.4
Suppose x,y∈Z. If x and y are odd, then xy is odd.
Exercise 4.6.5
Suppose x,y∈Z. If x is even, then xy is even.
Exercise 4.6.6
Suppose a,b,c∈Z. If a|b and a|c, then a|(b+c).
Exercise 4.6.7
Suppose a,b∈Z. If a|b, then a2|b2.
Exercise 4.6.8
Suppose a is an integer. If 5|2a, then 5|a.
Exercise 4.6.9
Suppose a is an integer. If 7|4a, then 7|a.
Exercise 4.6.10
Suppose a and b are integers. If a|b, then a|(3b3−b2+5b).
Exercise 4.6.11
Suppose a,b,c,d∈Z. If a|b and c|d, then ac|bd.
Exercise 4.6.12
If x∈R and 0<x<4, then 4x(4−x)≥1.
Exercise 4.6.13
Suppose x,y∈R. If x2+5y=y2+5x, then x=y or x+y=5.
Exercise 4.6.14
If n∈Z, then 5n2+3n+7 is odd. (Trycases.)
Exercise 4.6.15
If n∈Z, then n2+3n+4 is even. (Trycases.)
Exercise 4.6.16
If two integers have the same parity, then their sum is even. (Try cases.)
Exercise 4.6.17
If two integers have opposite parity, then their product is even.
Exercise 4.6.18
Suppose x and y are positive real numbers. If x<y, then x2<y2.
Exercise 4.6.19
Suppose a, b and c are integers. If a2|b and b3|c, then a6|c.
Exercise 4.6.20
If a is an integer and a2|a, then a∈{−1,0,1}.
Exercise 4.6.21
If p is prime and k is an integer for which 0<k<p, then p divides (pk).
Exercise 4.6.22
If n∈N, then n2=2(n2)+(n1). (You may need a separate case for n=1.)
Exercise 4.6.23
If n∈N, then (2nn) is even.
Exercise 4.6.24
If n∈N and n≥2, then the numbers n!+2,n!+3,n!+4,n!+5,⋯,n!+n are all composite. (Thus for any n≥2, one can find n−1 consecutive composite numbers. This means there are arbitrarily large “gaps” between prime numbers.)
Exercise 4.6.25
If a,b,c∈N and c≤b≤a, then (ab)(ac)=(ab−c)(a−b+cc).
Exercise 4.6.26
Every odd integer is a difference of two squares. (Example 7=42−32, etc.)
Exercise 4.6.27
Suppose a,b∈N. If gcd(a,b)>1, then b|a or b is not prime.
Exercise 4.6.28
Let a,b,c∈Z. Suppose a and b are not both zero, and c≠0. Prove that c⋅gcd(a,b)≤gcd(ca,cb).