Do not turn over until you are told to do so by the Invigilator.

Size: px
Start display at page:

Download "Do not turn over until you are told to do so by the Invigilator."

Transcription

1 UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination SETS, NUMBERS AND PROBABILITY MTHA4001Y Time allowed: 2 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. Janacek statistics tables are available on your desk. Notes are not permitted in this examination. Do not turn over until you are told to do so by the Invigilator. MTHA4001Y Module Contact: Dr Davide Proment, MTH Copyright of the University of East Anglia Version: 1

2 (i) (a) Suppose that a, b, d, m, n are integers. Give the definition of what is meant by saying that d is a divisor of a. Using this, prove that if d is a divisor of a and d is a divisor of b, then d is a divisor of ma + nb. (b) Use the Euclidean algorithm to find the greatest common divisor d of 225 and 63. Hence (or otherwise) find integers m, n with 225m + 63n = d. (c) Are there integers s, t such that 225s + 63t = 17? carefully. Explain your answer [12 marks] (ii) Prove by induction that n 3 n is a multiple of 6 for all natural numbers n. [8 marks] MTHA4001Y Version: 1

3 (i) In the framework of modern probability, give the definition of two disjoint events and state Kolmogorov s three axioms of the modern theory of probability. (a) Use Kolmogorov s axioms to prove that P ( ) = 0. (b) Use Kolmogorov s axioms to prove that if A B then P (A) P (B). You may assume that P (C D) = P (C) + P (D) holds for any disjoint events C and D. [12 marks] (ii) At UEA Sportspark a survey showed that 25% of customers use the swimming pool and 75% go to the gym, while 90% do at least one of these activities. If a customer is selected at random, find the probability that they: (a) do both activities; (b) go to the gym and do not use the swimming pool; (c) use the swimming pool, given that they go to the gym; (d) do not go to the gym, given that they use the swimming pool. [8 marks] MTHA4001Y PLEASE TURN OVER Version: 1

