GIFTY OKYERE ANTI (MRS)

FOUNDATIONS OF COMPUTER SCIENCE

NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
 NOTES
FOUNDATIONS OF COMPUTER SCIENCE
GIFTY OKYERE ANTI (MRS)
Singleton of empty set equals
singleton of zero

Thus, nothing belongs to the set of Von Neumann natural numbers unless it can
be constructed using the preceding rules
 i.e. Zero is a natural number

NOTES
FOUNDATIONS OF COMPUTER SCIENCE
GIFTY OKYERE ANTI (MRS)
in the natural numbers.

i.e. any natural numbers.

i.e. If the successor of two natural numbers is the same, then the two original
numbers are the same.

If a set contains zero and the successor of every number is in the set, then the
set contains the natural numbers
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
 i.e. if…then …statement

NOTES
FOUNDATIONS OF COMPUTER SCIENCE
GIFTY OKYERE ANTI (MRS)
Thus, if x is a positive integer,…..1,2,3,… then there exist a positive
integer n (or a natural number n), such that nx > = y
 NOTES
FOUNDATIONS OF COMPUTER SCIENCE
GIFTY OKYERE ANTI (MRS)
Thus, between any two real numbers, there exist a rational number.

TRANSITIVE PROPERTY OF EQUALITY ON Q

 If a = b and c = b then a = c
 NOTES
FOUNDATIONS OF COMPUTER SCIENCE
GIFTY OKYERE ANTI (MRS)
3. Rational x Irrational = Irrational
4. Irrational x Irrational OR Irrational + Irrational = Irrational
 SOME PROOFS ON IRRATIONAL NUMBERS
Prove that is an irrational number.
Thus, is not equal to a , where b 0
b
(use proof by contradiction)
Let be rational, thus, = a ; a & b have no common factors
b
2 = (a/b)2 = a2 / b2

NOTES
FOUNDATIONS OF COMPUTER SCIENCE
GIFTY OKYERE ANTI (MRS)
2b2 = a2 (Here any of the theorems/ explanations below could be used)
1) divisibility theorem on prime numbers ……if p prime, divides a2 (p|a2 ), then p also divides a
(p|a). Hence, 2|a2 2|a since 2 is prime.
Thus, a can be 2k , where k > 0. Now substitute a=2k in the above equation.
2) Prime factorization theorem (extension) ……every square number has an even number of
prime factors. Since every integer can be expressed as a product of primes (prime factorization
theorem). Hence, for 2b2 = a2 , a2 must have even number of primes factors. From the equation, 2 is
one of the primes hence the number of prime factors left must be odd so that when we add the 2 as one
prime factor, the total will be even. However, b 2 , a square number also has even prime factors hence
2b2 gives an add number of prime factors. Hence there’s a contradiction.
3) If p is a multiple of a2 then it is also a multiple of a.
ASSIGNMENT 2

NOTES
FOUNDATIONS OF COMPUTER SCIENCE
GIFTY OKYERE ANTI (MRS)
 Prove the Archimedean, Dense and transitive properties
on rational numbers.

 Prove that ,3 , 2+ and + are

irrational numbers.
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
GIFTY OKYERE ANTI (MRS)
FOUNDATIONS OF COMPUTER SCIENCE
NOTES
FOR FURTHER READING

D. S. Malik, M. K. Sen
Discrete Mathematical Structures: Theory &
Applications.
Melvyn B. Nathanson

NOTES
FOUNDATIONS OF COMPUTER SCIENCE
GIFTY OKYERE ANTI (MRS)
Elementary Methods in Number Theory.
Springer
James J. Tattersall
Elementary Number Theory in Nine
Chapters.
Jan Mikusinsinski, Piotr Mikusinsinski
An Introduction to Analysis.
Titu Andreescu, Dorin Andrica,
Zumming Feng
104 Number Theory Problems.
Birkhauser Boston