Math 1111 Math Exam Study Guide

Similar documents
Math 1111 Math Exam Study Guide

Chapter 5: Probability: What are the Chances? Section 5.2 Probability Rules

CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague 7 November, CS1800 Discrete Structures Midterm Version C

Solutions for the Practice Final

November 6, Chapter 8: Probability: The Mathematics of Chance

1 = 3 2 = 3 ( ) = = = 33( ) 98 = = =

Final Exam, Math 6105

Probability: introduction

Convert the Egyptian numeral to Hindu-Arabic form. 1) A) 3067 B) 3670 C) 3607 D) 367

Fundamentals of Probability

Activity 1: Play comparison games involving fractions, decimals and/or integers.

Cryptography Lecture 1: Remainders and Modular Arithmetic Spring 2014 Morgan Schreffler Office: POT 902

March 5, What is the area (in square units) of the region in the first quadrant defined by 18 x + y 20?

Honors Precalculus Chapter 9 Summary Basic Combinatorics

Chapter 1. Probability

Midterm practice super-problems

Poker Hands. Christopher Hayes

Such a description is the basis for a probability model. Here is the basic vocabulary we use.

Example Enemy agents are trying to invent a new type of cipher. They decide on the following encryption scheme: Plaintext converts to Ciphertext

{ a, b }, { a, c }, { b, c }

November 8, Chapter 8: Probability: The Mathematics of Chance

SALES AND MARKETING Department MATHEMATICS. Combinatorics and probabilities. Tutorials and exercises

MA/CSSE 473 Day 9. The algorithm (modified) N 1

Math Exam 2 Review. NOTE: For reviews of the other sections on Exam 2, refer to the first page of WIR #4 and #5.

Math Exam 2 Review. NOTE: For reviews of the other sections on Exam 2, refer to the first page of WIR #4 and #5.

1. An office building contains 27 floors and has 37 offices on each floor. How many offices are in the building?

Chapter 1. Probability

8.2 Union, Intersection, and Complement of Events; Odds

Probability. The MEnTe Program Math Enrichment through Technology. Title V East Los Angeles College

Number Theory - Divisibility Number Theory - Congruences. Number Theory. June 23, Number Theory

Define and Diagram Outcomes (Subsets) of the Sample Space (Universal Set)

Compound Probability. Set Theory. Basic Definitions

10.1 Applying the Counting Principle and Permutations (helps you count up the number of possibilities!)

Fundamental. If one event can occur m ways and another event can occur n ways, then the number of ways both events can occur is:.

4.1 Sample Spaces and Events

The congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation.

Grade 7/8 Math Circles February 25/26, Probability

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

UNIT 4 APPLICATIONS OF PROBABILITY Lesson 1: Events. Instruction. Guided Practice Example 1

The study of probability is concerned with the likelihood of events occurring. Many situations can be analyzed using a simplified model of probability

CHAPTERS 14 & 15 PROBABILITY STAT 203

7.1 Experiments, Sample Spaces, and Events

Classical vs. Empirical Probability Activity

Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014

MA 111, Topic 2: Cryptography

2. Nine points are distributed around a circle in such a way that when all ( )

Simple Probability. Arthur White. 28th September 2016

CPCS 222 Discrete Structures I Counting

Intermediate Math Circles November 1, 2017 Probability I

Math 365 Wednesday 2/20/19 Section 6.1: Basic counting

Modular Arithmetic. claserken. July 2016

Modular arithmetic Math 2320

Counting and Probability Math 2320

EECS 203 Spring 2016 Lecture 15 Page 1 of 6

Chapter 3: PROBABILITY

Advanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY

Probability. Probabilty Impossibe Unlikely Equally Likely Likely Certain

Block 1 - Sets and Basic Combinatorics. Main Topics in Block 1:

CS Project 1 Fall 2017

Contemporary Mathematics Math 1030 Sample Exam I Chapters Time Limit: 90 Minutes No Scratch Paper Calculator Allowed: Scientific

Unit 1 Day 1: Sample Spaces and Subsets. Define: Sample Space. Define: Intersection of two sets (A B) Define: Union of two sets (A B)

6) A) both; happy B) neither; not happy C) one; happy D) one; not happy

Math 166: Topics in Contemporary Mathematics II

Fall. Spring. Possible Summer Topics

Developed by Rashmi Kathuria. She can be reached at

Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand.

