Transcription

1 First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Final Examination Spring Session 2008 WUCT121 Discrete Mathematics This exam represents 60% of the total subject marks Reading Time: 5 minutes Time allowed: 3 Hours DIRECTIONS TO CANDIDATES Refer to Page 2 ITC Education Ltd trading as Wollongong College Australia CRICOS 02723D ABN WCA-WUCT121-EXSF Page 1 of 9

2 DIRECTIONS TO CANDIDATES 1.  Total number of questions: All questions are to be attempted.  3.  All answers must be written in the Examination Answer Booklet supplied.  4.  Questions are of equal value.  5.  All working must be clearly shown.  6.  Non-programmable calculators may be used.  7.  No other examination aids are permitted.  8.  Electronic dictionaries are not allowed.  9.  Non-English speaking background students may use an approved English to Foreign language translation dictionary 10.  The examination paper must not be removed from the examination room and must be submitted with the examination answer booklet.  11.  During the 5 minutes reading time, you may make notes on the examination paper only.  Answer Booklets must remain closed.  WCA-WUCT121-EXSF Page 2 of 9

3 START OF EXAM Question 1 (a) Using the quick method, prove that the following statement is a tautology: (~ p ~ q) ~ ( p q) (b) Using full truth tables, determine whether the following statement is a tautology, a contradiction, or is contingent: ~ (( q ~ p) ( p ~ q)) ~ (~ p ~ q) [12 marks] (c) Write the following statement in predicate calculus notation using quantifiers and variables: Some students cannot correctly answer all questions in this exam. [ 8 marks] (d) Write in simple English without using quantifiers or variables: "x Œ +, $y Œ +, (y < x), where + is the set of positive Real numbers. ( e) Write down, then simplify, the negations of each of the statements in parts (c) and (d) using; (i) Predicate calculus notation using quantifiers and variables. ( ii) Simple English without using quantifiers and variables. ( f) For the following sentence: The statement that all statements are sentences but not all sentences are statements is false. ( i) Determine if it is a statement; and explain why or why not. ( ii) If it is a statement, determine whether it is true or false, giving reasons for your answer.  WCA-WUCT121-EXSF Page 3 of 9

4 Question 2 (a) Using a direct proof, prove the following statement: 2 + For any real number x, 20( x 1) 4 x 5 (b) Briefly explain how the following tautologies may be used in the method of proof by contradiction: (i) (~ p ( q ~ q)) p (ii) ( p q) (~ q ~ p) (c) Using proof by contradiction or otherwise, prove the following statements: (i) For all integers n, if n 3 is even then n is even. ( ii) There is no largest even integer. [ 8 marks] [8 marks] (d) Consider the following statements: P : Q : R : 2x + 1 = 3 2x = 2 x = 1 If we assume that P is a true statement, explain how these statements, together with Modus Ponens and the Law of Syllogism, can be used to prove that R is also a true statement. [ 10 marks] (e) Complete the following tautology, which is used in the method of proof by cases: K KKKKKKKK (( p r) KK( q r)) (f) Using proof by cases or otherwise, prove the following statement: For all integers n, 2 n 2 1 is odd. [ 10 marks] WCA-WUCT121-EXSF Page 4 of 9

5 Question 3 (a) Use Mathematical Induction to prove that 5 n 1 is divisible by 4 for all n Œ Õ. (b) (i) Use the Euclidean Algorithm to find gcd(126, 39). ( ii) Find m, n Œ Ÿ such that 126m 39n = gcd(126, 39). ( c) (i) Showing all steps clearly, use the Sieve of Eratosthenes to find all the prime numbers between 2 and 52. [ 8 marks] (ii) Write down all the twin primes between 2 and 52. ( d) Use the Generalized Pigeonhole Principle to justify your answer to the following question: In a group of 2000 students, must at least five have the same day of the year as their birthday? ( e) Find a value of x such that x = 5 7 (mod) 17 and 0 x < 17. ( f) Write down the complete set of residue classes modulo 11, Ÿ 11. ( g) Express each of the elements [ 3], [7], [44] Œ Ÿ 11 as [x] Œ Ÿ 11, 0 x < 11. ( h) Let S Ÿ 11 be given by S = {[1], [4], [7]}. ( i) Construct the multiplication table for S. [6marks] (ii) Using this table, or otherwise, determine the identity for multiplication and the multiplicative inverses of all the elements in S which have them.  WCA-WUCT121-EXSF Page 5 of 9

9 (e) For the graph G given in question (d) above, either write down a path with the specified properties, or explain why no such path exists. ( i) A simple path of length 3 from v 1 to v 2. ( ii) A path of length 4 from v 1 to v 3. ( f) Is the graph G given in question (d) above connected?  If so, what is the least number of edges you must remove to make the graph disconnected?  Give an example. ( g) If the edges in graph G have the following weightings, use Kruskal s Algorithm to find a minimum spanning tree for G: e =, e = 7, e = 9, e = 2, e = 6, e = 3, e = (h) Label the vertices and edges of the following graphs in any convenient way and show whether or not they are isomorphic.  END OF EXAM WCA-WUCT121-EXSF Page 9 of 9

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no.  1.  We introduce the concept of a proposition, which is a statement

