Assignment 2

Abhinav Pradeep
Tutorial group 12
September 7, 2023

1 Question 1.
y
Suppose x is a non-zero rational number and y is irrational. Prove that x
is irrational.

Formal statement:
y 
∀x, y ∈ R, (x ∈ Q \ {0} ∧ y ∈ R \ Q) → ∈R\Q
x
Proof:

Proof by contradiction. Suppose that xy is rational and can be written as pq , (p ∈ Z, p ∈ Z \ {0}).

Given that x is non-zero rational ⇒ x = m
n
, (m, n ∈ Z \ {0}) and y ∈ R \ Q.

Consider
y
x
y
By the supposition that x
is rational:
y p
=
x q
p
y= ·x
q
As x is rational:
m
x=
n
p m
y= ·
q n
pm
y=
qn
By the closure of multiplication under the integers, pm, qn ∈ Z \ {0}. Hence y is rational.

The initial supposition that xy is rational yields a contradiction in that y, which is irrational, can be
written as pm
qn
, which would make it rational. By this contradiction, xy must be irrational. Hence, if x
is a non-zero rational number and y is irrational, then xy is irrational.

1
2 Question 2.
Prove that for every positive integer n, there exists n consecutive positive integers which are not perfect
cube. (A perfect cube is an integer of the form k 3 . So perfect cubes are 1, 8, 27, 64 and so on.)

Consider sn , n ∈ Z+ the sequence of consecutive perfect cubes:

s n = n3
Consider dn , n ∈ Z+ defined such that:

dn = sn+1 − sn
dn is the number of integers between two consecutive perfect cubes (n)3 and (n + 1)3 .

Using the above, the statement to prove can be formally written as:

∀n ∈ Z+ , ∃o ∈ Z+ , such that do > n

Proof:

Direct proof. Specifically show that o = n. That is ∀n ∈ Z+ :

dn > n
That is:

sn+1 − sn > n
Which is:

(n + 1)3 − n3 > n
Consider,

(n + 1)3 − n3
By applying the binomial theorem to expand (n + 1)3 ,

(n + 1)3 − n3 = n3 + 3n2 + 3n + 1 − n3

(n + 1)3 − n3 = 3n2 + 3n + 1
As n ∈ Z+

3n2 > n

3n > n
By the above inequalities, it is clear that

3n2 + 3n + 1 > n
That is,

(n + 1)3 − n3 > n
And by definition,

dn > n
This proves that the number of integers between two consecutive perfect cubes n3 and (n + 1)3 is
greater than n. Hence for every positive integer n, there exists n consecutive positive integers which
are not perfect cube.

3 Question 3.
Suppose x and y are irrational. Prove or disprove the following statement:
“Either x + y or xy is irrational.”

Formal statement:

∀x, y ∈ R, (x ∈ R \ Q ∧ y ∈ R \ Q) → ((x + y ∈ R \ Q) ∨ (xy ∈ R \ Q))

Proof:
√ √
Statement disproven by counter example. Consider x = − 2, y = 2. Both x, y ∈ R \ Q.

Consider x + y
√ √
x+y ⇒− 2+ 2=0
Hence x + y ∈ Q

Consider xy
√ √
xy ⇒ − 2 · 2 = −2
Hence xy ∈ Q

Therefore the statement “Either x + y or xy is irrational” has been shown false by counter example.

4 Question 4.
Prove that for all positive integers a, b, c, if a | b and c ∤ b, then c ∤ a.

Formal statement:

∀a, b, c ∈ Z+ , (a | b ∧ c ∤ b) → (c ∤ a)
Proof:
Proof by contradiction.

a | b ⇒ ∃k ∈ Z such that b = ak −→ (1)

c ∤ b ⇏ ∃l ∈ Z such that b = cl −→ (2)

c ∤ a ⇏ ∃m ∈ Z such that a = cm −→ (3)

Suppose c | a. Therefore,

c | a ⇒ ∃m ∈ Z such that a = cm
Consider

a = cm
Multiply both sides with k from (1)

ak = cmk
mk ∈ Z as both m ∈ Z and k ∈ Z and multiplication is closed under the integers. From (1)

b = ak
Hence,

b = cmk
The above statement implies that c | b as ∃mk ∈ Z such that b = c · mk. However, c ∤ b. By this
contradiction, it is clear that the supposition of c | a is false. Hence c ∤ a. Therefore, the statement
has been proven by contradiction.