4 (i) (a) State (but do not prove) the Fundamental Theorem of Arithmetic. (b) Prove that there are infinitely many prime numbers. (ii) Suppose that A is a non-empty set and is a relation on A. Define what it means for to be reflexive, symmetric and transitive. In each of the following cases, decide which (if any) of these properties the given relation has. Give reasons for your answers. (a) A = N and a b gcd(a, b) = 1 (for a, b N ). (b) A = C and a b a + b R (for a, b C ). 4. (i) Suppose that A, B are sets and f : A B is a function. Write down what it means for f to be surjective and what it means for f to be injective. For each of the following functions decide whether it is injective, surjective, both or neither. You should give brief reasons for your answers. (a) f : R R where f(x) = exp(x) for x R. { n/3 if 3 n, (b) g : Z Z where g(n) = n if 3 n. (ii) (a) State (but do not prove) Fermat s Little Theorem. (b) Compute the remainder when is divided by 31. (c) Find x Z such that 17x 1 (mod 77). MTHA4001Y Version: 1

5 (i) Let X be a Poisson random variable with parameter λ. The probability mass function for X is P (X = k) = λk e λ. k! (a) Show that P (X = k) = 1. k=0 (b) By assuming (a) is true, calculate E(X). [8 marks] (ii) Students travelling to the city arrive at the UEA bus stop according to a Poisson process of intensity 10 per 5 minutes between 17:00 and 19:00, and of intensity 3 per 10 minutes during the rest of the day. (a) What is the probability that at least 8 students arrive at the bus stop between 18:00 and 18:03? (b) What is the probability that at most 12 students arrive at the bus stop between 9:00 and 9:30? (c) Suppose that no students are the bus stop at 16:57. What is the probability that exactly 1 student arrives by 17:01? [12 marks] MTHA4001Y PLEASE TURN OVER Version: 1

6 (i) (a) Define expectation E(X) and variance V (X) of a continuous random variable X. A random variable X is said to have a normal N(µ, σ 2 ) distribution with mean µ and variance σ 2 if its probability density function is f(x) = 1 ] (x µ)2 exp [. 2π σ 2 σ 2 (b) Show that the probability density function f(x) satisfies the first Kolmogorov axiom of modern probability. (c) By rigorously evaluating the expectation E(X), prove that it is equal to the mean µ. You may use the result e s2 /2 ds = 2π. (ii) The standard normal random variable Z is a particular case of normal random variable having mean µ s = 0 and variance σ 2 s = 1. Its cumulative density function is defined by Φ(z) = P (Z z) = 1 2π z e z2 /2 dz and its values are computed numerically and tabulated in the statistical tables. (a) Give the definition of cumulative distribution function F (x) of the normal random variable X having f(x) as a probability density function. (b) Then, explain why the following relation holds ( ) x µ F (x) = P (X x) = Φ, that is z x µ. σ σ (c) Consider the normal random variable Y which has mean µ = 10 and variance σ 2 = 49. Find P (Y 0) and P (Y < 3 Y > 20). END OF PAPER MTHA4001Y Version: 1

7 MTHA4001Y Feedback on Main Series Examinations SNAP Question 1 This question was done well. Almost everyone was able to define a divisor; marks were lost here for vague answers. Marks were lost on the proof portion for not specifying that mr + ns (or similar) was an integer. Almost everyone was able to do the Euclidean algorithm correctly. Problems arose in part (c), where you are asked to prove that there are no such s, t Z such that 225s + 63t = 17; lots of your proofs relied on 17 not dividing m, n from the previous question. This was not enough. The induction question was rarely attempted; the base case was generally well done, but the inductive step proved confusing. Marks were lost here for incorrect statements of P (k), a missed step or two, or simply giving up half way through the proof. Question 2 Overall not very well done. Most of you did not stated correctly all the the three Kolmogorov s axioms, with mistakes mostly in the third axiom. More than a third of you wrote that two events A and B are disjoint when P (A B) = 0; this is indeed correct but it is a consequence of the true definition which simply says that two events A and B are disjoint when A B =. Marks were also lost for not explaining following a clear and linear logic why P ( ) = 0. Q2(ii) was overall sufficiently well done. Question 3 Part (i) of this question was done poorly. Many of you remembered the Fundamental Theorem of Arithmetic in part (a) was something to do with the factorisation of natural numbers into primes. Fewer remembered that this factorisation must be unique, and fewer than that also wrote that this was up to the order to multiplication. All three parts were required for full marks. Part (b) was not attempted in general; for those who did attempt it, the contradiction derived was usually a little sketchy. You should use the Fundamental Theorem of Arithmetic to derive your contradiction, as in the lecture notes. Part (ii) of this question was a lot better. For the most part, marks were lost in the definitions for lack of quantifiers (so a, b A). For the relations given, this was done well. Although marks were lost mainly for not providing numbers as counterexamples, this was a minority and I was very impressed with the correct use of counterexamples throughout the question by the majority of students. Question 4 In part (i), most of you were able to correctly write down the definitions of surjective and injective functions; this was a marked improvement on previous years, so well done! However, when it came to using these definitions, a significant amount of students were not able to prove that e x was injective; mostly due to skipped steps, vague proofs, or graphical arguments (which was mildly disappointing). The use of counterexamples was again a highlight of this question. There were almost no problems with part (ii); however, most of you forgot to write either a Z or p a prime in Fermat s Little Theorem in part (a). Part (b) was done well in general; marks were lost here for arithmetic errors. Similarly to the Euclidean Algorithm in question 1, part (c) was done well. Question 5 Q5(i) was overall well done but some marks were lost for not using the right notation (for instance in the summation) or not being clear enough in your explanations. One note: the first letter of the word MO: Dr Davide Proment 1/1 2017

8 MTHA4001Y Feedback on Main Series Examinations SNAP Maclaurin must be in capital letters as it comes from the Scottish mathematician Colin Maclaurin. About half of you attempted Q5(ii)(c) doing it right but marks were taken for not explaining that the probability is simply given by the sum of the two events E 1 = {1 student arrives in 16:57-17:00 and no students arrive in 17:00-17:01} and E 2 = {no students arrive in 16:57-17:00 and one student arrives in 17:00-17:01} because E 1 and E 2 are independent. Question 6 Not many of you attempted Q6: half of those did it very well, and the rest did it quite badly. Marks were lost in Q6(i)(b) for saying only that f(x) > 0 and not defining the generic event A that needs to satisfy P (A) 0. Marks were also lost for mistakes in the calculations of Q6(i)(c). MO: Dr Davide Proment 2/1 2017

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions. UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 SETS, NUMBERS AND PROBABILITY MTHA4001Y Time allowed: 2 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. penalised

More information

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions. UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 SETS, NUMBERS AND PROBABILITY MTHA4001Y Time allowed: 2 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. penalised

More information

Janacek statistics tables (2009 edition) are available on your desk. Do not turn over until you are told to do so by the Invigilator.

Janacek statistics tables (2009 edition) are available on your desk. Do not turn over until you are told to do so by the Invigilator. UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2016 17 CALCULUS AND PROBABILITY MTHB4006Y Time allowed: 2 Hours Attempt THREE questions. Janacek statistics tables (2009 edition)

More information

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions. UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 CALCULUS AND MULTIVARIABLE CALCULUS MTHA4005Y Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.

More information

MATHEMATICAL MODELLING, MECHANICS AND MOD- ELLING MTHA4004Y

MATHEMATICAL MODELLING, MECHANICS AND MOD- ELLING MTHA4004Y UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 MATHEMATICAL MODELLING, MECHANICS AND MOD- ELLING MTHA4004Y Time allowed: 2 Hours Attempt QUESTIONS 1 and 2, and ONE other

More information

Chapter 1 : The language of mathematics.

Chapter 1 : The language of mathematics. MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :

More information

Mathematics for Computer Scientists

Mathematics for Computer Scientists Mathematics for Computer Scientists Lecture notes for the module G51MCS Venanzio Capretta University of Nottingham School of Computer Science Chapter 6 Modular Arithmetic 6.1 Pascal s Triangle One easy

More information

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions. UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 FERMAT S LAST THEOREM MTHD6024B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. penalised

More information

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

Do not turn over until you are told to do so by the Invigilator.

Do not turn over until you are told to do so by the Invigilator. UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2013 14 CALCULUS AND MULTIVARIABLE CALCULUS MTHA4005Y Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.

More information

a the relation arb is defined if and only if = 2 k, k

a the relation arb is defined if and only if = 2 k, k DISCRETE MATHEMATICS Past Paper Questions in Number Theory 1. Prove that 3k + 2 and 5k + 3, k are relatively prime. (Total 6 marks) 2. (a) Given that the integers m and n are such that 3 (m 2 + n 2 ),

More information

CS280, Spring 2004: Final

CS280, Spring 2004: Final CS280, Spring 2004: Final 1. [4 points] Which of the following relations on {0, 1, 2, 3} is an equivalence relation. (If it is, explain why. If it isn t, explain why not.) Just saying Yes or No with no

More information

Part IA Numbers and Sets

Part IA Numbers and Sets Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

Algebraic structures I

Algebraic structures I MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one

More information

Higher Unit 9 topic test

Higher Unit 9 topic test Name: Higher Unit 9 topic test Date: Time: 45 minutes Total marks available: 41 Total marks achieved: Questions Q1. (a) (i) Factorise x 2 12x + 27... (ii) Solve the equation x 2 12x + 27 = 0 (b) Factorise

More information

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. 2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say

More information

MAT115A-21 COMPLETE LECTURE NOTES

MAT115A-21 COMPLETE LECTURE NOTES MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes

More information

FLUID DYNAMICS, THEORY AND COMPUTATION MTHA5002Y

FLUID DYNAMICS, THEORY AND COMPUTATION MTHA5002Y UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 FLUID DYNAMICS, THEORY AND COMPUTATION MTHA5002Y Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.

More information

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.

Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions. UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 CRYPTOGRAPHY MTHD6025A Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt

More information

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is 1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,

More information

Attempt THREE questions. You will not be penalised if you attempt additional questions.

Attempt THREE questions. You will not be penalised if you attempt additional questions. UNIVERITY OF EAT ANGLIA chool of Mathematics Main eries UG Examination 07 8 MATHEMATIC FOR CIENTIT C MTHB5007B Time allowed: Hours Attempt THREE questions. You will not be penalised if you attempt additional

More information

MAT246H1S - Concepts In Abstract Mathematics. Solutions to Term Test 1 - February 1, 2018

MAT246H1S - Concepts In Abstract Mathematics. Solutions to Term Test 1 - February 1, 2018 MAT246H1S - Concepts In Abstract Mathematics Solutions to Term Test 1 - February 1, 2018 Time allotted: 110 minutes. Aids permitted: None. Comments: Statements of Definitions, Principles or Theorems should

More information

Candidates must show on each answer book the type of calculator used. Only calculators permitted under UEA Regulations may be used.

Candidates must show on each answer book the type of calculator used. Only calculators permitted under UEA Regulations may be used. UNIVERSITY OF EAST ANGLIA School of Mathematics May/June UG Examination 2010 2011 CRYPTOGRAPHY Time allowed: 2 hours Attempt THREE questions. Candidates must show on each answer book the type of calculator

More information

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The

More information

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

CS 360, Winter Morphology of Proof: An introduction to rigorous proof techniques

CS 360, Winter Morphology of Proof: An introduction to rigorous proof techniques CS 30, Winter 2011 Morphology of Proof: An introduction to rigorous proof techniques 1 Methodology of Proof An example Deep down, all theorems are of the form If A then B, though they may be expressed

More information

UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations

UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS 2013 MATH 122: Logic and Foundations Instructor and section (check one): K. Mynhardt [A01] CRN 12132 G. MacGillivray [A02] CRN 12133 NAME: V00#: Duration: 3

More information

CS280, Spring 2004: Prelim Solutions

CS280, Spring 2004: Prelim Solutions CS280, Spring 2004: Prelim Solutions 1. [3 points] What is the transitive closure of the relation {(1, 2), (2, 3), (3, 1), (3, 4)}? Solution: It is {(1, 2), (2, 3), (3, 1), (3, 4), (1, 1), (2, 2), (3,

More information

MEI STRUCTURED MATHEMATICS 4751

MEI STRUCTURED MATHEMATICS 4751 OXFORD CAMBRIDGE AND RSA EXAMINATIONS Advanced Subsidiary General Certificate of Education Advanced General Certificate of Education MEI STRUCTURED MATHEMATICS 75 Introduction to Advanced Mathematics (C)

More information

Math 3450 Homework Solutions

Math 3450 Homework Solutions Math 3450 Homework Solutions I have decided to write up all the solutions to prolems NOT assigned from the textook first. There are three more sets to write up and I am doing those now. Once I get the

More information

Linear Equations. 196 minutes. 191 marks. Page 1 of 50

Linear Equations. 196 minutes. 191 marks. Page 1 of 50 Linear Equations 196 minutes 191 marks Page 1 of 50 Q1. The perimeter of this L-shape is 56 cm. Not drawn accurately Set up and solve an equation to work out the value of x. x =... (Total 4 marks) Page

More information

Definition For a set F, a polynomial over F with variable x is of the form

Definition For a set F, a polynomial over F with variable x is of the form *6. Polynomials Definition For a set F, a polynomial over F with variable x is of the form a n x n + a n 1 x n 1 + a n 2 x n 2 +... + a 1 x + a 0, where a n, a n 1,..., a 1, a 0 F. The a i, 0 i n are the

More information

RED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam

RED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice

More information

Chapter 2 - Relations

Chapter 2 - Relations Chapter 2 - Relations Chapter 2: Relations We could use up two Eternities in learning all that is to be learned about our own world and the thousands of nations that have arisen and flourished and vanished

More information

Computer Science Foundation Exam

Computer Science Foundation Exam Computer Science Foundation Exam May 6, 2016 Section II A DISCRETE STRUCTURES NO books, notes, or calculators may be used, and you must work entirely on your own. SOLUTION Question Max Pts Category Passing

More information

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers: WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their

More information

Mathematical Reasoning & Proofs

Mathematical Reasoning & Proofs Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0

More information

Math 13, Spring 2013, Lecture B: Midterm

Math 13, Spring 2013, Lecture B: Midterm Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.

More information

* 8 Groups, with Appendix containing Rings and Fields.

* 8 Groups, with Appendix containing Rings and Fields. * 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that

More information

Writing Mathematical Proofs

Writing Mathematical Proofs Writing Mathematical Proofs Dr. Steffi Zegowitz The main resources for this course are the two following books: Mathematical Proofs by Chartrand, Polimeni, and Zhang How to Think Like a Mathematician by

More information

Basic elements of number theory

Basic elements of number theory Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a

More information

Basic elements of number theory

Basic elements of number theory Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation

More information

Number Theory Math 420 Silverman Exam #1 February 27, 2018

Number Theory Math 420 Silverman Exam #1 February 27, 2018 Name: Number Theory Math 420 Silverman Exam #1 February 27, 2018 INSTRUCTIONS Read Carefully Time: 50 minutes There are 5 problems. Write your name neatly at the top of this page. Write your final answer

More information

Senior Math Circles Cryptography and Number Theory Week 2

Senior Math Circles Cryptography and Number Theory Week 2 Senior Math Circles Cryptography and Number Theory Week 2 Dale Brydon Feb. 9, 2014 1 Divisibility and Inverses At the end of last time, we saw that not all numbers have inverses mod n, but some do. We

More information

1 Overview and revision

1 Overview and revision MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction

More information

University of Toronto Faculty of Arts and Science Solutions to Final Examination, April 2017 MAT246H1S - Concepts in Abstract Mathematics

University of Toronto Faculty of Arts and Science Solutions to Final Examination, April 2017 MAT246H1S - Concepts in Abstract Mathematics University of Toronto Faculty of Arts and Science Solutions to Final Examination, April 2017 MAT246H1S - Concepts in Abstract Mathematics Examiners: D. Burbulla, P. Glynn-Adey, S. Homayouni Time: 7-10

More information

MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.

MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. Notation 2 A set can be described using set-builder notation. That is, a set can be described

More information

MAS114: Exercises. October 26, 2018

MAS114: Exercises. October 26, 2018 MAS114: Exercises October 26, 2018 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.

More information

MATH 13 FINAL EXAM SOLUTIONS

MATH 13 FINAL EXAM SOLUTIONS MATH 13 FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers. T F

More information

Attempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator.

Attempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator. UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2016 17 SEMIGROUP THEORY MTHE6011A Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. Notes are not permitted

More information

Math 109 September 1, 2016

Math 109 September 1, 2016 Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,

More information

TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica. Final exam Logic & Set Theory (2IT61) (correction model)

TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica. Final exam Logic & Set Theory (2IT61) (correction model) TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica Final exam Logic & Set Theory (2IT61) (correction model) Thursday November 4, 2016, 9:00 12:00 hrs. (2) 1. Determine whether the abstract

More information

Time: 1 hour 30 minutes

Time: 1 hour 30 minutes Paper Reference(s) 666/01 Edexcel GCE Core Mathematics C1 Silver Level S4 Time: 1 hour 0 minutes Materials required for examination Mathematical Formulae (Green) Items included with question papers Nil

More information

MATHEMATICAL PROBLEM SOLVING, MECHANICS AND MODELLING MTHA4004Y

MATHEMATICAL PROBLEM SOLVING, MECHANICS AND MODELLING MTHA4004Y UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2014 2015 MATHEMATICAL PROBLEM SOLVING, MECHANICS AND MODELLING MTHA4004Y Time allowed: 2 Hours Attempt QUESTIONS 1 AND 2 and

More information

Direct Proof and Counterexample I:Introduction

Direct Proof and Counterexample I:Introduction Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting :

More information

Direct Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved.

Direct Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved. Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting statement:

More information

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics

MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics Class Meetings: MW 9:30-10:45 am in EMS E424A, September 3 to December 10 [Thanksgiving break November 26 30; final

More information

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively 6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise

More information

1. Foundations of Numerics from Advanced Mathematics. Mathematical Essentials and Notation

1. Foundations of Numerics from Advanced Mathematics. Mathematical Essentials and Notation 1. Foundations of Numerics from Advanced Mathematics Mathematical Essentials and Notation Mathematical Essentials and Notation, October 22, 2012 1 The main purpose of this first chapter (about 4 lectures)

More information

Attempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator.

Attempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator. UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2016 17 SEMIGROUP THEORY WITH ADVANCED TOPICS MTHE7011A Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.

More information

D-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.

D-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma. D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +

More information

Fundamentals of Pure Mathematics - Problem Sheet

Fundamentals of Pure Mathematics - Problem Sheet Fundamentals of Pure Mathematics - Problem Sheet ( ) = Straightforward but illustrates a basic idea (*) = Harder Note: R, Z denote the real numbers, integers, etc. assumed to be real numbers. In questions

More information

Workshop 1- Building on the Axioms. The First Proofs

Workshop 1- Building on the Axioms. The First Proofs Boston University Summer I 2009 Workshop 1- Building on the Axioms. The First Proofs MA341 Number Theory Kalin Kostadinov The goal of this workshop was to organize our experience with the common integers

More information

* * MATHEMATICS (MEI) 4755 Further Concepts for Advanced Mathematics (FP1) ADVANCED SUBSIDIARY GCE. Friday 22 May 2009 Morning

* * MATHEMATICS (MEI) 4755 Further Concepts for Advanced Mathematics (FP1) ADVANCED SUBSIDIARY GCE. Friday 22 May 2009 Morning ADVANCED SUBSIDIARY GCE MATHEMATICS (MEI) 755 Further Concepts for Advanced Mathematics (FP) Candidates answer on the Answer Booklet OCR Supplied Materials: 8 page Answer Booklet Graph paper MEI Examination

More information

PRIME NUMBERS YANKI LEKILI

PRIME NUMBERS YANKI LEKILI PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume

More information

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical

More information

Math 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011

Math 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011 Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell

More information

Introduction to Proofs

Introduction to Proofs Introduction to Proofs Notes by Dr. Lynne H. Walling and Dr. Steffi Zegowitz September 018 The Introduction to Proofs course is organised into the following nine sections. 1. Introduction: sets and functions

More information

CHAPTER 6. Prime Numbers. Definition and Fundamental Results

CHAPTER 6. Prime Numbers. Definition and Fundamental Results CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n

More information

Midterm Exam. There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of your work! Best 5

Midterm Exam. There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of your work! Best 5 Department of Mathematical Sciences Instructor: Daiva Pucinskaite Modern Algebra June 22, 2017 Midterm Exam There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of

More information

MATH FINAL EXAM REVIEW HINTS

MATH FINAL EXAM REVIEW HINTS MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any

More information

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...} WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not

More information

Principles of Real Analysis I Fall I. The Real Number System

Principles of Real Analysis I Fall I. The Real Number System 21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous

More information

MATH 363: Discrete Mathematics

MATH 363: Discrete Mathematics MATH 363: Discrete Mathematics Learning Objectives by topic The levels of learning for this class are classified as follows. 1. Basic Knowledge: To recall and memorize - Assess by direct questions. The

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

MATH 2200 Final Review

MATH 2200 Final Review MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics

More information

Chapter 2. Divisibility. 2.1 Common Divisors

Chapter 2. Divisibility. 2.1 Common Divisors Chapter 2 Divisibility 2.1 Common Divisors Definition 2.1.1. Let a and b be integers. A common divisor of a and b is any integer that divides both a and b. Suppose that a and b are not both zero. By Proposition

More information

CMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005

CMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 CMSC-37110 Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade.

More information

Instructor s suggestions for use of Number Theory notes

Instructor s suggestions for use of Number Theory notes Number Theory Instructor s suggestions for use of Number Theory notes Goal. Our goal is to inspire students to be actively engaged in mathematical thought. We want them to discover ideas on their own,

More information

Mathematics of Cryptography

Mathematics of Cryptography Modulo arithmetic Fermat's Little Theorem If p is prime and 0 < a < p, then a p 1 = 1 mod p Ex: 3 (5 1) = 81 = 1 mod 5 36 (29 1) = 37711171281396032013366321198900157303750656 = 1 mod 29 (see http://gauss.ececs.uc.edu/courses/c472/java/fermat/fermat.html)

More information

PhysicsAndMathsTutor.com

PhysicsAndMathsTutor.com 1. A particle P of mass 0.5 kg is moving under the action of a single force F newtons. At time t seconds, F = (6t 5) i + (t 2 2t) j. The velocity of P at time t seconds is v m s 1. When t = 0, v = i 4j.

More information

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number

More information

NOTES ON INTEGERS. 1. Integers

NOTES ON INTEGERS. 1. Integers NOTES ON INTEGERS STEVEN DALE CUTKOSKY The integers 1. Integers Z = {, 3, 2, 1, 0, 1, 2, 3, } have addition and multiplication which satisfy familar rules. They are ordered (m < n if m is less than n).

More information

NOTES ON SIMPLE NUMBER THEORY

NOTES ON SIMPLE NUMBER THEORY NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,

More information

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010) http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product

More information

Finite and Infinite Sets

Finite and Infinite Sets Chapter 9 Finite and Infinite Sets 9. Finite Sets Preview Activity (Equivalent Sets, Part ). Let A and B be sets and let f be a function from A to B..f W A! B/. Carefully complete each of the following

More information

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements

More information

MATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology.

MATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology. MATH 501 Discrete Mathematics Lecture 6: Number theory Prof. Dr. Slim Abdennadher, slim.abdennadher@guc.edu.eg German University Cairo, Department of Media Engineering and Technology 1 Number theory Number

More information

Sets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth

Sets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth Sets We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth century. Most students have seen sets before. This is intended

More information

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

More information

Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z:

Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z: Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some z Z Notation: b Fact: for all, b, c Z:, 1, and 0 0 = 0 b and b c = c b and c = (b + c) b and b = ±b 1

More information

Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography

Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups

More information

Discrete Mathematics & Mathematical Reasoning Course Overview

Discrete Mathematics & Mathematical Reasoning Course Overview Discrete Mathematics & Mathematical Reasoning Course Overview Colin Stirling Informatics Colin Stirling (Informatics) Discrete Mathematics Today 1 / 19 Teaching staff Lecturers: Colin Stirling, first half

More information

Mathematical Writing and Methods of Proof

Mathematical Writing and Methods of Proof Mathematical Writing and Methods of Proof January 6, 2015 The bulk of the work for this course will consist of homework problems to be handed in for grading. I cannot emphasize enough that I view homework

More information

RYERSON UNIVERSITY DEPARTMENT OF MATHEMATICS

RYERSON UNIVERSITY DEPARTMENT OF MATHEMATICS RYERSON UNIVERSITY DEPARTMENT OF MATHEMATICS MTH 110 Final Exam December 6, 2008 Total marks: 100 Time allowed: 3 Hours. NAME (Print): STUDENT #: SIGNATURE: Circle your Lab Section: Section 1 Section 2

More information

2010 HSC NOTES FROM THE MARKING CENTRE MATHEMATICS EXTENSION 1

2010 HSC NOTES FROM THE MARKING CENTRE MATHEMATICS EXTENSION 1 Contents 2010 HSC NOTES FROM THE MARKING CENTRE MATHEMATICS EXTENSION 1 Introduction... 1 Question 1... 1 Question 2... 2 Question 3... 3 Question 4... 4 Question 5... 5 Question 6... 5 Question 7... 6

More information

a 2 = ab a 2 b 2 = ab b 2 (a + b)(a b) = b(a b) a + b = b

a 2 = ab a 2 b 2 = ab b 2 (a + b)(a b) = b(a b) a + b = b Discrete Structures CS2800 Fall 204 Final Solutions. Briefly and clearly identify the errors in each of the following proofs: (a) Proof that is the largest natural number: Let n be the largest natural

More information

2 Elementary number theory

2 Elementary number theory 2 Elementary number theory 2.1 Introduction Elementary number theory is concerned with properties of the integers. Hence we shall be interested in the following sets: The set if integers {... 2, 1,0,1,2,3,...},

More information

Time: 1 hour 30 minutes

Time: 1 hour 30 minutes Paper Reference(s) 6663/0 Edexcel GCE Core Mathematics C Gold Level G5 Time: hour 30 minutes Materials required for examination Mathematical Formulae (Green) Items included with question papers Nil Candidates

More information