Intermediate Math Circles Number Theory II Problems and Solutions

Similar documents
Number Theory. Number Theory. 6.1 Number Theory

The numbers 1, 2, 3, are called the counting numbers or natural numbers. The study of the properties of counting numbers is called number theory.

Math 110 FOUNDATIONS OF THE REAL NUMBER SYSTEM FOR ELEMENTARY AND MIDDLE SCHOOL TEACHERS

Introduction to Number Theory

A number that can be written as, where p and q are integers and q Number.

Exam 2 Review Chapters 4-5

Integers and Division

not to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results

Intermediate Math Circles February 29, 2012 Linear Diophantine Equations I

Number Theory and Divisibility

Math Ed 305 Defining Common Divisors and Multiples. 1. From a partitive perspective, to say that X is a divisor of Y is to say that:

Proofs. Methods of Proof Divisibility Floor and Ceiling Contradiction & Contrapositive Euclidean Algorithm. Reading (Epp s textbook)

Direct Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24

Chapter 2. Divisibility. 2.1 Common Divisors

REAL NUMBERS. Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b.

The set of integers will be denoted by Z = {, -3, -2, -1, 0, 1, 2, 3, 4, }

3 The fundamentals: Algorithms, the integers, and matrices

Exercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.

Ch 4.2 Divisibility Properties

INTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.

EDULABZ INTERNATIONAL NUMBER SYSTEM

4 Number Theory and Cryptography

Math.3336: Discrete Mathematics. Primes and Greatest Common Divisors

SEVENTH EDITION and EXPANDED SEVENTH EDITION

Quantitative Aptitude

Downloaded from

Applied Cryptography and Computer Security CSE 664 Spring 2017

Discrete Structures Lecture Primes and Greatest Common Divisor

Math 131 notes. Jason Riedy. 6 October, Linear Diophantine equations : Likely delayed 6

CHAPTER 1 REAL NUMBERS KEY POINTS

2 Elementary number theory

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

Intermediate Math Circles February 26, 2014 Diophantine Equations I

More Polynomial Equations Section 6.4

Intermediate Math Circles March 7, 2012 Problem Set: Linear Diophantine Equations II Solutions

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

cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska

Divisibility, Factors, and Multiples

Lecture 7.4: Divisibility and factorization

Notes on Systems of Linear Congruences

NOTES ON SIMPLE NUMBER THEORY

4 Powers of an Element; Cyclic Groups

Math Circles - Lesson 2 Linear Diophantine Equations cont.

MATH 145 Algebra, Solutions to Assignment 4

Chapter 3: The Euclidean Algorithm and Diophantine. Math 138 Burger California State University, Fresno

Introduction to Sets and Logic (MATH 1190)


Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006

Lecture 7: Number Theory Steven Skiena. skiena

Do not open this exam until you are told to begin. You will have 75 minutes for the exam.

KNOWLEDGE OF NUMBER SENSE, CONCEPTS, AND OPERATIONS

Homework #2 solutions Due: June 15, 2012

Chapter 5. Number Theory. 5.1 Base b representations

Number Theory 1. A unit is that by virtue of which each of the things that exist is called one. 1 A number is a multitude composed of units.

USA Mathematical Talent Search Round 3 Solutions Year 20 Academic Year

Slide 1 / 69. Slide 2 / 69. Slide 3 / 69. Whole Numbers. Table of Contents. Prime and Composite Numbers

A group of figures, representing a number, is called a numeral. Numbers are divided into the following types.

CISC-102 Fall 2017 Week 6

Grade 7/8 Math Circles. Continued Fractions

COMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635

PRACTICE PROBLEMS: SET 1

Real Number. Euclid s division algorithm is based on the above lemma.

CONTENTS. iii v viii FOREWORD PREFACE STUDENTS EVALUATION IN MATHEMATICS AT SECONDARY STAGE

Four Basic Sets. Divisors

Numbers and Operations Review

and LCM (a, b, c) LCM ( a, b) LCM ( b, c) LCM ( a, c)

Objective Type Questions

Kansas City Area Teachers of Mathematics 2014 KCATM Math Competition. Numbers and Operations GRADE 5 NO CALCULATOR

Mathematics Challenge 2014

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

LP03 Chapter 5. A prime number is a natural number greater that 1 that has only itself and 1 as factors. 2, 3, 5, 7, 11, 13, 17, 19, 23, 29,

CISC-102 Winter 2016 Lecture 11 Greatest Common Divisor