Lecture Notes in Discrete Mathematics Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 Preface This book is designed for a one semester course in discrete mathematics for sophomore or junior

Instructions.  Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed.  Credit will not be given for answers (even correct ones) without

1. ( Chapter 1 supplementary, problem 7): There are 12 men at a dance. ( a) In how many ways can eight of them be selected to form a cleanup crew? ( b) How many ways are there to pair off eight women at the

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1.  Introduction.  The definitions of metric space and topological space were developed in the early 1900 s, largely

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?  introduction Many students seem to have trouble with the notion of a mathematical proof.  People that come to a course like Math 216, who certainly

11.01 List the elements of Z 2 Z 4.  Find the order of each of the elements is this group cyclic?  Solution: The elements of Z 2 Z 4 are: (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order

We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical

136 TER 4.  INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph.  Many situations in the applications of discrete mathematics

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1.  Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}.  If G = g, then G itself is cyclic, with g as a generator.  Examples

Check Digit Schemes and Error Detecting Codes By Breanne Oldham Union University What are Check Digit Schemes?  Check digit schemes are numbers appended to an identification number that allow the accuracy

Predicate Logic Example: All men are mortal.  Socrates is a man.  Socrates is mortal.  Note: We need logic laws that work for statements involving quantities like some and all.  In English, the predicate is

Math/Stats 425 Introduction to Probability 1.  Uncertainty and the axioms of probability Processes in the real world are random if outcomes cannot be predicted with certainty.  Example: coin tossing, stock

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing

FACTORING The claim that factorization is harder than primality testing (or primality certification) is not currently substantiated rigorously.  As some sort of backward evidence that factoring is hard,

MA651 Topology.  Lecture 6.  Separation Axioms.  This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

On the number of lines of theorems in the formal system MIU Armando B. Matos Technical Report Series: DCC -- -- Departamento de Ciência de Computadores Faculdade de Ciências & Laboratório de Inteligência

Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1.  An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors. 

FACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY LINDSEY R. BOSKO I would like to acknowledge the assistance of Dr. Michael Singer.  His guidance and feedback were instrumental in completing this

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

Topology-based network security Tiit Pikma Supervised by Vitaly Skachek Research Seminar in Cryptography University of Tartu, Spring 2013 1 Introduction In both wired and wireless networks, there is the

Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

GREEN CHICKEN EXAM - NOVEMBER 2012 GREEN CHICKEN AND STEVEN J. MILLER Question 1: The Green Chicken is planning a surprise party for his grandfather and grandmother.  The sum of the ages of the grandmother

Algebra 1 Course Overview Students develop algebraic fluency by learning the skills needed to solve equations and perform important manipulations with numbers, variables, equations, and inequalities.  Students

irst Order Logic Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.  Are the following sentences propositions?  oronto

Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,

Acta Math.  Univ.  Comenianae Vol.  LXVI, 2(1997), pp.  285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract.  It is well known that Moore digraphs do

!  ROCHESTER INSTITUTE OF TECHNOLOGY COURSE OUTLINE FORM COLLEGE OF SCIENCE School of Mathematical Sciences New Revised COURSE: COS-MATH-200 Discrete Mathematics and Introduction to Proofs 1.0 Course designations

An Introductory Course in Elementary Number Theory Wissam Raji 2 Preface These notes serve as course notes for an undergraduate course in number theory.  Most if not all universities worldwide offer introductory

Extra Credit Assignment Lesson plan The following assignment is optional and can be completed to receive up to 5 points on a previously taken exam.  The extra credit assignment is to create a typed up lesson

Predicate Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane 1 Grammar A term is an individual constant or a variable.  An individual constant is a lowercase letter from the beginning

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract.  Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for

A single minimal complement for the c.e.  degrees Andrew Lewis Leeds University, April 2002 Abstract We show that there exists a single minimal (Turing) degree b < 0 s.t.  for all c.e.  degrees 0 < a < 0,

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT.  L(2,1)-labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs

CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },

Primality Testing and Factorization Methods Eli Howey May 27, 2014 Abstract Since the days of Euclid and Eratosthenes, mathematicians have taken a keen interest in finding the nontrivial factors of integers,

Introducing Formal Methods Formal Methods for Software Specification and Analysis: An Overview 1 Software Engineering and Formal Methods Every Software engineering methodology is based on a recommended

Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN Part II: Group Theory No rights reserved.  Any part of this work can be reproduced or transmitted in any form or by any means.  Version: 1.1 Release: Jan 2013

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1.  BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics. 

Cryptography Digital Signatures Professor: Marius Zimand Digital signatures are meant to realize authentication of the sender nonrepudiation (Note that authentication of sender is also achieved by MACs.) 

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 1 The Concept of a Mapping The concept of a mapping (aka function) is important throughout mathematics.  We have been dealing

Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8).  It s now time to take the plunge and move on to quadratic equations. 

To ensure the functioning of the site, we use cookies.  We share information about your activities on the site with our partners and Google partners: social networks and companies engaged in advertising and web analytics.  For more information, see the Privacy Policy and Google Privacy &amp Terms. 
Your consent to our cookies if you continue to use this website.