Probability Test Review Math 2. a. What is? b. What is? c. ( ) d. ( )

COUNTING TECHNIQUES. Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen

Mathematics Explorers Club Fall 2012 Number Theory and Cryptography

CHAPTER 9 - COUNTING PRINCIPLES AND PROBABILITY

Review. Natural Numbers: Whole Numbers: Integers: Rational Numbers: Outline Sec Comparing Rational Numbers

Distribution of Primes

Def: The intersection of A and B is the set of all elements common to both set A and set B

The point value of each problem is in the left-hand margin. You must show your work to receive any credit, except on problems 1 & 2. Work neatly.

6.1 Basics of counting

A Probability Work Sheet

4. Are events C and D independent? Verify your answer with a calculation.

Multiples and Divisibility

Outline. Content The basics of counting The pigeonhole principle Reading Chapter 5 IRIS H.-R. JIANG

Name: Exam 1. September 14, 2017

It is important that you show your work. The total value of this test is 220 points.

Discrete Structures for Computer Science

Multiple Choice Questions for Review

Sec 5.1 The Basics of Counting

6/24/14. The Poker Manipulation. The Counting Principle. MAFS.912.S-IC.1: Understand and evaluate random processes underlying statistical experiments

Numbers (8A) Young Won Lim 6/21/17

Fundamental Counting Principle

Numbers (8A) Young Won Lim 5/24/17

ECON 214 Elements of Statistics for Economists

Test 3 (Version 1) Fall 2014

MATH 1324 (Finite Mathematics or Business Math I) Lecture Notes Author / Copyright: Kevin Pinegar

CMPSCI 240: Reasoning Under Uncertainty First Midterm Exam

a) 2, 4, 8, 14, 22, b) 1, 5, 6, 10, 11, c) 3, 9, 21, 39, 63, d) 3, 0, 6, 15, 27, e) 3, 8, 13, 18, 23,

Elementary Combinatorics

Chapter 1: Sets and Probability

Probability and Counting Techniques

Chapter 2. Permutations and Combinations

MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES

Sheet 1: Introduction to prime numbers.

Transcription:

Math 1111 Math Exam Study Guide The math exam will cover the mathematical concepts and techniques we ve explored this semester. The exam will not involve any codebreaking, although some questions on the exam may draw on cryptography for context. You are encouraged to bring a calculator (scientific or graphing) to the test, but you will not be allowed to use a laptop during the test. You should be able to do each of the tasks listed below and understand the concepts associated with each task. Modular Arithmetic o Determine if two integers are congruent modulo a given integer m. o Generate a set of integers all congruent to a given integer x modulo a given integer m. o Simplify or solve a modular arithmetic equation. o Solve a system of modular arithmetic equations. o Calculate x MOD m, given integers x and m. Prime Numbers o Determine if a given number is prime. o Find the prime factorization of a given composite number. o Determine if two given numbers are relatively prime. o Find numbers that are relatively prime to a given number. Common Divisors o Find the common divisors of a set of integers (as in the Kasiski Test). o Determine the greatest common divisor of two integers using the Euclidean Algorithm. o Express the greatest common divisor of two integers as an integer multiple of one plus an integer multiple of the other. Combinatorics o Calculate the number of permutations of r objects from a set of n objects. o Determine the number of unique permutations of a sequence of letters, with or without repeated letters. o Calculate the number of combinations of r objects from a set of n objects. o Calculate the number of possibilities for a given scenario using a mix of permutations and/or combinations. Probability o Compute probabilities for experiments with equally likely outcomes. o Compute probabilities using the basic rules of probability. (See next page.) Binary Numbers o Convert a number from decimal to binary representation. o Convert a number from binary to decimal representation. o Add or subtract binary numbers. o More generally, convert from decimal representation to representation in a different base, and vice versa.