The CENTRE for EDUCATION in MATHEMATICS and COMPUTING cemc.uwaterloo.ca Fryer Contest. Wednesday, April 12, 2017

Lesson 1: Natural numbers

5: The Integers (An introduction to Number Theory)

Number Sense. Basic Ideas, Shortcuts and Problems #1-20 from the Sequence Chart

The Euclidean Algorithm and Multiplicative Inverses

Maths Scheme of Work. Class: Year 10. Term: autumn 1: 32 lessons (24 hours) Number of lessons

1. Revision Description Reflect and Review Teasers Answers Recall of Rational Numbers:

The Euclidean Algorithm

then the hard copy will not be correct whenever your instructor modifies the assignments.

Writing Assignment 2 Student Sample Questions

Chapter 1 A Survey of Divisibility 14

Finding a Percent of a Number (page 216)

Multiplying and dividing integers Student Activity Sheet 2; use with Exploring Patterns of multiplying and dividing integers

The following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers:

MATHEMATICS X l Let x = p q be a rational number, such l If p, q, r are any three positive integers, then, l that the prime factorisation of q is of t

Solutions Math 308 Homework 9 11/20/2018. Throughout, let a, b, and c be non-zero integers.

Course: CS1050c (Fall '03) Homework2 Solutions Instructor: Prasad Tetali TAs: Kim, Woo Young: Deeparnab Chakrabarty:

Groups in Cryptography. Çetin Kaya Koç Winter / 13

EUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972)

GED Prep Live: Number Sense & Basic Algebra

Math Contest, Fall 2017 BC EXAM , z =

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION

N= {1,2,3,4,5,6,7,8,9,10,11,...}

Grade 7 & 8 Math Circles November 23, 2011 Jeopardy

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

5.1. Primes, Composites, and Tests for Divisibility

INTRODUCTION TO FRACTIONS

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.

Transcription:

