Problem Sheet 1 21-128 Concepts

Due 11PM Wednesday 8th September 2021

Problem 1
(a) If n ∈ N and n2 + (n + 1)2 = (n + 2)2 , then n = 3.
Theorem: (n ∈ N) ∧ (n2 + (n + 2)2 ) =⇒ n = 3
Proof:

n2 + (n + 1)2 = (n + 2)2
=⇒ n2 + (n + 1)(n + 1) algebra
=⇒ n2 + n2 + n + n + 1 = n2 + 2n + 2n + 4 algebra
2 2
=⇒ 2n + 2n + 1 = n + 4n + 4 algebra
2 2
=⇒ 2n − n + 2n − 4n + 1 − 4 = 0 algebra
=⇒ n2 + (−2n) + (−3) = 0 algebra

Because N ⊂ C, n ⊂ C, which means that the quadratic formula provided by Clive can be used.

Theorem 1 (Quadratic Formula) Let a, b ∈ C. A complex number α is a root of the polyno-

mial x2 + ax + b if and only if
√ √
−b + b2 − 4ac −b − b2 − 4ac
α= or α =
2a 2a

p p
−(−2) + (−2)2 − 4(−1)(−3) −(−2) − (−2)2 − 4(−1)(−3)
=⇒ (n = ) ∨ (n = ) substition
2(1) 2(1)
√ √
2 + 16 2 − 16
=⇒ (n = ) ∨ (n = ) arithmetic
2 2
2+4 2−4
=⇒ (n = ) ∨ (n = ) evaluating
2 2
=⇒ (n = 3) ∨ (n = 1) evaluating

Checking n = 3 as a solution
Problem Sheet 1 21-128 Concepts

(n2 + (n + 1)2 = (n + 2)2 ) ∧ n = 3

=⇒ 32 + (3 + 1)2 = (3 + 2)2 substitution
2 2
=⇒ 9 + (4) = (5) arithmetic
=⇒ 9 + 16 = 25 definition of squaring
=⇒ 25 = 25 arithmetic
=⇒ n = 3 satisfies the equation
3∈N since it’s 3 units away from 0

(b) For all n ∈ N, it is false that (n − 1)3 + n3 = (n + 1)3 .

(see attatched photo)

Problem 2

(a) Show that (p =⇒ q) ∨ (p =⇒ r) and p =⇒ (q ∨ r) are logically equivalent.

p q r p =⇒ q p =⇒ r (p =⇒ q) ∨ (p =⇒ r) q ∨ r p =⇒ (q ∨ r)
T T T T T T T T
T T F T F T T T
T F T F T T T T
T F F F F F F F
F T T T T T T T
F T F T T T T T
F F T T T T T T
F F F T T T F T
The two truth tables for (p =⇒ q) ∨ (p =⇒ r) and p =⇒ (q ∨ r) are equivalent
=> [(p =⇒ q) ∨ (p =⇒ r)] ≡ [p =⇒ (q ∨ r)]


(b) Show that ∀xP (x) ∨ ∀xQ(x) and ∀x(P (x) ∨ Q(x)) are not logically equivalent.
[∀xP (x) ∨ ∀xQ(x)] 6≡ [∀x(P (x) ∨ Q(x))]
AFSOC [∀xP (x) ∨ ∀xQ(x)] ≡ [∀x(P (x) ∨ Q(x))]
Let Q(x) = ¬P (x)

=⇒ [∀xP (x) ∨ ∀x¬P (x)] ≡ [∀x(P (x) ∨ ¬P (x))] by substitution

=⇒ [∀xP (x) ∨ ∀x¬P (x)] ≡ > p ∨ ¬p is a tautology (Clive)
WTS L.H.S is not true for all x for contradiction

