Euler Enrichment Stage

Similar documents
Homework until Test #2

Grade 7/8 Math Circles Fall 2012 Factors and Primes

Session 6 Number Theory

= = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Chapter 11 Number Theory


Just the Factors, Ma am

CONTENTS. Please note:

Cubes and Cube Roots

Chapter 3. if 2 a i then location: = i. Page 40

Factoring Whole Numbers

ALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite

8 Primes and Modular Arithmetic

Grade 7 & 8 Math Circles October 19, 2011 Prime Numbers

Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may

Category 3 Number Theory Meet #1, October, 2000

Working with whole numbers

Grade 6 Math Circles March 10/11, 2015 Prime Time Solutions

SQUARE-SQUARE ROOT AND CUBE-CUBE ROOT

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

MACM 101 Discrete Mathematics I

Previously, you learned the names of the parts of a multiplication problem. 1. a. 6 2 = 12 6 and 2 are the. b. 12 is the

Prime Factorization 0.1. Overcoming Math Anxiety

CISC - Curriculum & Instruction Steering Committee. California County Superintendents Educational Services Association

5544 = = = Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1

Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter 4 described a mathematical system

FACTORS, PRIME NUMBERS, H.C.F. AND L.C.M.

Recall the process used for adding decimal numbers. 1. Place the numbers to be added in vertical format, aligning the decimal points.

k, then n = p2α 1 1 pα k

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University

Some practice problems for midterm 2

SOLUTIONS FOR PROBLEM SET 2

Applications of Fermat s Little Theorem and Congruences

Today s Topics. Primes & Greatest Common Divisors

Solve addition and subtraction word problems, and add and subtract within 10, e.g., by using objects or drawings to represent the problem.

MATH10040 Chapter 2: Prime and relatively prime numbers

SECTION 10-2 Mathematical Induction

Notes on Factoring. MA 206 Kurt Bryan

Primes. Name Period Number Theory

1. When the least common multiple of 8 and 20 is multiplied by the greatest common factor of 8 and 20, what is the result?

Pigeonhole Principle Solutions

Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

MATHEMATICS. Y5 Multiplication and Division 5330 Square numbers, prime numbers, factors and multiples. Equipment. MathSphere

Continued Fractions and the Euclidean Algorithm

Factoring Algorithms

15 Prime and Composite Numbers

4. How many integers between 2004 and 4002 are perfect squares?

3.1. RATIONAL EXPRESSIONS

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, Notes on Algebra

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

The Euclidean Algorithm

Grade 6 Math Circles. Binary and Beyond

Integer Factorization using the Quadratic Sieve

Calculate Highest Common Factors(HCFs) & Least Common Multiples(LCMs) NA1

CS 103X: Discrete Structures Homework Assignment 3 Solutions

of Nebraska - Lincoln

SUM OF TWO SQUARES JAHNAVI BHASKAR

We can express this in decimal notation (in contrast to the underline notation we have been using) as follows: b + 90c = c + 10b

Math 319 Problem Set #3 Solution 21 February 2002

The application of prime numbers to RSA encryption

Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)

APPLICATIONS AND MODELING WITH QUADRATIC EQUATIONS

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

Primes in Sequences. Lee 1. By: Jae Young Lee. Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov

s = s = s =

MATHCOUNTS TOOLBOX Facts, Formulas and Tricks

POLYNOMIAL FUNCTIONS

Teaching & Learning Plans. Arithmetic Sequences. Leaving Certificate Syllabus

Lecture 13 - Basic Number Theory.

Sample Problems. Practice Problems

6.4 Special Factoring Rules

4/1/2017. PS. Sequences and Series FROM 9.2 AND 9.3 IN THE BOOK AS WELL AS FROM OTHER SOURCES. TODAY IS NATIONAL MANATEE APPRECIATION DAY

Not for resale. 4.1 Divisibility of Natural Numbers 4.2 Tests for Divisibility 4.3 Greatest Common Divisors and Least Common Multiples

