FIFTEENTH ANNUAL NORTH CENTRAL SECTION MAA TEAM CONTEST
|
|
- Jeffrey Garrett
- 5 years ago
- Views:
Transcription
1 FIFTEENTH NNUL NORTH ENTRL SETION M TEM ONTEST November 2, 20, 9:00 am to 2:00 noon NO OOKS, NOTES, LULTORS, OMPUTERS OR NON-TEM- MEMERS may be consulted No cell phones or other communication devices PLESE EGIN EH PROLEM ON NEW SHEET OF PPER Team identification and problem number should be given at the top of each sheet of paper submitted Each problem counts 0 points Partial credit for significant but incomplete work For full credit, answers must be fully justified ut in some cases this may simply mean showing all work and reasoning Have fun! Units digit of S 20 * * * * * Let S n be the sum of the squares of the first n positive odd integers Find, with proof, the units digit (in base 0) of S 20 2 rea of a square t the left are two copies of the same isosceles right triangle, each with an inscribed square If the first (leftmost) inscribed square has area S, what is the area of the other inscribed square? Justify your answer 3 Speshul integers positive integer k is called speshul if there exist positive integers m and n such that Find all speshul positive integers 4 Divisor and remainder mn + m + n = k Determine all pairs (d, r) of positive integers with the property that when each of the numbers 904, 259 and 2040 is divided by d, the same remainder r (with 0 <r<d) occurs page of 2
2 NS/M TEM ONTEST 20, page 2 of 2 5 igger than 20 2? Determine whether there exist non-negative numbers x and y such that x + y = 20 and x 2 + y> From to 20 The positive integer n can be replaced by ab, if a and b are positive integers with a + b = n Is it possible starting from to obtain 20 in a finite sequence of such replacements? 7 Not a perfect square For each positive integer n, let a n = (n + 9) 2 +2n + 99 (s usual, x denotes the greatest integer less than or equal to x) Show that a n is never the square of an integer 8 P () = 20 The coefficients a j in the polynomial P (x) =a 0 + a x + + a n x n are integers satisfying 0 a j 0 and a n > 0 If P () = 2 and P () = 20, determine, with proof, the value of P (6) 9 Fractional part of n Let n be a positive integer which is not a perfect square Let x n be the fractional part of n; ie, xn = n n, where u denotes as usual the greatest integer less than or equal to u Prove that x n + 2n < 0 Numerator divisible by 20 Let p and q be positive integers such that = p q Given that 20 is prime, show that p is divisible by 20
3 Solutions, 20 NS/M TEM OMPETITION, page of 4 Each problem number is followed by an -tuple (a 0,a 9,a 8,a 7,a 6,a 5,a 4,a 3,a 2,a,a 0 ), where a k is the number of teams that scored k points on the problem Units digit of S 20 (28,,,0,,0,9,2,5,5,24) The units digit of S 20 is We show this by observing that S = has units digit, and that S n+0 always has the same units digit as does S n Modulo 0, the sequence of squares of positive odd integers begins (,9,5,9,), after which this cycle repeats itself, because (n +0) 2 = n 2 +20n +00 n 2 (mod 0) Then modulo 0, S n+0 S n will always be the sum of 0 consecutive terms in this sequence, which will be , wherever in the sequence one begins Thus S n+0 S n (mod 0) 2 rea of a square (60,3,0,2,0,2,,0,,0,7) 8 The area is S The legs of the right triangle have length 9 2 S,sothehypotenuseis2 2S Thenthesecondinscribed square has side 2 2S, because the smaller triangles at and 3 are also isosceles right triangles Thus the area of the second inscribed square is 2 2 2S 3 = 8S 9 3 Speshul integers (3,0,0,2,0,0,4,7,2,0,30) Well, of course, every positive integer is speshul Here are two different ways to get the m and n we need () To make mn +=km + kn, startbytakingm = k + Thenwewantkn + n += km+ kn; ie,n + = km, son = km doesit Thus: m = k +, n = km =k 2 + k (2) Take m =2k, n =2k + Then mn + m + n = 4k2 4k = k 4 Divisor and remainder (20,0,2,,,,2,0,0,9,40) The unique such pair is (d, r) =(7, 52) From904=ad+r, 259=bd+r and 2040 = cd+r we obtain on subtraction, 355 = (b a)d and 78 = (c b)d Now, 78 = (2)(355) + 7, and both 78 and 355 are multiples of d, so7isamultipleof d ut7isprime,sod can only be 7 (the condition 0 <r<drequires d>), and then 904 = (2)(7) + 52 shows that r must be 52 One checks that 259 = (7)(7) + 52 and 2040 = (28)(7) + 52, so (d, r) =(7, 52) is the unique solution
4 Solutions, 20 NS Team ompetition, page 2 of 4 5 igger than 20 2? (8,0,,0,2,0,2,4,5,6,38) Such numbers do exist Let f(x) =x x for 0 x 20 It suffices to show that there exists x [0, 20] with f(x) > 20 2 We note that f(20) = 20 2,so it suffices to show that f (x) is negative throughout an interval (20, 20) for some > 0 Well, f (x) = 2x /(2 20 x), and for 0 x 20, 2x < 4022 ut /(2 20 x) > 4022 when / 20 x>8044; ie, when 20 x</ Thus, when <x<20, f (x) < 0, so f(x) decreases in this interval to the value 20 2 at x =20,andhence f(x) > 20 2 throughout this interval 6 From to 20 (38,,,,0,0,,2,0,0,32) Yes, it can be done in many ways (infinitely many, in fact) key observation is that with any n>, n =(n ) + can be replaced by (n ) =n, so if we obtain any integer larger than 20, we can step down from there to 20 in steps of Thus, one solution is = = = = , etc, down to 20 7 Not a perfect square (,0,0,0,0,,0,2,2,,59) We show that (n +5) 2 <a n < (n +6) 2 for all n, and the claim follows Using the facts that 4 < 9 < 5and9< 99 < 0 we have a n = n n +9+2n + 99 n 2 +2n +29 = (n +6) 2 7 < (n +6) 2, and a n n 2 +0n +28 = (n +5) 2 +3 > (n +5) 2
5 8 P () = 20 (35,,6,0,,0,0,0,0,0,33) Solutions, 20 NS Team ompetition, page 3 of 4 We show that P (6) = 44 From the fact that 20 = P () a n n n we know that n 3because 3 =33< 20 < 4 lso, 20 < 2 3,soa 3, and thus if n =3 then a 3 = Weshowthatn =3 Ifn 2, then P (x) =a 0 + a x + a 2 x x +0x 2, and 20 = P () < 20, a contradiction Thus n =3,a 3 =,and P (x) =a 0 + a x + a 2 x 2 + x 3 Then 20 = P () = a 0 + a + a ,whence a 0 + a + a 2 2 =20 33 = 680 ecause 0 a 0 + a = 20, we have 680 a = 560, and therefore 6 > 680/2 a 2 560/2 > 4 Hence a 2 =5,and 20 = a 0 + a = a 0 +a +936, so a 0 +a =75 Theconstraintsona 0 and a then determine that a =6anda 0 =9 Thus P (x) =9+6x +5x 2 + x 3 Note that this also satisfies P () = 2 (which was given but not used for the solution) Finally, then, P (6) = = 44 9 Fractional part of n (8,0,2,0,0,0,0,0,0,0,66) Let r be the integer such that r < n<rifr =2,thenn =2or3andonecaneasily verify directly that the required inequality holds So we assume that r 3, in which case (r ) 2 r, andhencen>rletk = r 2 n Thenk>0sok, and we have x n = n n = n (r ), and then qed x n + 2n = n r ++ 2n = r 2 k r ++ 2n r 2 r ++ 2n r 2 r ++ 2r = r r 2 2r = r + r 2 <, 2r
6 0 Numerator divisible by 20 (3,,0,0,0,0,0,0,0,0,72) We rewrite p q = = Solutions, 20 NS Team ompetition, page 4 of = , Now group these terms in pairs as follows: p q = = 67 =20 =20 r s, for some integers r and s, whereallprimefactorsofs are smaller than 20 We now have 20rq = ps, 20isprime,and20doesnotdivides Therefore20 p, qed
PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationNORTHWESTERN UNIVERSITY Thrusday, Oct 6th, 2011 ANSWERS FALL 2011 NU PUTNAM SELECTION TEST
Problem A1. Let a 1, a 2,..., a n be n not necessarily distinct integers. exist a subset of these numbers whose sum is divisible by n. Prove that there - Answer: Consider the numbers s 1 = a 1, s 2 = a
More informationSOLUTIONS, what is the value of f(4)?
005 Georgia Tech High School Mathematics Competition Junior-Varsity Multiple-Choice Examination Version A Problem : If f(x) = x4 x +x x SOLUTIONS, what is the value of f(4)? (A) 6 (B) 70 (C) 78 (D) 8 (E)
More information27 th Annual ARML Scrimmage
27 th Annual ARML Scrimmage Featuring: Howard County ARML Team (host) Baltimore County ARML Team ARML Team Alumni Citizens By Raymond Cheong May 23, 2012 Reservoir HS Individual Round (10 min. per pair
More informationSolutions, 2004 NCS/MAA TEAM COMPETITION
Solutions, 004 NCS/MAA TEAM COMPETITION Each problem number is followed by an 11-tuple (a 10, a 9, a 8, a 7, a 6, a 5, a 4, a 3, a, a 1, a 0 ), where a k is the number of teams that scored k points on
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationChapter 3 Basic Number Theory
Chapter 3 Basic Number Theory What is Number Theory? Well... What is Number Theory? Well... Number Theory The study of the natural numbers (Z + ), especially the relationship between different sorts of
More informationDefinition For a set F, a polynomial over F with variable x is of the form
*6. Polynomials Definition For a set F, a polynomial over F with variable x is of the form a n x n + a n 1 x n 1 + a n 2 x n 2 +... + a 1 x + a 0, where a n, a n 1,..., a 1, a 0 F. The a i, 0 i n are the
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationMADHAVA MATHEMATICS COMPETITION, December 2015 Solutions and Scheme of Marking
MADHAVA MATHEMATICS COMPETITION, December 05 Solutions and Scheme of Marking NB: Part I carries 0 marks, Part II carries 30 marks and Part III carries 50 marks Part I NB Each question in Part I carries
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationCMSC Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005
CMSC-37110 Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade. 1. (6 points) Let a
More informationBaltic Way 2008 Gdańsk, November 8, 2008
Baltic Way 008 Gdańsk, November 8, 008 Problems and solutions Problem 1. Determine all polynomials p(x) with real coefficients such that p((x + 1) ) = (p(x) + 1) and p(0) = 0. Answer: p(x) = x. Solution:
More information2018 LEHIGH UNIVERSITY HIGH SCHOOL MATH CONTEST
08 LEHIGH UNIVERSITY HIGH SCHOOL MATH CONTEST. A right triangle has hypotenuse 9 and one leg. What is the length of the other leg?. Don is /3 of the way through his run. After running another / mile, he
More informationMinnesota State High School Mathematics League
011-1 Meet 1, Individual Event Question #1 is intended to be a quickie and is worth 1 point. Each of the next three questions is worth points. Place your answer to each question on the line provided. You
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
More informationMATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology.
MATH 501 Discrete Mathematics Lecture 6: Number theory Prof. Dr. Slim Abdennadher, slim.abdennadher@guc.edu.eg German University Cairo, Department of Media Engineering and Technology 1 Number theory Number
More informationMath Contest, Fall 2017 BC EXAM , z =
Math Contest, Fall 017 BC EXAM 1. List x, y, z in order from smallest to largest fraction: x = 111110 111111, y = 1 3, z = 333331 333334 Consider 1 x = 1 111111, 1 y = thus 1 x > 1 z > 1 y, and so x
More informationEGMO 2016, Day 1 Solutions. Problem 1. Let n be an odd positive integer, and let x1, x2,..., xn be non-negative real numbers.
EGMO 2016, Day 1 Solutions Problem 1. Let n be an odd positive integer, and let x1, x2,..., xn be non-negative real numbers. Show that min (x2i + x2i+1 ) max (2xj xj+1 ), j=1,...,n i=1,...,n where xn+1
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More informationHMMT February 2018 February 10, 2018
HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More informationUNC Charlotte 2005 Comprehensive March 7, 2005
March 7, 2005 1 The numbers x and y satisfy 2 x = 15 and 15 y = 32 What is the value xy? (A) 3 (B) 4 (C) 5 (D) 6 (E) none of A, B, C or D 2 Suppose x, y, z, and w are real numbers satisfying x/y = 4/7,
More information1. Algebra 1.7. Prime numbers
1. ALGEBRA 30 1. Algebra 1.7. Prime numbers Definition Let n Z, with n 2. If n is not a prime number, then n is called a composite number. We look for a way to test if a given positive integer is prime
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
More informationUnofficial Solutions
Canadian Open Mathematics Challenge 2016 Unofficial Solutions COMC exams from other years, with or without the solutions included, are free to download online. Please visit http://comc.math.ca/2016/practice.html
More information11th Bay Area Mathematical Olympiad
11th ay rea Mathematical Olympiad ebruary 24, 2009 Problems (with Solutions) 1 square grid of 16 dots (see the figure) contains the corners of nine 1 1 squares, four 2 2 squares, and one 3 3 square, for
More informationQ 1 Find the square root of 729. 6. Squares and Square Roots Q 2 Fill in the blank using the given pattern. 7 2 = 49 67 2 = 4489 667 2 = 444889 6667 2 = Q 3 Without adding find the sum of 1 + 3 + 5 + 7
More informationUNC Charlotte 2005 Comprehensive March 7, 2005
March 7, 2005 1. The numbers x and y satisfy 2 x = 15 and 15 y = 32. What is the value xy? (A) 3 (B) 4 (C) 5 (D) 6 (E) none of A, B, C or D Solution: C. Note that (2 x ) y = 15 y = 32 so 2 xy = 2 5 and
More informationAlgebra 2 Summer Assignment - Non Regents
Name: Date: This assignment is to be completed over the summer. It must be turned in the first day of classes. It will be counted as a quiz. You MUST SHOW all work for each question in the space provided
More informationDeveloped in Consultation with Virginia Educators
Developed in Consultation with Virginia Educators Table of Contents Virginia Standards of Learning Correlation Chart.............. 6 Chapter 1 Expressions and Operations.................... Lesson 1 Square
More information2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.
2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say
More informationUAB MATH TALENT SEARCH
NAME: GRADE: SCHOOL NAME: 2016-2017 UAB MATH TALENT SEARCH This is a two hour contest. Answers are to be written in the spaces provided on the test sheet. There will be no credit if the answer is incorrect.
More informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More information2.3 In modular arithmetic, all arithmetic operations are performed modulo some integer.
CHAPTER 2 INTRODUCTION TO NUMBER THEORY ANSWERS TO QUESTIONS 2.1 A nonzero b is a divisor of a if a = mb for some m, where a, b, and m are integers. That is, b is a divisor of a if there is no remainder
More informationPUTNAM TRAINING EASY PUTNAM PROBLEMS
PUTNAM TRAINING EASY PUTNAM PROBLEMS (Last updated: September 24, 2018) Remark. This is a list of exercises on Easy Putnam Problems Miguel A. Lerma Exercises 1. 2017-A1. Let S be the smallest set of positive
More informationJoe Holbrook Memorial Math Competition
Joe Holbrook Memorial Math Competition 8th Grade Solutions October 9th, 06. + (0 ( 6( 0 6 ))) = + (0 ( 6( 0 ))) = + (0 ( 6)) = 6 =. 80 (n ). By the formula that says the interior angle of a regular n-sided
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationProblems for Putnam Training
Problems for Putnam Training 1 Number theory Problem 1.1. Prove that for each positive integer n, the number is not prime. 10 1010n + 10 10n + 10 n 1 Problem 1.2. Show that for any positive integer n,
More information(q 1)p q. = 1 (p 1)(q 1).
altic Way 001 Hamburg, November 4, 001 Problems 1. set of 8 problems was prepared for an examination. Each student was given 3 of them. No two students received more than one common problem. What is the
More informationQUADRATIC EQUATIONS EXPECTED BACKGROUND KNOWLEDGE
6 QUADRATIC EQUATIONS In this lesson, you will study aout quadratic equations. You will learn to identify quadratic equations from a collection of given equations and write them in standard form. You will
More informationMore AMC 8 Problems. Dr. Titu Andreescu. November 9, 2013
More AMC 8 Problems Dr. Titu Andreescu November 9, 2013 Problems 1. Complete 12 + 12 6 2 3 with one set of brackets ( ) in order to obtain 12. 2. Evaluate 10000000 100000 90. 3. I am thinking of two numbers.
More informationUNCC 2001 Comprehensive, Solutions
UNCC 2001 Comprehensive, Solutions March 5, 2001 1 Compute the sum of the roots of x 2 5x + 6 = 0 (A) (B) 7/2 (C) 4 (D) 9/2 (E) 5 (E) The sum of the roots of the quadratic ax 2 + bx + c = 0 is b/a which,
More informationTwitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Factorise each polynomial: a) x 2 6x + 5 b) x 2 16 c) 9x 2 25 2) Simplify the following algebraic fractions fully: a) x 2
More informationIntermediate Math Circles February 14, 2018 Contest Prep: Number Theory
Intermediate Math Circles February 14, 2018 Contest Prep: Number Theory Part 1: Prime Factorization A prime number is an integer greater than 1 whose only positive divisors are 1 and itself. An integer
More informationUNCC 2001 Algebra II
UNCC 2001 Algebra II March 5, 2001 1. Compute the sum of the roots of x 2 5x + 6 = 0. (A) 3 (B) 7/2 (C) 4 (D) 9/2 (E) 5 (E) The sum of the roots of the quadratic ax 2 + bx + c = 0 is b/a which, for this
More informationPythagorean Triangles with Repeated Digits Different Bases
arxiv:0908.3866v1 [math.gm] 6 Aug 009 Pythagorean Triangles with Repeated Digits Different Bases Habib Muzaffar Department of Mathematics International Islamic University Islamabad P.O. Box 144, Islamabad,
More informationAustralian Intermediate Mathematics Olympiad 2016
Australian Intermediate Mathematics Olympiad 06 Questions. Find the smallest positive integer x such that x = 5y, where y is a positive integer. [ marks]. A 3-digit number in base 7 is also a 3-digit number
More informationGlossary. Glossary 981. Hawkes Learning Systems. All rights reserved.
A Glossary Absolute value The distance a number is from 0 on a number line Acute angle An angle whose measure is between 0 and 90 Addends The numbers being added in an addition problem Addition principle
More informationMTH 310, Section 001 Abstract Algebra I and Number Theory. Sample Midterm 1
MTH 310, Section 001 Abstract Algebra I and Number Theory Sample Midterm 1 Instructions: You have 50 minutes to complete the exam. There are five problems, worth a total of fifty points. You may not use
More informationExecutive Assessment. Executive Assessment Math Review. Section 1.0, Arithmetic, includes the following topics:
Executive Assessment Math Review Although the following provides a review of some of the mathematical concepts of arithmetic and algebra, it is not intended to be a textbook. You should use this chapter
More informationNumber Theory. Final Exam from Spring Solutions
Number Theory. Final Exam from Spring 2013. Solutions 1. (a) (5 pts) Let d be a positive integer which is not a perfect square. Prove that Pell s equation x 2 dy 2 = 1 has a solution (x, y) with x > 0,
More informationExercises 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.
Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More information10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a "
Math 4161 Dr. Franz Rothe December 9, 2013 13FALL\4161_fall13f.tex Name: Use the back pages for extra space Final 70 70 Problem 1. The following assertions may be true or false, depending on the choice
More informationWinter Camp 2009 Number Theory Tips and Tricks
Winter Camp 2009 Number Theory Tips and Tricks David Arthur darthur@gmail.com 1 Introduction This handout is about some of the key techniques for solving number theory problems, especially Diophantine
More information2016 EF Exam Texas A&M High School Students Contest Solutions October 22, 2016
6 EF Exam Texas A&M High School Students Contest Solutions October, 6. Assume that p and q are real numbers such that the polynomial x + is divisible by x + px + q. Find q. p Answer Solution (without knowledge
More informationMultiplication of Polynomials
Summary 391 Chapter 5 SUMMARY Section 5.1 A polynomial in x is defined by a finite sum of terms of the form ax n, where a is a real number and n is a whole number. a is the coefficient of the term. n is
More informationMinnesota State High School Mathematics League
03-4 Meet, Individual Event Question # is intended to be a quickie and is worth point. Each of the next three questions is worth points. Place your answer to each question on the line provided. You have
More informationJohns Hopkins Math Tournament 2018 Proof Round: Sequences
Johns Hopkins Math Tournament 2018 Proof Round: Sequences February 17, 2018 Section Total Points Score 1 5 2 20 3 15 4 25 Instructions The exam is worth 60 points; each part s point value is given in brackets
More informationPUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes
PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be
More informationNumber Theory, Algebra and Analysis. William Yslas Vélez Department of Mathematics University of Arizona
Number Theory, Algebra and Analysis William Yslas Vélez Department of Mathematics University of Arizona O F denotes the ring of integers in the field F, it mimics Z in Q How do primes factor as you consider
More informationLong division for integers
Feasting on Leftovers January 2011 Summary notes on decimal representation of rational numbers Long division for integers Contents 1. Terminology 2. Description of division algorithm for integers (optional
More information3. A square has 4 sides, so S = 4. A pentagon has 5 vertices, so P = 5. Hence, S + P = 9. = = 5 3.
JHMMC 01 Grade Solutions October 1, 01 1. By counting, there are 7 words in this question.. (, 1, ) = 1 + 1 + = 9 + 1 + =.. A square has sides, so S =. A pentagon has vertices, so P =. Hence, S + P = 9..
More informationMATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM
MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is
More informationThe sum x 1 + x 2 + x 3 is (A): 4 (B): 6 (C): 8 (D): 14 (E): None of the above. How many pairs of positive integers (x, y) are there, those satisfy
Important: Answer to all 15 questions. Write your answers on the answer sheets provided. For the multiple choice questions, stick only the letters (A, B, C, D or E) of your choice. No calculator is allowed.
More informationFall 2017 Test II review problems
Fall 2017 Test II review problems Dr. Holmes October 18, 2017 This is a quite miscellaneous grab bag of relevant problems from old tests. Some are certainly repeated. 1. Give the complete addition and
More informationEXAMPLES OF MORDELL S EQUATION
EXAMPLES OF MORDELL S EQUATION KEITH CONRAD 1. Introduction The equation y 2 = x 3 +k, for k Z, is called Mordell s equation 1 on account of Mordell s long interest in it throughout his life. A natural
More informationHomework 3 Solutions, Math 55
Homework 3 Solutions, Math 55 1.8.4. There are three cases: that a is minimal, that b is minimal, and that c is minimal. If a is minimal, then a b and a c, so a min{b, c}, so then Also a b, so min{a, b}
More informationnot to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results
REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results Euclid s Division Lemma : Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 r < b. Euclid s Division
More informationMath 319 Problem Set #2 Solution 14 February 2002
Math 39 Problem Set # Solution 4 February 00. (.3, problem 8) Let n be a positive integer, and let r be the integer obtained by removing the last digit from n and then subtracting two times the digit ust
More information1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11.
000 Chapter 1 Arithmetic in 1.1 The Division Algorithm Revisited 1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = 3. 2. (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 3. (a) q = 6, r =
More informationChapter 7: Exponents
Chapter : Exponents Algebra Chapter Notes Name: Notes #: Sections.. Section.: Review Simplify; leave all answers in positive exponents:.) m -.) y -.) m 0.) -.) -.) - -.) (m ) 0.) 0 x y Evaluate if a =
More informationMASSACHUSETTS MATHEMATICS LEAGUE CONTEST 2 NOVEMBER 2014 ROUND 1 COMPLEX NUMBERS (No Trig) ANSWERS
) Given: ( ) MSSHUSETTS MTHEMTIS LEGUE ONTEST NOVEMER 014 ROUN 1 OMPLEX NUMERS (No Trig) NSWERS 3+ 4i + a + bi = 3+ ki, where a and b are real. ompute k such that a= b. ) ) ) ) Given: 1 5i = x + yi for
More informationMCS 115 Exam 2 Solutions Apr 26, 2018
MCS 11 Exam Solutions Apr 6, 018 1 (10 pts) Suppose you have an infinitely large arrel and a pile of infinitely many ping-pong alls, laeled with the positive integers 1,,3,, much like in the ping-pong
More informationNumber Theory in Problem Solving. Konrad Pilch
Number Theory in Problem Solving Konrad Pilch April 7, 2016 1 Divisibility Number Theory concerns itself mostly with the study of the natural numbers (N) and the integers (Z). As a consequence, it deals
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationOn the polynomial x(x + 1)(x + 2)(x + 3)
On the polynomial x(x + 1)(x + 2)(x + 3) Warren Sinnott, Steven J Miller, Cosmin Roman February 27th, 2004 Abstract We show that x(x + 1)(x + 2)(x + 3) is never a perfect square or cube for x a positive
More informationMath Homework # 4
Math 446 - Homework # 4 1. Are the following statements true or false? (a) 3 5(mod 2) Solution: 3 5 = 2 = 2 ( 1) is divisible by 2. Hence 2 5(mod 2). (b) 11 5(mod 5) Solution: 11 ( 5) = 16 is NOT divisible
More informationa the relation arb is defined if and only if = 2 k, k
DISCRETE MATHEMATICS Past Paper Questions in Number Theory 1. Prove that 3k + 2 and 5k + 3, k are relatively prime. (Total 6 marks) 2. (a) Given that the integers m and n are such that 3 (m 2 + n 2 ),
More informationThis exam contains 5 pages (including this cover page) and 4 questions. The total number of points is 100. Grade Table
MAT115A-21 Summer Session 2 2018 Practice Final Solutions Name: Time Limit: 1 Hour 40 Minutes Instructor: Nathaniel Gallup This exam contains 5 pages (including this cover page) and 4 questions. The total
More information15 th Annual Harvard-MIT Mathematics Tournament Saturday 11 February 2012
1 th Annual Harvard-MIT Mathematics Tournament Saturday 11 February 01 1. Let f be the function such that f(x) = { x if x 1 x if x > 1 What is the total length of the graph of f(f(...f(x)...)) from x =
More informationSolutions for November. f(x + f(y)) = f(x) + y
Solutions for November 647. Find all continuous functions f : R R such that for every x, y R. f(x + f(y)) = f(x) + y Solution 1. Setting (x, y) = (t, 0) yields f(t + f(0)) = f(t) for all real t. Setting
More informationCh 7 Summary - POLYNOMIAL FUNCTIONS
Ch 7 Summary - POLYNOMIAL FUNCTIONS 1. An open-top box is to be made by cutting congruent squares of side length x from the corners of a 8.5- by 11-inch sheet of cardboard and bending up the sides. a)
More informationLagrange s polynomial
Lagrange s polynomial Nguyen Trung Tuan November 16, 2016 Abstract In this article, I will use Lagrange polynomial to solve some problems from Mathematical Olympiads. Contents 1 Lagrange s interpolation
More informationTest Codes : MIA (Objective Type) and MIB (Short Answer Type) 2007
Test Codes : MIA (Objective Type) and MIB (Short Answer Type) 007 Questions will be set on the following and related topics. Algebra: Sets, operations on sets. Prime numbers, factorisation of integers
More informationMath.3336: Discrete Mathematics. Primes and Greatest Common Divisors
Math.3336: Discrete Mathematics Primes and Greatest Common Divisors Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu
More informationNote that Todd can only move north or west. After this point, Allison executes the following strategy based on Todd s turn.
1. First, note that both Todd and Allison place exactly one blue stone in each of their turns. Also, it will take Todd at least eight moves to get from the center to a corner. Therefore, as Todd would
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationChuck Garner, Ph.D. May 25, 2009 / Georgia ARML Practice
Some Chuck, Ph.D. Department of Mathematics Rockdale Magnet School for Science Technology May 25, 2009 / Georgia ARML Practice Outline 1 2 3 4 Outline 1 2 3 4 Warm-Up Problem Problem Find all positive
More informationProblems and Solutions
46 th Canadian Mathematical Olympiad Wednesday, April 2, 204 Problems and Solutions. Let a, a 2,..., a n be positive real numbers whose product is. Show that the sum a a 2 + + a ( + a )( + a 2 ) + a 3
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More information11 th Philippine Mathematical Olympiad Questions, Answers, and Hints
view.php3 (JPEG Image, 840x888 pixels) - Scaled (71%) https://mail.ateneo.net/horde/imp/view.php3?mailbox=inbox&inde... 1 of 1 11/5/2008 5:02 PM 11 th Philippine Mathematical Olympiad Questions, Answers,
More informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
More informationand LCM (a, b, c) LCM ( a, b) LCM ( b, c) LCM ( a, c)
CHAPTER 1 Points to Remember : REAL NUMBERS 1. Euclid s division lemma : Given positive integers a and b, there exists whole numbers q and r satisfying a = bq + r, 0 r < b.. Euclid s division algorithm
More informationPGSS Discrete Math Solutions to Problem Set #4. Note: signifies the end of a problem, and signifies the end of a proof.
PGSS Discrete Math Solutions to Problem Set #4 Note: signifies the end of a problem, and signifies the end of a proof. 1. Prove that for any k N, there are k consecutive composite numbers. (Hint: (k +
More information