Professional Documents
Culture Documents
Basically, the study of mathematics is divided into two major categories: Pure
mathematics or Applied mathematics.
We like to cover the inside of our houses with nicely patterned wallpaper or
paint-work, and the outside with nicely patterned brickwork or other finishes;
we like the complex patterns of music (whether that music is the latest
popular music or something classical);
The fascination that mathematicians have for their research is thus arguably
a mere extension of the fascination that all people have with pattern.
When our brains process and make sense out of the complicated array of
words and symbols on a page of Mathematics, we begin to understand the
patterns and appreciate their beauty.
By understanding the abstract principles, they are well prepared not just for
putting numbers to use in their everyday activities, but also when they need
to count something new.
There are overlaps in research in mathematics. but for our purposes, we will
subdivide the fields of study by their primary purposes as follows.
Example
√
1 Show that 2 is irrational
2 There are infinitely many prime numbers.
Proof.
Suppose that p1 = 2 < p2 = 3 < . . . < pr are all of the primes. Let
P = p1 p2 . . . pr + 1 and let p be a prime dividing P; then p can not be any
of p1 , p2 , . . . , pr , otherwise p would divide the difference
P − p1 p2 . . . pr = 1, which is impossible. So this prime p is still another
prime, and p1 , p2 , . . . , pr would not be all of the primes
Theorem
There is only one solution to the equation of the form ax + b = 0, where a
and b are real numbers and a 6= 0.
Proof.
Assume x1 and x2 are both solutions to the equation ax + b = 0. Then we
want to show that x1 = x2 .
Proof by cases.
Break the theorem into some cases
1. n = 0
2. n ≥ 1
3. n ≤ −1
Theorem
Every integer that is a perfect cube is either a multiple of 9, or 1 more, or 1 less
than a multiple of 9.
Proof.
Each cube number is the cube of some integer n. Every integer can be described
as either a multiple of 3 or is one less or two less than a multiple of 3 since the
maximum remainder in division by 3 is 2. So by dividing the set of integers can
be divided into three non-overlapping cases which are exhaustive.
Case 3: If n = 3p − 2, then
n3 = 27p 3 − 54p 3 + 36p − 8 = 27p 3 − 54p 3 + 36p − 9 + 1, which
is 1 more than a multiple
Researches in of 9.
Mathematics September 20, 2020 28 / 36
6. Proof by Contrapositive
Theorem
If x and y are two integers for which x+y is even, then x and y have the
same parity.
Proof. The contrapositive version of this theorem is ”If x and y are two
integers with opposite parity, then their sum must be odd.” So we assume
x and y have opposite parity. Since one of these integers is even and the
other odd, there is no loss of generality to suppose x is even and y is odd.
Thus, there are integers k and m for which x = 2k and y = 2m+1. Now
then, we compute the sum x+y = 2k + 2m + 1 = 2(k+m) + 1, which is
an odd integer by definition.
Theorem
If n is a positive integer such that nmod(4) is 2 or 3, then n is not a
perfect square.
Proof.
We will prove the contrapositive version: ”If n is a perfect square then
nmod(4) must be 0 or 1.” Suppose n = k 2 . There are four cases to
consider.
1. If kmod(4) = 0, then k = 4q, for some integer q. Then,
n = k 2 = 16q 2 = 4(4q 2 ), i.e. nmod(4) = 0.
2. If kmod(4) = 1, then k = 4q + 1, for some integer q. Then,
n = k 2 = 16q 2 + 8q + 1 = 4(4q2 + 2q) + 1, i.e. nmod(4) = 1.
Proof.
3. If kmod(4) = 2, then k = 4q + 2, for some integer q. Then,
n = k 2 = 16q 2 + 16q + 4 = 4(4q 2 + 4q + 1), i.e. nmod(4) = 0.
4. If kmod(4) = 3, then k = 4q + 3, for some integer q. Then,
n = k 2 = 16q 2 + 24q + 9 = 4(4q 2 + 6q + 2) + 1, i.e. nmod(4) = 1.
Proof.
Find an example: 5 = 22 + 12 .
Researches in Mathematics September 20, 2020 35 / 36
Existence Proofs... Example
Theorem
There exist irrational numbers x and y such that x y is rational.
Proof.
√
Consider 2, which is irrational.
√ √2
Case 1: If 2 is rational, then the theorem is proved
√ √2 √ √2 √2 √
Case 2: If 2 is irrational, then ( 2 ) = ( 2)2 = 2 which is
rational. Thus, theorem is proved.