Playing with Numbers

MATH 13150: Freshman Seminar Unit 10

Continued Fractions. Darren C. Collins

4.5 Finite Mathematical Systems

Polynomials and Factoring

The last three chapters introduced three major proof techniques: direct,

Patterns in Pascal s Triangle

Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Solution to Exercise 2.2. Both m and n are divisible by d, som = dk and n = dk. Thus m ± n = dk ± dk = d(k ± k ),som + n and m n are divisible by d.

FACTORS AND MULTIPLES Answer Key

CS 3719 (Theory of Computation and Algorithms) Lecture 4

IB Maths SL Sequence and Series Practice Problems Mr. W Name

Multiplication. Year 1 multiply with concrete objects, arrays and pictorial representations

CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

A Prime Investigation with 7, 11, and 13

Greatest Common Factors and Least Common Multiples with Venn Diagrams

10/14/08 ON NUMBERS EQUAL TO THE SUM OF TWO SQUARES IN MORE THAN ONE WAY

A Study on the Necessary Conditions for Odd Perfect Numbers

How To Understand And Solve Algebraic Equations

PROPERTIES OF ELLIPTIC CURVES AND THEIR USE IN FACTORING LARGE NUMBERS

Basic numerical skills: EQUATIONS AND HOW TO SOLVE THEM. x + 5 = = (2-2) = = 5. x = 7-5. x + 0 = 20.

ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

Systems of Linear Equations

IB Math Research Problem

26 Integers: Multiplication, Division, and Order

Transcription:

Euler Enrichment Stage Table of Contents Chapter 1 Problems I Like Michael Evans 1 Chapter 2 Primes and Composites 3 Chapter 3 Least Common Multiple 8 Chapter 4 Highest Common Factor and the Euclidean Algorithm 11 Chapter 5 Arithmetic Sequences 16 Chapter 6 Figurate Numbers 21 Chapter 7 Congruences 26 Chapter 8 Problems I Like Sharing - Alice Thomas 31 Chapter 9 Find That Angle 34 Chapter 10 Counting Techniques 51 Chapter 11 The Pigeon-Hole Principle 58 Chapter 12 Problems I Enjoy Sharing - Bruce Henry 62 Solutions 64

Chapter 1 Problems I Like Michael Evans 1 In magic squares, the sum of the numbers in each row, each column and each diagonal is constant Find A, B, C, D, E in the following magic square 15 A 35 50 B C 25 D E 2 (a) What two whole numbers, neither ending in zero, when multiplied together equal exactly 1 000 000 000? (b) Repeat for 1 000 000 000 000 000 000 3 Find three consecutive numbers such that the sum of the first and third is 18 4 A palindromic number is a number which remains the same when the digits are reversed For example, 14941 is a palindromic number What is the next largest palindromic number? 5 What two-digit number is twice the product of its digits? 6 Find the values of the letters, each of which stands for a particular but different digit + + F O R T Y T E N T E N S I X T Y 7 By replacing the asterisks with a selection of the four operational symbols (+,,, ), complete this equation to make a true statement: 6 6 6 6=13 8 A prime number is an integer greater than 1 whose only divisors are itself and 1 1993 is a prime What is the next year that is a prime? 1

9 What is the largest three-digit prime each of whose digits is a prime? 10 A perfect number equals the sum of its factors, excluding the number itself Since 6 = 1 + 2 + 3, 6 is a perfect number Find another 11 Divide the face of the clock into 3 parts with 2 straight lines so that the sums of the numbers in the 3 parts are equal 10 11 12 1 2 9 3 8 7 6 5 4 12 A total of 642 digits was used in numbering the pages of a book How many pages did the book contain? 13 In the cells shown, place a ten-digit number such that the digit in the first cell indicates the total number of 0s in the entire number, the digit in cell 1 indicates the number of 1s in the number and so on, to the last cell 0 1 2 3 4 5 6 7 8 9 Now try Problem 1 in the Euler Student Problems Book 2