Basic Rules of Probability SUM RULE: If events A and B are mutually exclusive, then the probability of A or B occurring equals P(A) + P(B). PRODUCT RULE: If events A and B are independent, then the probability of A and B occurring is P(A) P(B). COMPLEMENT RULE: The probability of event A not occurring is 1-P(A). Practice Problems 1. Determine five integer solutions to each of the following equations. a. x 4 5 (mod 26) b. x + 23 1 (mod 4) c. 5x 1 (mod 8) d. 3x + 1 4 (mod 5) 2. Calculate the following. a. 14 MOD 3 b. 130 MOD 26 c. -1 MOD 5 d. -258 MOD 16 3. Determine the prime factorization of the following numbers. a. 961 b. 2310 c. 6517 4. Find three numbers that are relatively prime to each of the following numbers. a. 75 b. 120 c. 310 d. 512 5. Find all common divisors for each of the following sets of numbers. a. 42, 70, 126, and 154 b. 50, 125, 275, and 300 c. 52, 130, 182, and 468 6. Use the Euclidean algorithm to find the greatest common divisor of each pair of integers. That is, find gcd(a, b). a. a = 667 and b = 437 b. a = 3001 and b = 541

c. a = 77897 and b = 3721 7. For each of the following pairs a and b, find integers s and t such that as + bt = gcd(a, b). a. a = 667 and b = 437 b. a = 3001 and b = 541 c. a = 77897 and b = 3721 8. If the letters B, C, D, F, G, H, and J are written on seven index cards a. How many three-letter words can be formed? b. How many five-letter words? c. In how many ways can three of these cards be selected? d. In how many ways can five of them be selected? 9. Given a standard 52-card deck (that is, cards ranked Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, and King, in each of four different suits hearts, diamonds, clubs, and spades), determine the number of each type of hand listed below that are possible on a 5-card draw. a. Full House 3 cards of one rank, 2 cards of another rank b. Flush 5 cards of the same suit c. Straight 5 cards of consecutive ranks (ex.: 8, 9, 10, Jack, Queen) d. Three-of-a-Kind 3 cards of one rank, 2 cards of other ranks 10. Tennessee auto license plates have three letters followed by three digits. a. How many different Tennessee plates are possible? b. If two Tennessee plates are selected at random, what is the probability that they will have the same three digits? c. How many different Tennessee plates include the letters Q, X, and Z? d. What is the probability that a randomly selected Tennessee plate will include the letter D? 11. Using binary representations, calculate a + b and a b. a. a = 11 011, b = 10 101 b. a = 1 111 11, b = 101 12. Decimal representations use base 10. Binary representations use base 2. Find the decimal representation of each of the following numbers represented in base 3. a. 201 b. 111 c. 21 001

More Practice Problems 13. Find all integer solutions to the system of modular arithmetic equations: y 2x + 3 (mod 10) y 4x + 1 (mod 10) 14. Suppose a certain cipher machine has a set of five scramblers, each of which can be set in one of 26 orientations (A-Z), like the Enigma machine. Unlike the Enigma machine, these scramblers are bolted into the machine and can t be rearranged. However, each scrambler can be set to active, in which case it affects encryption, or inactive, in which case it doesn t. Thus, a key for this cipher machine consists of some subset of the five scramblers that are active, along with an orientation (A-Z) for each active scrambler. a. How many possible keys are there in which three of the scramblers are active? b. Suppose one of the scramblers is broken and stuck on the J orientation. Then how many possible keys are there in which three of the scramblers are active? (Note that the broken scrambler might be active, but it might not.) 15. Suppose the 8 letters V, I, G, E, N, E, R, and E are each written on a tile and placed in a bag. (You can imagine the game Scrabble, if that helps.) If you reach into the bag and draw five tiles at random (without replacement), what is the probability that a. You draw no Es? b. You draw exactly 1 E? c. You draw at least one E? 16. Suppose the 8 letters V, I, G, E, N, E, R, and E are each written on a tile and placed in a bag. (You can imagine the game Scrabble, if that helps.) If you reach into the bag and draw six tiles at random (without replacement), what is the probability that a. You draw all three Es? b. You draw exactly 2 Es? c. You draw no Es? 17. Suppose x is a two-digit positive integer when represented in decimal form. How many digits could x have a. When represented in binary form? b. When represented in base-3? c. When represented in hexadecimal (base-16)? 18. A certain website requires that users create passwords that have exactly 8 characters. Each character can be a lowercase letter (a-z) or a digit (0-9). A password cannot consist entirely of

letters, nor can it consist entirely of digits. How many possible passwords are there? 19. A military radio operator is intercepting communications from opposing forces. There s a 40% chance that a given intercept is encrypted. (Encrypted communications are sent by the radio operator to his unit s codebreaking division; unencrypted ones aren t interesting and are discarded.) If the radio operator gets to take a break after he intercepts four encrypted communications, what is the probability that he will get to take a break immediately after the eighth intercept he makes during his shift?