Assume P (x) evaluates to true if x (x ∈ N is even, false otherwise

Problem Sheet 1 21-128 Concepts

Lemma 4.b.1: ∀xP (x) is false

Lemma 4.b.2: ∀x¬P (x) is false
=⇒ ⊥ ≡ > (contradiction)
=⇒ [∀xP (x) ∨ ∀xQ(x)] 6≡ [∀x(P (x) ∨ Q(x))]

Theorem 2 Let a, b ∈ Z. We say b divides a if a = qb for some integer q. Other ways of saying
that b divides a are: b is a divisor of a, b is a factor of a, or a is a multiple of b.

We prove lemma 4.b.1 with the counterexample x=3, 3 is odd, since 3 = 2(1) + 1. The division
theorem shows that 3 is not evenly divisible by 2 and is thus odd. (Clive proves this in Proposition
1.1.42)
We prove lemma 4.b.2 with the counterexample x = 2, 2 is even, since 2 = (2)+0. We use the division
theorem again, since the remainder is zero then 2 divides 2 and is thus even.


Problem 3

Let p(x, y) be the predicate ‘x + y is even’, where x and y range over the integers.

(a) Prove that ∀x, ∃y, p(x, y) is true.

THM: ∀x, ∃y, p(x, y)
PF by Casework: Let x ∈ Z, fixed and generic
Case 1: x is even ⇐⇒ x = 2k k ∈ Z
Let y = 0, y ∈ Z
y = 0 =⇒ 2k + y = 2k + 0 = 2k
=⇒ x + y = 2k =⇒ x + y is even since 2k is trivially divisible by 2

Case 2: x is odd ⇐⇒ x = 2k + 1 k ∈ Z
Let y = 1, y ∈ Z
y = 1 =⇒ 2k + 1 + y = 2k + 1 + 1 = 2k + 2
=> x + y = 2(k + 1)
x + y is even since 2(k + 1) is divisible by 2
All possible cases for integers (being either even or odd) have been covered, and both cases can prove
the predicate.


(b) Prove that ∃y, ∀x, p(x, y) is false.

Prove Negation: ∀y, ∃x, ¬p(x, y) is true, that x + y is odd
PF by Casework: Let x ∈ Z, fixed and generic
Problem Sheet 1 21-128 Concepts

Case 1: x is even ⇐⇒ x = 2k k ∈ Z
Let y = 1, y ∈ Z
y = 0 =⇒ 2k + y = 2k + 1
=⇒ x + y = 2k + 1 =⇒ x + y is odd by the remainder theorem (the remainder is not 0 =⇒ 2k + 1
is odd)

Case 2: x is odd ⇐⇒ x = 2k + 1 k ∈ Z
Let y = 0, y ∈ Z
y = 0 =⇒ 2k + 1 + 0 = 2k + 1
=> x + y = 2k + 1
=⇒ x + y = 2k + 1 =⇒ x + y is odd by the remainder theorem (the remainder is not 0 =⇒ 2k + 1
is odd)
All possible cases for integers (being either even or odd) have been covered, and both cases can prove
the (negated) predicate. Since we proved the negation, the original statement is false.


Problem 4

(see attatched photos)

Problem 5

Determine all real numbers C such that there exist real numbers A and B with
[ A + B = 8 and (Ax + 2)(Bx + 7) = 15x2 + Cx + 14 for all positive integers x ].

C ∈ R satisfies [(A + B = 8 A, B ∈ R) ∧ (Ax + 2)(Bx + 7) = 15x2 + Cx + 14 ∀x ∈ Z+ ]

=⇒ ABx2 + 7Ax + 2Bx + 14 = 15x2 + Cx + 14 expanding terms

2 2
=⇒ ABx + 7Ax + 2Bx + 14 − 14 = 15x + Cx + 14 − 14 by algebra
2 2
=⇒ ABx + 7Ax + 2Bx = 15x + Cx by algebra
2 2 2
=⇒ ABx = 15x since there are no other x coefficients
ABx2 15x2
=⇒ = 2 algebra
x2 x
=⇒ AB = 15 algebra
Problem Sheet 1 21-128 Concepts

7Ax + 2Bx = Cx since there are no other x coefficients

=⇒ x(7A + 2B) = Cx algebra
x(7A + 2B) Cx
=⇒ = algebra
x x
=⇒ 7A + 2B = C algebra

This gives us three equations:

(1) AB = 15 (2) 7A + 2B = C (3) A + B = 8

A = (8 − B) by algebra
=⇒ (8 − B)B = 15 by substitution into eq 1
2
=⇒ 8B − B = 15 by distribution
=⇒ 8B − B 2 − 15 = 15 − 15 by algebra
2
=⇒ 8B − B − 15 = 0 by algebra
=⇒ (−B + 3)(B − 5) = 0 by factoring
=⇒ (B = 3) ∨ (B = 5) to satisfy previous equation equalling 0

B = 3 =⇒ A(3) = 15 by sub. into eq 1

15
=⇒ A = by algebra
3
=⇒ A = 5 evaluating

B = 5 =⇒ A(5) = 15 by sub. into eq 1

15
=⇒ A = by algebra
5
=⇒ A = 3 evaluating

=⇒ (A, B) = (3, 5) ∨ (A, B) = (5, 3)

C = 7A + 2B eq 2
=⇒ (C = 7(3) + 2(5) = 31) ∨ (C = 7(5) + 2(3) = 41 substituting A,B values in

The set of of all real numbers C s.t ∃A, B ∈ R with

[ A + B = 8 and (Ax + 2)(Bx + 7) = 15x2 + Cx + 14 for all positive integers x ] is {31, 41}
Problem Sheet 1 21-128 Concepts

Problem 6

Let n and b > 1 be positive integers. Determine, with proof, the number of digits of the base b represen-
tation of n in terms of b and n.

Definition 1 Let b > 1. The base-b expansion of a natural number n is the string dr dr−1 . . . d0
such that

• n = dr · br + dr−1 · br−1 + · · · + d0 · b0 ;

• 0 ≤ di < b for each i; and

• If n > 0 then dr 6= 0—the base-b expansion of zero is 0 in all bases b.

By the definition, the digits of n are bounded by the powers of the base. For example, 123(10) is bounded
103 ≤ 123(10) < 104 .

Let r ∈ N be the number of digits of the base b representation of n

=⇒ br−1 ≤ n < br
=⇒ logb (br−1 ) ≤ logb (n) < logb (br ) by algebra
=⇒ r − 1 ≤ logb (n) < r by log definition
=⇒ r is logb (n) + 1 or r is between logb (n) + 1 and logb (n) + 2
=⇒ r = floor(logb (n)) + 1
Problem Sheet 1 21-128 Concepts

Problem 7

(a) WTS (∀a ∈ R \ Q) ∧ (∀r ∈ R) a + r ∈ R \ Q

Let a ∈ R \ Q, fixed and generic

w
Let r ∈ Q, fixed and generic =⇒ r = w, z ∈ Z by definition of rationals
z
x
AFSOC a + r ∈ Q =⇒ a + r = x, y ∈ Z by definition of rationals
y
w x
=⇒ a + = by substitiion
z y
w w x w
=⇒ a + − = − by algebra
z z y z
x w
=⇒ a = − by algebra
y z
x z w y z y
=⇒ a = ∗ − ∗ since = = 1
y z z y z y
xz wy
=⇒ a = − by algebra
yz zy
xz − wy
=⇒ a = combining fractions with same denominator
yz

xz, wy, yz are all integers by closure of integers under multiplication and addition
=⇒ a is rational, since it can be represented as a ratio of integers
Contradiction! a is rational contradicts a is irrational from our assumption.
=⇒ (∀a ∈ R \ Q) ∧ (∀r ∈ R) a + r ∈ R \ Q 

(b) WTS (∀a, b ∈ Q) a + b ∈ R \ Q is false

√
Assume a ∈ R \ Q = 2
√ √
Assume b = − 2 ∈ R \ Q by lemma 7.a.1, − 2 ∈ R \ Q
√ √
=⇒ a + b = 2 + (− 2) = 0 since a quantity and its opposite is equal distance from zero

0 = 01 0, 1 ∈ Z =⇒ 0 ∈ Q
This counterexample thus disproves (∀a, b ∈ Q) a + b ∈ R \ Q
Problem Sheet 1 21-128 Concepts

Lemma 7.a.1 :
√
AFSOC − 2 is rational
√ a
=⇒ − 2 = a, b ∈ Z by definition of rationals
b
√ a −a
=⇒ − 2(−1) = (−1) = algebra
b b
√ −a
=⇒ 2 = algebra
b

√
Contradiction! 2 is irrational (we assume this from Clive), and so it can’t be represented as a ratio
of two √
integers.
=⇒ − 2 ∈ R \ Q

(c) WTS (∀r ∈ Q) ∧ (∀a, b ∈ R \ Q) ar ∈ R \ Q is false

Counterexample:
Assume a ∈ R \ Q, assume r = 0 ∈ Q
0 ∈ Q since it can be represented as 01 , 0, 1 ∈ Z and 1 > 0
0 ∗ a = 0 by definition of zero, 0 ∈ Q =⇒ ar can be rational 

(d) WTS (∀a, b ∈ R \ Q) ab ∈ R \ Q is false

Counterexample:
Let a, b ∈ R \ Q √ √
Assume√ a =√b = 2 ( 2 is irrational from Clive)
ab = √
( √ 2)( 2) (by substitution)
=⇒ 2 2 = 2 = 12 2, 1 ∈ Z =⇒ 2 ∈ Q =⇒ ab can be rational 

(e) WTS (∀r ∈ Q) ∧ (∀a ∈ R \ Q) ar ∈ R \ Q is false

Counterexample:
√
Assume√ a = 2 ∈ R \ Q, assume r = 2 ∈ Q
ar = ( 2)2 = 2 by definition of square root/squaring
2 ∈ Q =⇒ ar can be rational 

(f) WTS (∀r ∈ Q) ∧ (∀a ∈ R \ Q) ra ∈ R \ Q is false

Counterexample:
√
Assume a = 2 ∈ R \ Q, assume r = 1 = 11 ∈ Q, 1 ∈ Z
√
ra = (1)( 2) by substitution
1 is the multiplicative identity, x ∗ 1 = x∀x ∈ X
exponentiation is repeated multiplication by definition
1 times itself
√ repeated however many times will always be 1 by multiplicative identity
therefore 1 2 = 1
1 ∈ Q =⇒ ra can be rational 

(g) WTS ∀a, b ∈ R \ Q ab ∈ R \ Q is false

Counterexample:
Problem Sheet 1 21-128 Concepts

√
√ 2
Assume A = 2 √
If A is irrational, then ab could be irrational if a = b √
= 2
√ √ √ 2 √ √ √2 √2 √ 2
If A is rational, then A 2 is rational since A 2 = ( 2 ) 2 = 2 ) = 2 = 2 by exponentiation
rules
2 is rational since 2 = 12 1, 2 ∈ Z and 1 > 0
2 ∈ Q =⇒ ab can be rational