Chapter 2 Primes and Composites A code is devised by Secret Sam Sam has decided that he will denote A by the smallest number with 1 factor, B the smallest number with 2 factors and so on He sets out his code as shown in the table (a) (b) A 1 B 2 C 4 D 6 E 16 Z 12288 Complete the table for the code Secret Sam decides that he would like to punctuate his code properly and use some mathematical symbols For example he denotes = with the smallest number with 39 factors What is this number? Factors and Primes The factors of 6 are: 1, 2, 3 and 6 The factors of 28 are: 1, 2, 4, 7, 14 and 28 The factors of 7 are: 1 and 7 A natural number, a, isafactor of a natural number, b, ifthereexistsa natural number, k, such that: b = ak If a number greater than 1 has only factors 1 and itself it is said to be a prime Among the first 100 numbers, the following 25 are prime: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 To consider whether a number, n, isprimeonemethodistoconsiderall the numbers less than n and test if they are factors of n For example, if n = 97, 9 < n<10 Therefore, we could test the numbers: 2, 3, 4, 5, 6, 7, 8 and 9 However, we do not need to test numbers which are not prime, so we only need to test 2, 3, 5 and 7 3

It is found that none of these numbers is a factor of 97 We have found 97 to be prime There are infinitely many primes Composites Anumber,m, is called a composite number if it can be written as a product: m = a b where a and b are numbers greater than 1 and less than m For example, 72 = 8 9=2 3 3 2 77 = 7 11 1190 = 34 35 = 17 2 5 7 2000 = 16 125 = 2 4 5 3 This method of expressing a composite number in terms of its prime numbers is called prime decomposition For each number there is a unique prime decomposition One method of determining the prime decomposition is the following The process is repeated division Consider the number 24192 Therefore 24192 = 2 7 3 3 7 2 24192 2 12096 2 6048 2 3024 2 1512 2 756 2 378 3 189 3 63 3 21 7 7 1 The number of factors of a number can be determined through the prime decomposition of that number They can be systematically listed as shown: 4

2 0 2 1 2 2 2 3 2 4 2 5 2 6 2 7 3 0 7 0 3 0 7 0 3 0 7 0 3 0 7 0 3 0 7 0 3 0 7 1 3 0 7 1 3 0 7 1 3 0 7 1 3 0 7 1 3 1 7 0 3 1 7 0 3 1 7 0 3 1 7 0 3 1 7 0 3 1 7 1 3 1 7 1 3 1 7 1 3 1 7 1 3 1 7 1 3 2 7 0 3 2 7 0 3 2 7 0 3 2 7 0 3 2 7 0 3 2 7 1 3 2 7 1 3 2 7 1 3 2 7 1 3 2 7 1 3 3 7 0 3 3 7 0 3 3 7 0 3 3 7 0 3 3 7 0 3 3 7 1 3 3 7 1 3 3 7 1 3 3 7 1 3 3 7 1 This covers all combinations Thus there are 8 4 2 = 64 factors of 24192 Alternatively, we note that the prime decomposition of 24192 is 2 7 3 3 7 and that 2 7 has 8 factors, 3 3 has4factorsand7 1 has 2 factors Hence 24192 has 8 4 2 factors This is investigated further in the Exercises of this chapter Exercises 1 Give the prime decomposition of 362880 2 Give the prime decomposition of 135135 3 (a) State the factors of 16 = 2 4 (note: include 1 and 16) (b) How many factors are there of 16? (c) State the factors of 256 = 2 8 (d) How many factors are there of 256? (e) State the number of factors of 2 n? 4 (a) State the factors of 125 = 5 3 (b) How many factors are there of 5 n? 5 (a) Give the prime decomposition of 128000 (b) Howmanyfactorsdoesthisnumberhave? 6 A number has a prime decomposition of 2 3 3 4 5 3 7 2 How many factors does this number have? 7 Two and three differ by one and are both prime numbers What is the next such pair? 8 Find a prime number which is one less than a perfect square Is there another such number? 5