Mathematics 222 (A1) Midterm Examination May 24, 2002
|
|
- Collin Morton
- 5 years ago
- Views:
Transcription
1 Mathematics (A) Midterm Examination May 4, 00 Department of Mathematical and Statistical Sciences University of Alberta Instructor: I. E. Leonard Time: 70 Minutes. There were 5 children in the Emergency Room and between them they had stuck a total of 76 beans up their noses. Show that there must be three children with a combined total of 45 or more beans up their noses. Solution: Suppose there do not exist 3 children with a combined total of 45 or more beans up their noses. If we label the children A, B, C, D, and E and a, b, c, d, and e are the number of beans in each child s nose, respectively, then we have x + y + z 44 ( ) 5 for any triple x, y, z {a, b, c, d, e}. There are = 0 ways to choose the triplet x, y, z, so that we 3 get 0 inequalities like this. Namely, a + b + c 44 a + b + d 44 a + b + e 44 a + c + d 44 a + c + e 44 a + d + e 44 b + c + d 44 b + c + e 44 b + d + e 44 c + d + e 44 Each of the numbers a, b, c, d, e appears in exactly of these 0 inequalities. ( ) 4 = 6 of the expressions on the left hand side If we add these 0 inequalities, on the left hand side we get 6 (a + b + c + d + e), while on the right hand side we get 0 44, that is, 6 (a + b + c + d + e) 0 44, so that 456 = = 440. Which is obviously a contradiction. Therefore, our original assumption must have been incorrect, and there must be three children with a combined total of 45 or more beans up their noses.
2 . Dr. Ecco concluded that the aliens from whom the message was received also had an alphabet consisting of 6 distinct characters. Another moment s thought convinced him that the code was a linear code with encoding function E(x) 5x (mod 6). Your mission, should you decide to accept it, is to help Dr. Ecco find the decoding function D(x), that is, find an integer a such that D(x) ax (mod 6), and decode the following message from the aliens: IH FUAN, KADD JSIU For your convenience, the correspondence between the letters of the alphabet and the integers 0 5 is given below. A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Solution: Since 5 05 (mod 6), then the decoding function is D(x) x (mod 6), for x = 0,,..., 5. Decoding the message, we have I 8 D(8) 8 68 (mod 6) M H 7 D(7) (mod 6) 7 R F 5 D(5) 5 05 (mod 6) B U 0 D(0) (mod 6) 4 E A 0 D(0) 0 0 (mod 6) 0 A N 3 D(3) (mod 6) 3 N K 0 D(0) 0 0 (mod 6) C A 0 D(0) 0 0 (mod 6) 0 A D 3 D(3) 3 63 (mod 6) L D 3 D(3) 3 63 (mod 6) L J 9 D(9) (mod 6) 7 H S 8 D(8) (mod 6) 4 O I 8 D(8) 8 68 (mod 6) M U 0 D(0) (mod 6) 4 E The message reads: MR BEAN, CALL HOME
3 3. The telephone numbers in a town run from to A common error in dialing on a standard keypad is to punch in a digit vertically adjacent to the intended one. So, on a standard dialing keypad, 6 could be erroneously entered as 3 or 9 (but not as, 5 or 8) Assuming that no other kinds of errors are made, how should a sixth digit be added to each telephone number so that no wrong numbers will be reached because of a dialing error? Solution: Again, there are many acceptable solutions. Given the number abcde, one solution is to choose the sixth digit f so that a + b + c + d + e + f 0 (mod 0), in other words, so that a + b + c + d + e + f is divisible by 0. Note that if an error is made then the digits that get switched differ by 3 or 8. Suppose that in abcdef a digit x gets changed to x, for example, suppose that x = b. If the error is not detected, then a + x + c + d + e + f 0 (mod 0) and a + x + c + d + e + f 0 (mod 0), and so x x 0 (mod 0) However, x x 0 (mod 0) if and only if x x is a multiple of 0, and since x and x are between 0 and 9, then 9 x x 9, but the only multiple of 0 between 9 and 9 is 0 = 0 0. Therefore, if the error is not detected, then x = x, or equivalently, if x and x are switched and are different, then the proposed scheme will always catch the error. 4. A published book is identified by a ten-digit number known as its International Standard Book Number or ISBN. These digits denote the language, the publisher and other data concerning the book, except for the last one, which is introduced as a check-digit. If the first nine digits are a b c d e f g h i, then the tenth digit j is chosen so that 0a + 9b + 8c + 7d + 6e + 5f + 4g + 3h + i + j 0 (mod ). If j has to be ten, an X is used instead. In the following ISBN find the digit that goes in the square Solution: We choose the digit j so that j 0 (mod ), or, j 0 (mod ), that is, j 36 6 (mod ). Therefore, the digit that goes in the square is 6. 3
4 5. The two-out-of-five code consists of all possible binary words of length 5 containing exactly two s. (a) How many code words does the code contain? (b) What is the minimum Hamming distance between code words? (c) How many errors can the code detect or correct? Solution: (a) The number of distinct code words is ( ) 5 = 5 4 = 0, and we can list them as follows (b) Let a and b be two distinct code words. If the number of positions where the two s overlap is 0, for example, a = and b = 0 0 0, then the Hamming distance is d(a, b) = 4. If the number of positions where the two s overlap is, for example, a = and b = 0 0 0, then the Hamming distance is d(a, b) =. Since these are the only two possibilities, then the minimum Hamming distance between any two code words in the two-out-of-five code is. (c) Since the minimum Hamming distance between any two code words is, this code can detect up to one error, but cannot correct any errors. 6. (a) Find a closed form expression for n. (b) Make a conjecture about the terms of the following sequence, and prove your conjecture. +, , , ,... Solution: (a) We have and adding, we get S n = n + n S n = n + n S n = (+n)+(+n )+ +(n +)+(n+) = (n+)+(n+)+ +(n+)+(n+) = n(n+), so that S n = n(n + ). 4
5 (b) Since each of the terms shown above is equal to 3, if we let a n = n n + n n, for n, then it appears that a n = 3 for all n. In order to see that this is indeed the case, we use the result from part (a) to write for n. a n = n(n + ) n(n + ) n(n ) = n + 4n + (n ) = n + 3n + 3 = n + 3(n + ) = 3 5
And for polynomials with coefficients in F 2 = Z/2 Euclidean algorithm for gcd s Concept of equality mod M(x) Extended Euclid for inverses mod M(x)
Outline Recall: For integers Euclidean algorithm for finding gcd s Extended Euclid for finding multiplicative inverses Extended Euclid for computing Sun-Ze Test for primitive roots And for polynomials
More information17.1 Binary Codes Normal numbers we use are in base 10, which are called decimal numbers. Each digit can be 10 possible numbers: 0, 1, 2, 9.
( c ) E p s t e i n, C a r t e r, B o l l i n g e r, A u r i s p a C h a p t e r 17: I n f o r m a t i o n S c i e n c e P a g e 1 CHAPTER 17: Information Science 17.1 Binary Codes Normal numbers we use
More informationHamming Codes 11/17/04
Hamming Codes 11/17/04 History In the late 1940 s Richard Hamming recognized that the further evolution of computers required greater reliability, in particular the ability to not only detect errors, but
More informationchannel of communication noise Each codeword has length 2, and all digits are either 0 or 1. Such codes are called Binary Codes.
5 Binary Codes You have already seen how check digits for bar codes (in Unit 3) and ISBN numbers (Unit 4) are used to detect errors. Here you will look at codes relevant for data transmission, for example,
More information2013 University of New South Wales School Mathematics Competition
Parabola Volume 49, Issue (201) 201 University of New South Wales School Mathematics Competition Junior Division Problems and s Problem 1 Suppose that x, y, z are non-zero integers with no common factor
More informationWe saw in the last chapter that the linear Hamming codes are nontrivial perfect codes.
Chapter 5 Golay Codes Lecture 16, March 10, 2011 We saw in the last chapter that the linear Hamming codes are nontrivial perfect codes. Question. Are there any other nontrivial perfect codes? Answer. Yes,
More informationFebruary 2017 February 18, 2017
February 017 February 18, 017 Combinatorics 1. Kelvin the Frog is going to roll three fair ten-sided dice with faces labelled 0, 1,,..., 9. First he rolls two dice, and finds the sum of the two rolls.
More information8.5 Sequencing Problems
8.5 Sequencing Problems Basic genres. Packing problems: SET-PACKING, INDEPENDENT SET. Covering problems: SET-COVER, VERTEX-COVER. Constraint satisfaction problems: SAT, 3-SAT. Sequencing problems: HAMILTONIAN-CYCLE,
More informationCSE 20. Final Review. CSE 20: Final Review
CSE 20 Final Review Final Review Representation of integers in base b Logic Proof systems: Direct Proof Proof by contradiction Contraposetive Sets Theory Functions Induction Final Review Representation
More informationCan You Hear Me Now?
Can You Hear Me Now? An Introduction to Coding Theory William J. Turner Department of Mathematics & Computer Science Wabash College Crawfordsville, IN 47933 19 October 2004 W. J. Turner (Wabash College)
More informationWeek No. 06: Numbering Systems
Week No. 06: Numbering Systems Numbering System: A numbering system defined as A set of values used to represent quantity. OR A number system is a term used for a set of different symbols or digits, which
More informationCOMMON CORE MATHEMATICS CURRICULUM
COMMON CORE MATHEMATICS CURRICULUM Lesson 1 8 4 Lesson 1: Writing Equations Using Symbols Write each of the following statements using symbolic language. 1. When you square five times a number you get
More informationCMSC 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 informationNUMBER THEORY AND CODES. Álvaro Pelayo WUSTL
NUMBER THEORY AND CODES Álvaro Pelayo WUSTL Talk Goal To develop codes of the sort can tell the world how to put messages in code (public key cryptography) only you can decode them Structure of Talk Part
More informationLinear Codes and Syndrome Decoding
Linear Codes and Syndrome Decoding These notes are intended to be used as supplementary reading to Sections 6.7 9 of Grimaldi s Discrete and Combinatorial Mathematics. The proofs of the theorems are left
More informationInformation redundancy
Information redundancy Information redundancy add information to date to tolerate faults error detecting codes error correcting codes data applications communication memory p. 2 - Design of Fault Tolerant
More informationIOSR Journal of Mathematics (IOSR-JM) e-issn: , p-issn: x. Volume 9, Issue 2 (Nov. Dec. 2013), PP
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn:2319-765x. Volume 9, Issue 2 (Nov. Dec. 2013), PP 33-37 The use of Algorithmic Method of Hamming Code Techniques for the Detection and Correction
More informationSTEP Support Programme. Hints and Partial Solutions for Assignment 17
STEP Support Programme Hints and Partial Solutions for Assignment 7 Warm-up You need to be quite careful with these proofs to ensure that you are not assuming something that should not be assumed. For
More information3. Coding theory 3.1. Basic concepts
3. CODING THEORY 1 3. Coding theory 3.1. Basic concepts In this chapter we will discuss briefly some aspects of error correcting codes. The main problem is that if information is sent via a noisy channel,
More informationTop Ten Algorithms Class 6
Top Ten Algorithms Class 6 John Burkardt Department of Scientific Computing Florida State University... http://people.sc.fsu.edu/ jburkardt/classes/tta 2015/class06.pdf 05 October 2015 1 / 24 Our Current
More information1 Ex. 1 Verify that the function H(p 1,..., p n ) = k p k log 2 p k satisfies all 8 axioms on H.
Problem sheet Ex. Verify that the function H(p,..., p n ) = k p k log p k satisfies all 8 axioms on H. Ex. (Not to be handed in). looking at the notes). List as many of the 8 axioms as you can, (without
More informationLatin Squares and Their Applications
Latin Squares and Their Applications Jason Tang Mentor: Wendy Baratta October 27, 2009 1 Introduction Despite Latin Squares being a relatively unknown aspect of mathematics, there are many interesting
More informationThe Vigenère cipher is a stronger version of the Caesar cipher The encryption key is a word/sentence/random text ( and )
A Better Cipher The Vigenère cipher is a stronger version of the Caesar cipher The encryption key is a word/sentence/random text ( and ) To the first letter, add 1 To the second letter, add 14 To the third
More informationCOMP Intro to Logic for Computer Scientists. Lecture 15
COMP 1002 Intro to Logic for Computer Scientists Lecture 15 B 5 2 J Puzzle: better than nothing Nothing is better than eternal bliss A burger is better than nothing ------------------------------------------------
More informationLinear Cyclic Codes. Polynomial Word 1 + x + x x 4 + x 5 + x x + x
Coding Theory Massoud Malek Linear Cyclic Codes Polynomial and Words A polynomial of degree n over IK is a polynomial p(x) = a 0 + a 1 x + + a n 1 x n 1 + a n x n, where the coefficients a 0, a 1, a 2,,
More informationAnswers and Solutions to (Even Numbered) Suggested Exercises in Sections of Grimaldi s Discrete and Combinatorial Mathematics
Answers and Solutions to (Even Numbered) Suggested Exercises in Sections 6.5-6.9 of Grimaldi s Discrete and Combinatorial Mathematics Section 6.5 6.5.2. a. r = = + = c + e. So the error pattern is e =.
More informationCryptography. P. Danziger. Transmit...Bob...
10.4 Cryptography P. Danziger 1 Cipher Schemes A cryptographic scheme is an example of a code. The special requirement is that the encoded message be difficult to retrieve without some special piece of
More informationSAT Subject Test Practice Test II: Math Level I Time 60 minutes, 50 Questions
SAT Subject Test Practice Test II: Math Level I Time 60 minutes, 50 Questions All questions in the Math Level 1 and Math Level Tests are multiple-choice questions in which you are asked to choose the BEST
More informationn n P} is a bounded subset Proof. Let A be a nonempty subset of Z, bounded above. Define the set
1 Mathematical Induction We assume that the set Z of integers are well defined, and we are familiar with the addition, subtraction, multiplication, and division. In particular, we assume the following
More informationA Mathematical Theory of Communication
A Mathematical Theory of Communication Ben Eggers Abstract This paper defines information-theoretic entropy and proves some elementary results about it. Notably, we prove that given a few basic assumptions
More informationCS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 Solutions
CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 Solutions PRINT Your Name: Answer: Oski Bear SIGN Your Name: PRINT Your Student ID: CIRCLE your exam room: Dwinelle
More information8+4 0 mod (12), mod (12), mod (12), mod (12), mod (12).
Decimal Codes Massoud Malek To make error correcting codes easier to use and analyze, it is necessary to impose some algebraic structure on them. It is especially useful to have an alphabet in which it
More informationDiscrete Mathematics and Probability Theory Summer 2015 Chung-Wei Lin Midterm 1
CS 70 Discrete Mathematics and Probability Theory Summer 2015 Chung-Wei Lin Midterm 1 PRINT Your Name:, last) first) SIGN Your Name: PRINT Your Student ID: CIRCLE your exam room: 2050 VLSB 10 EVANS OTHER
More informationMEP Pupil Text 16. The following statements illustrate the meaning of each of them.
MEP Pupil Tet Inequalities. Inequalities on a Number Line An inequalit involves one of the four smbols >,, < or. The following statements illustrate the meaning of each of them. > : is greater than. :
More information2018 Canadian Senior Mathematics Contest
The CENTRE for EDUCATION in MATHEMATICS and COMPUTING cemc.uwaterloo.ca 208 Canadian Senior Mathematics Contest Wednesday, November 2, 208 (in North America and South America) Thursday, November 22, 208
More informationEureka Math. Grade, Module 4. Student File_B Contains Sprint and Fluency, Exit Ticket, and Assessment Materials
A Story of Eureka Math Grade, Module 4 Student File_B Contains Sprint and Fluency,, and Assessment Materials Published by the non-profit Great Minds. Copyright 2015 Great Minds. No part of this work may
More informationDo not open your test until instructed to do so!
Thirty-Ninth Annual Columbus State Invitational Mathematics Tournament Sponsored by The Columbus State University Department of Mathematics and Philosophy March nd, 013 ************************* The Columbus
More informationExercise 1. = P(y a 1)P(a 1 )
Chapter 7 Channel Capacity Exercise 1 A source produces independent, equally probable symbols from an alphabet {a 1, a 2 } at a rate of one symbol every 3 seconds. These symbols are transmitted over a
More informationSUPPLEMENTARY INFORMATION
SUPPLEMENTARY INFORMATION doi:10.1038/nature11875 Method for Encoding and Decoding Arbitrary Computer Files in DNA Fragments 1 Encoding 1.1: An arbitrary computer file is represented as a string S 0 of
More information( c ) E p s t e i n, C a r t e r a n d B o l l i n g e r C h a p t e r 1 7 : I n f o r m a t i o n S c i e n c e P a g e 1
( c ) E p s t e i n, C a r t e r a n d B o l l i n g e r 2 0 1 6 C h a p t e r 1 7 : I n f o r m a t i o n S c i e n c e P a g e 1 CHAPTER 17: Information Science In this chapter, we learn how data can
More informationCSE 200 Lecture Notes Turing machine vs. RAM machine vs. circuits
CSE 200 Lecture Notes Turing machine vs. RAM machine vs. circuits Chris Calabro January 13, 2016 1 RAM model There are many possible, roughly equivalent RAM models. Below we will define one in the fashion
More informationIntroduction to Probability, Fall 2009
Introduction to Probability, Fall 2009 Math 30530 Review questions for exam 1 solutions 1. Let A, B and C be events. Some of the following statements are always true, and some are not. For those that are
More informationMATH Examination for the Module MATH-3152 (May 2009) Coding Theory. Time allowed: 2 hours. S = q
MATH-315201 This question paper consists of 6 printed pages, each of which is identified by the reference MATH-3152 Only approved basic scientific calculators may be used. c UNIVERSITY OF LEEDS Examination
More informationDeterministic Finite Automata (DFAs)
CS/ECE 374: Algorithms & Models of Computation, Fall 28 Deterministic Finite Automata (DFAs) Lecture 3 September 4, 28 Chandra Chekuri (UIUC) CS/ECE 374 Fall 28 / 33 Part I DFA Introduction Chandra Chekuri
More informationDeterministic Finite Automata (DFAs)
Algorithms & Models of Computation CS/ECE 374, Fall 27 Deterministic Finite Automata (DFAs) Lecture 3 Tuesday, September 5, 27 Sariel Har-Peled (UIUC) CS374 Fall 27 / 36 Part I DFA Introduction Sariel
More informationDirect Proofs. the product of two consecutive integers plus the larger of the two integers
Direct Proofs A direct proof uses the facts of mathematics and the rules of inference to draw a conclusion. Since direct proofs often start with premises (given information that goes beyond the facts of
More informationGrade 6 Math Circles. Gauss Contest Preparation - Solutions
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles March 25/26, 2014 Gauss Contest Preparation - Solutions General Information The Gauss
More informationSection 1.1: Patterns in Division
Section 1.1: Patterns in Division Dividing by 2 All even numbers are divisible by 2. E.g., all numbers ending in 0,2,4,6 or 8. Dividing by 4 1. Are the last two digits in your number divisible by 4? 2.
More informationECEN 604: Channel Coding for Communications
ECEN 604: Channel Coding for Communications Lecture: Introduction to Cyclic Codes Henry D. Pfister Department of Electrical and Computer Engineering Texas A&M University ECEN 604: Channel Coding for Communications
More informationData Compression Techniques
Data Compression Techniques Part 1: Entropy Coding Lecture 4: Asymmetric Numeral Systems Juha Kärkkäinen 08.11.2017 1 / 19 Asymmetric Numeral Systems Asymmetric numeral systems (ANS) is a recent entropy
More informationMathematics Sample Test Booklet Paper-Pencil Format Student Version, High School
Mathematics Sample Test Booklet 2018 Paper-Pencil Format Student Version, High School This test booklet contains several different types of problems as shown below. Each sample shows what a certain type
More informationTHE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART I MULTIPLE CHOICE (A) 0 (B) 1 (C) 2 (D) 3 (E) 4
THE 007 008 KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART I MULTIPLE CHOICE For each of the following questions, carefully blacken the appropriate box on the answer sheet with a #
More informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationNumbering Systems. Contents: Binary & Decimal. Converting From: B D, D B. Arithmetic operation on Binary.
Numbering Systems Contents: Binary & Decimal. Converting From: B D, D B. Arithmetic operation on Binary. Addition & Subtraction using Octal & Hexadecimal 2 s Complement, Subtraction Using 2 s Complement.
More informationThe Two Time Pad Encryption System
Hardware Random Number Generators This document describe the use and function of a one-time-pad style encryption system for field and educational use. You may download sheets free from www.randomserver.dyndns.org/client/random.php
More informationPURPLE COMET MATH MEET April 2012 MIDDLE SCHOOL - SOLUTIONS
PURPLE COMET MATH MEET April 2012 MIDDLE SCHOOL - SOLUTIONS Copyright c Titu Andreescu and Jonathan Kane Problem 1 Evaluate 5 4 4 3 3 2 2 1 1 0. Answer: 549 The expression equals 625 64 9 2 1 = 549. Problem
More informationNational University of Singapore Department of Electrical & Computer Engineering. Examination for
National University of Singapore Department of Electrical & Computer Engineering Examination for EE5139R Information Theory for Communication Systems (Semester I, 2014/15) November/December 2014 Time Allowed:
More informationREVIEW PROBLEMS FOR SECOND 3200 MIDTERM
REVIEW PROBLEMS FOR SECOND 3200 MIDTERM PETE L. CLARK 1)a) State Euclid s Lemma (the one involving prime numbers and divisibility). b) Use Euclid s Lemma to show that 3 1/5 and 5 1/3 are both irrational.
More informationMATH3302. Coding and Cryptography. Coding Theory
MATH3302 Coding and Cryptography Coding Theory 2010 Contents 1 Introduction to coding theory 2 1.1 Introduction.......................................... 2 1.2 Basic definitions and assumptions..............................
More informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationAnnouncements. Problem Set Four due Thursday at 7:00PM (right before the midterm).
Finite Automata Announcements Problem Set Four due Thursday at 7:PM (right before the midterm). Stop by OH with questions! Email cs3@cs.stanford.edu with questions! Review session tonight, 7PM until whenever
More informationEECS 70 Discrete Mathematics and Probability Theory Fall 2015 Walrand/Rao Final
EECS 70 Discrete Mathematics and Probability Theory Fall 2015 Walrand/Rao Final PRINT Your Name:, (last) SIGN Your Name: (first) PRINT Your Student ID: CIRCLE your exam room: 220 Hearst 230 Hearst 237
More informationCSCI 2570 Introduction to Nanocomputing
CSCI 2570 Introduction to Nanocomputing Information Theory John E Savage What is Information Theory Introduced by Claude Shannon. See Wikipedia Two foci: a) data compression and b) reliable communication
More informationReview Sheet for the Final Exam of MATH Fall 2009
Review Sheet for the Final Exam of MATH 1600 - Fall 2009 All of Chapter 1. 1. Sets and Proofs Elements and subsets of a set. The notion of implication and the way you can use it to build a proof. Logical
More information2015 Canadian Team Mathematics Contest
The CENTRE for EDUCATION in MATHEMATICS and COMPUTING cemc.uwaterloo.ca 205 Canadian Team Mathematics Contest April 205 Solutions 205 University of Waterloo 205 CTMC Solutions Page 2 Individual Problems.
More informationUniversity of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. February 9, :30 pm Duration: 1:50 hs. Closed book, no calculators
University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura February 9, 2010 11:30 pm Duration: 1:50 hs Closed book, no calculators Last name: First name: Student number: There are 5 questions and
More informationLAMC Junior Circle January 29, Olga Radko and Oleg Gleizer. A digit and a number. Place-value numerals. Properties of numbers.
LAMC Junior Circle January 29, 2012 Olga Radko and Oleg Gleizer A digit and a number. Place-value numerals. Properties of numbers. Copyright: for home use only. This handout is a part of the book in preparation.
More information1. How many six-digit multiples of 5 can be formed from the digits 1, 2, 3, 4, 5, and 6 using each of the digits exactly once?
UNIVERSITY OF NORTH CAROLINA CHARLOTTE 2000 HIGH SCHOOL MATHEMATICS CONTEST March 6, 2000 1 How many six-digit multiples of 5 can be formed from the digits 1, 2, 3, 4, 5, and 6 using each of the digits
More informationIntroduction to Combinatorial Mathematics
Introduction to Combinatorial Mathematics George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 300 George Voutsadakis (LSSU) Combinatorics April 2016 1 / 57
More informationMidterm 1. Total. CS70 Discrete Mathematics and Probability Theory, Spring :00-9:00pm, 1 March. Instructions:
CS70 Discrete Mathematics and Probability Theory, Spring 2012 Midterm 1 7:00-9:00pm, 1 March Your Name: Person on Your Left: Person on Your Right: Your Section: Instructions: (a) There are five questions
More informationAll numbered readings are from Beck and Geoghegan s The art of proof.
MATH 301. Assigned readings and homework All numbered readings are from Beck and Geoghegan s The art of proof. Reading Jan 30, Feb 1: Chapters 1.1 1.2 Feb 6, 8: Chapters 1.3 2.1 Feb 13, 15: Chapters 2.2
More informationTheory Bridge Exam Example Questions
Theory Bridge Exam Example Questions Annotated version with some (sometimes rather sketchy) answers and notes. This is a collection of sample theory bridge exam questions. This is just to get some idea
More informationC.T.Chong National University of Singapore
NUMBER THEORY AND THE DESIGN OF FAST COMPUTER ALGORITHMS C.T.Chong National University of Singapore The theory of numbers has long been considered to be among the purest of pure mathematics. Gauss ( 1777-1855)
More informationDeterministic Finite Automata (DFAs)
Algorithms & Models of Computation CS/ECE 374, Spring 29 Deterministic Finite Automata (DFAs) Lecture 3 Tuesday, January 22, 29 L A TEXed: December 27, 28 8:25 Chan, Har-Peled, Hassanieh (UIUC) CS374 Spring
More informationTC08 / 6. Hadamard codes SX
TC8 / 6. Hadamard codes 3.2.7 SX Hadamard matrices Hadamard matrices. Paley s construction of Hadamard matrices Hadamard codes. Decoding Hadamard codes A Hadamard matrix of order is a matrix of type whose
More informationNumber Systems. There are 10 kinds of people those that understand binary, those that don t, and those that expected this joke to be in base 2
Number Systems There are 10 kinds of people those that understand binary, those that don t, and those that expected this joke to be in base 2 A Closer Look at the Numbers We Use What is the difference
More informationCoding Theory. Golay Codes
Coding Theory Massoud Malek Golay Codes The Golay codes are examples of perfect codes; they were discovered by the Swiss mathematician and information theorist, Marcel J. E. Golay in 1949. A binary Golay
More information9 THEORY OF CODES. 9.0 Introduction. 9.1 Noise
9 THEORY OF CODES Chapter 9 Theory of Codes After studying this chapter you should understand what is meant by noise, error detection and correction; be able to find and use the Hamming distance for a
More informationWilson s Theorem and Fermat s Little Theorem
Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =
More informationMidterm Preparation Problems
Midterm Preparation Problems The following are practice problems for the Math 1200 Midterm Exam. Some of these may appear on the exam version for your section. To use them well, solve the problems, then
More informationExam 1. Problem 1: True or false
Exam 1 Problem 1: True or false We are told that events A and B are conditionally independent, given a third event C, and that P(B C) > 0. For each one of the following statements, decide whether the statement
More information3 Greedy Algorithms. 3.1 An activity-selection problem
3 Greedy Algorithms [BB chapter 6] with different examples or [Par chapter 2.3] with different examples or [CLR2 chapter 16] with different approach to greedy algorithms 3.1 An activity-selection problem
More informationSums of Squares. Bianca Homberg and Minna Liu
Sums of Squares Bianca Homberg and Minna Liu June 24, 2010 Abstract For our exploration topic, we researched the sums of squares. Certain properties of numbers that can be written as the sum of two squares
More informationXMA2C011, Annual Examination 2012: Worked Solutions
XMA2C011, Annual Examination 2012: Worked Solutions David R. Wilkins 1. (a) Let A, B and C be sets. Prove that A (B \ C) = (A B) \ (A C). We show that every element of A (B \ C) is an element of (A B)
More informationnumber. However, unlike , three of the digits of N are 3, 4 and 5, and N is a multiple of 6.
C1. The positive integer N has six digits in increasing order. For example, 124 689 is such a number. However, unlike 124 689, three of the digits of N are 3, 4 and 5, and N is a multiple of 6. How many
More informationSolutions to Exercises Chapter 2: On numbers and counting
Solutions to Exercises Chapter 2: On numbers and counting 1 Criticise the following proof that 1 is the largest natural number. Let n be the largest natural number, and suppose than n 1. Then n > 1, and
More informationASSIGNMENT Use mathematical induction to show that the sum of the cubes of three consecutive non-negative integers is divisible by 9.
ASSIGNMENT 1 1. Use mathematical induction to show that the sum of the cubes of three consecutive non-negative integers is divisible by 9. 2. (i) If d a and d b, prove that d (a + b). (ii) More generally,
More informationJong C. Park Computer Science Division, KAIST
Jong C. Park Computer Science Division, KAIST Today s Topics The Euclidean Algorithm The RSA Public-Key Cryptosystem Discrete Mathematics, 2008 2 Computer Science Division, KAIST Note If r = a mod b, then
More informationMCB1007 Introduction to Probability and Statistics. First Midterm. Fall Solutions
İstanbul Kültür University MCB7 Introduction to Probability and Statistics First Midterm Fall 4-5 Solutions Directions You have 9 minutes to complete the eam Please do not leave the eamination room in
More informationProof of Infinite Number of Triplet Primes. Stephen Marshall. 28 May Abstract
Proof of Infinite Number of Triplet Primes Stephen Marshall 28 May 2014 Abstract This paper presents a complete and exhaustive proof that an Infinite Number of Triplet Primes exist. The approach to this
More informationError Correction Review
Error Correction Review A single overall parity-check equation detects single errors. Hamming codes used m equations to correct one error in 2 m 1 bits. We can use nonbinary equations if we create symbols
More informationMathmatics 239 solutions to Homework for Chapter 2
Mathmatics 239 solutions to Homework for Chapter 2 Old version of 8.5 My compact disc player has space for 5 CDs; there are five trays numbered 1 through 5 into which I load the CDs. I own 100 CDs. a)
More informationDiscrete Mathematics and Probability Theory Spring 2015 Vazirani Midterm #2 Solution
CS 70 Discrete Mathematics and Probability Theory Spring 015 Vazirani Midterm # Solution PRINT your name:, (last) SIGN your name: (first) PRINT your student ID: CIRCLE your exam room: 3106 Etcheverry 3108
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More informationIntroduction to Automata
Introduction to Automata Seungjin Choi Department of Computer Science and Engineering Pohang University of Science and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjin@postech.ac.kr 1 /
More informationEE 229B ERROR CONTROL CODING Spring 2005
EE 229B ERROR CONTROL CODING Spring 2005 Solutions for Homework 1 1. Is there room? Prove or disprove : There is a (12,7) binary linear code with d min = 5. If there were a (12,7) binary linear code with
More informationMultiplying Products of Prime Powers
Problem 1: Multiplying Products of Prime Powers Each positive integer can be expressed (in a unique way, according to the Fundamental Theorem of Arithmetic) as a product of powers of the prime numbers.
More informationCoding Theory and Applications. Linear Codes. Enes Pasalic University of Primorska Koper, 2013
Coding Theory and Applications Linear Codes Enes Pasalic University of Primorska Koper, 2013 2 Contents 1 Preface 5 2 Shannon theory and coding 7 3 Coding theory 31 4 Decoding of linear codes and MacWilliams
More informationMath 58 Test # 3 Fall 2014 Chapter 9, Part 1 Instructor: Smith-Subbarao
Math 58 Test # 3 Fall 2014 Chapter 9, Part 1 Instructor: Smith-Subbarao Solutions Name Score: If you are not sure about notation, please ask for help! (4 + 1 ) / x means 4 + 1 is in numerator and x is
More informationChapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005
Chapter 7 Error Control Coding Mikael Olofsson 2005 We have seen in Chapters 4 through 6 how digital modulation can be used to control error probabilities. This gives us a digital channel that in each
More information