5 Question 5.
Prove that there exists a positive integer N such that for all n ≥ N , we have 2023n ≤ n!. You may
use, without proof, the fact that 20236000 ≤ 6000!.

Formal statement:

∃N ∈ Z+ such that ∀n ∈ Z+ (n ≥ N ) → (2023n ≤ n!)

Proof:
Proof by induction. Given that

20236000 ≤ 6000!
To prove:

n ∈ Z, ∀n ≥ 6000, 2023n ≤ n!
Which is equivalent to saying ∀i ∈ Z+
0:
 20236000+i ≤ (6000 + i)!
Given that statement is true when i = 0

Show true for when i = 1, that is prove:

20236000+1 ≤ (6000 + 1)!

L.H.S R.H.S
20236001 (6001)!
20236000 · 2023 6001 · (6000)!
As

20236000 ≤ (6000)!
And

2023 ≤ 6001

20236000 · 2023 ≤ (6000)! · 6001

20236000+1 ≤ (6000 + 1)!

Assume true for i = k, that is:

20236000+k ≤ (6000 + k)!

Show true for i = k + 1, that is prove:

20236000+(k+1) ≤ (6000 + (k + 1))!

L.H.S R.H.S
20236000+(k+1) (6000 + (k + 1))!
20236000+k · 2023 (6000 + (k + 1)) · (6000 + k)!
As

20236000+k ≤ (6000 + k)!

And as k ∈ Z+
0

2023 ≤ (6000 + (k + 1))

20236000+k · 2023 ≤ (6000 + k)! · (6000 + (k + 1))

20236000+(k+1) ≤ (6000 + (k + 1))!

Hence it has been proven by induction that:

n ∈ Z, ∀n ≥ 6000, 2023n ≤ n!
Therefore, there exists a positive integer N such that for all n ≥ N , we have 2023n ≤ n!. Specifically,
it has been shown that N = 6000.
6 Question 6.
Suppose a sequence an , is defined as follows:

a1 = 9/10, a2 = 10/11, an+2 = an+1 an .

Show that 0 < an < 1 for all (positive integers) n.

Consider proper fractions A ∈ Q and B ∈ Q. That is 0 < A < 1 and 0 < B < 1.

Consider P = AB. P ∈ Q as multiplication is closed under rationals.

P P
By definition A
= B. As B < 1, A
< 1. Hence P < A.

P P
By definition B
= A. As A < 1, B
< 1. Hence P < B.

Therefore P < A and P < B, that is: the product of proper fractions is smaller than either of them.

Moreover, as A > 0 and B > 0, AB > 0 ⇒ P > 0.

Hence: 0 < P < max(A, B) < 1 ⇒ 0 < P < 1. Moreover, P ∈ Q. Hence P is also a proper fraction.
Therefore it has been established that the product of proper fractions is a proper fraction.

Formal statement:

∀n ∈ Z+ , 0 < an < 1
The formal statement can be rewritten as:

∀n ∈ Z+ , (an ∈ Q) ∧ (0 < an < 1)

The second statement implies the first as logical and only yields true when both conditions are true.

Proof:

Proof done by induction.

0 < a1 < 1 and 0 < a2 < 1 as

9
0< <1
10
10
0< <1
11
Consider n = 3
10 9
a3 = ·
11 10
90
a3 =
110
Hence a3 ∈ Q as it is expressed in the form pq , (p ∈ Z, p ∈ Z \ {0}). Moreover, as the numerator is
smaller than the denominator,

0 < a3 < 1
Consider n = 4
90 10
a4 = ·
110 11
900
a4 =
1210
p
Hence a3 ∈ Q as it is expressed in the form q , (p ∈ Z, p ∈ Z \ {0}). Moreover, as the numerator is
smaller than the denominator,,

0 < a4 < 1
Assume true for 1 ≤ n ≤ k.
To complete proof by strong induction, consider n = k + 1

ak+1 = ak · ak−1
As ak ∈ Q, ak−1 ∈ Q and

0 < ak < 1

0 < ak−1 < 1

ak and ak+1 are proper fractions. As the product of proper fractions was established to be a proper
fraction, ak+1 ∈ Q and

0 < ak+1 < 1

Hence, the statement

∀n ∈ Z+ , (an ∈ Q) ∧ (0 < an < 1)

Has been proven. Therefore it has been shown that:

∀n ∈ Z+ , 0 < an < 1