WWW.CEMC.UWATERLOO.CA The CENTRE for EDUCATION in MATHEMATICS and COMPUTING Intermediate Math Circles Number Theory II Problems and Solutions 1. The difference between the gcd and lcm of the numbers 10, 15, 35 is (a 60 (b 205 (c 25 (d 1044 (e 5245 Method #1 To find the gcd(10, 15, 35. Divisors of 10 : 1, 2, 5, 10 Divisors of 15 : 1, 3, 5, 5, 15 Divisors of 35 : 1, 5, 7, 35 Thus, gcd(10, 15, 35 5. To find the lcm(10, 15, 35. Multiples of 10 : 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120, 130, 140, 150, 160, 170, 180, 190, 200, 210 Multiples of 15 : 15, 30, 45, 60, 75, 90, 105, 120, 135, 150, 165, 180, 195, 210, Multiples of 35 : 35, 70, 105, 140, 175, 210, Thus, lcm(10, 15, 35 210. The difference of the gcd and lcm is 210 5 205 Answer is (b Method #2 The Prime Factorization of 10 is 2 5. The Prime Factorization of 15 is 3 5. The Prime Factorization of 35 is 5 7. The gcd(10, 15, 35 5 and the lcm(10, 15, 35 2 3 5 7 210. The difference of the gcd and lcm is 210 5 205 Answer is (b 2. Two speed skaters begin practice at the same start line. The first speed skater completes one lap of the oval every 45 seconds. The second speed skater completes one lap of the oval every 63 seconds. After the start, how much time will elapse until the speed skaters are at the start line together again? (a 47 1 4 min (b 9 9 20 min (c 51 4 min (d 2 1 10 min (e 153 4 min The speed skaters are at the start line together again at the lcm(45, 63.

The Prime Factorization of 45 is 3 2 5. The Prime Factorization of 63 is 3 2 7. The lcm(45, 63 3 2 5 7 315 seconds or 5 1 4 minutes. 3. When a positive integer is divided by 7, the quotient is 4 and the remainder is 6. Determine the value of this number. Using the division algorithm, we known that a number n can be calculated using the formula n dq + r 7(4 + 6 34. 4. An uptown bus leaves the terminal every 70 minutes and a downtown bus leaves the same terminal every 42 minutes. If the uptown and downtown busses both leave the terminal at 9:00am, when will they be at the terminal together again? The busses will both be at the terminal at the lcm(70, 42. The Prime Factorization of 70 is 2 5 7. The Prime Factorization of 42 is 2 3 7. The lcm(45, 63 2 3 5 7 210 minutes or 3 1 2 hours later. Therefore, the uptown and downtown busses will be at the terminal at the same time at 12:30pm. 5. Erin s age when divided by 2, 3, 4, 5 or 6 gives a remainder of 1. Determine the youngest possible age that Erin could be, if she is older than 1. If n is a positive integer that is divisible by 2, 3, 4, 5 or 6, then the value of n + 1 will leave a remainder of 1 when divided by 2, 3, 4, 5 or 6. The lcm(2, 3, 4, 5, 6 2 2 3 5 60. Therefore, 60 is the smallest value divisible by 2, 3, 4, 5 or 6. Thus, 61 is the smallest positive integer greater than 1 that will give a remainder of 1 when divided by 2, 3, 4, 5 or 6. 6. When y is divided by 2x 4 the quotient is 3x and the remainder is 9. Determine the simplified expression of y. Using the division algorithm, we know that y (2x 4(3x + 9 6x 2 12x + 9. 7. Determine the smallest positive integer that is divisible by both 24 and 30. The smallest positive integer that is divisible by both 24 and 30 is the lcm(24, 30. The Prime Factorization of 24 is 2 3 3. The Prime Factorization of 30 is 2 3 5. The lcm(24, 30 2 3 3 5 120.

8. Determine the smallest value of k that makes the product 48k divisible by 36. The Prime Factorization of 48 is 2 4 3. The Prime Factorization of 36 is 2 2 3 2. The lcm(48, 36 2 4 3 2 144. Therefore, k 144 48 3. 9. The student s council of your school will be selling hot dogs at the Winter Fair. Hot dogs are sold in packages of 12, but hot dog buns are sold in packages of 8. If the student s council predicts that they will need at least 150 hot dogs for the Fair, how many packages of hot dogs and buns should they buy, if every hot dog must be paired with a bun? The lcm(12, 8 24. Any multiple of 24 will match one hot dog with one bun. Since 150 24 6.25, the smallest multiple of 24 that is bigger than 150 is 24 7 168. Therefore, the number of packages of hot dogs 2 7 14 and the number of packages of buns 3 7 21. 10. A florist has 648 roses, 288 orchids and 432 tulips to create identical bouquets. What is the largest number of identical bouquets that can be created without having any flowers left over? How many flowers of each type will be in one bouquet? The largest number of identical bouquets is equal to the gcd(648, 288, 432. The Prime Factorization of 648 is 2 3 3 4. The Prime Factorization of 288 is 2 5 3 2. The Prime Factorization of 432 is 2 4 3 3. The gcd(648, 288, 432 2 3 3 2 72 Therefore, the florist can make at most 72 identical bouquets. Each bouquet will have 648 72 9 roses, 288 72 11. Determine the gcd(a, b and lcm(a, b for the pairs, (a (10!, 6 8 (b (130 339, 9061 (a (10!, 6 8 The Prime Factorization of 10! is 2 8 3 4 5 2 7. The Prime Factorization of 6 8 is 2 8 3 8. The gcd(10!, 6 8 2 8 3 4 20 736 and the lcm(10!, 6 8 2 8 3 8 5 2 7 293 932 800 4 orchids and 432 72 6 tulips.

(b (130 339, 9061 gcd(130 399, 9061 103 399 14(9061 + 3485, gcd(9061, 3485 9061 2(3485 + 2091, gcd(3485, 2091 3485 1(2091 + 1394, gcd(2091, 1394 2091 1(1394 + 697, gcd(1394, 697 Since 2(697 1394, gcd(1394, 697 697 Therefore, gcd(130339, 9061 697. (130 339(9061 lcm(130 339, 9061 gcd(130 339, 9061 (130 339(9061 697 1 694 407 12. Determine the largest value of k for 360x 540y k(ax by such that a, b, and k are positive integers. The largest value of k gcd(360, 540 The Prime Factorization of 360 is 2 3 3 2 5. The Prime Factorization of 540 is 2 2 3 3 5. The gcd(360, 540 2 2 3 2 5 180. Therefore, the largest value of k 180 since 360x 540y 180(2x 3y. 13. Determine the exact value of 12 2431 + 9 1309. To add fractions, their denominators must be common. The common denominator lcm(2431, 1309 The Prime Factorization of 2431 is 11 13 17. The Prime Factorization of 1309 is 7 11 17. The lcm(2431, 1309

12 2431 + 9 1309 12 11 13 17 + 9 7 11 17 7 ( 12 + 13 ( 9 7 11 13 17 13 7 11 17 7( 12 + 13(9 7( 12 + 13(9 33 3 11 ( 11 3 11 7 13 17 3 7 13 17 3 1547