USA Mathematical Talent Search Round 2 Solutions Year 29 Academic Year
|
|
- Horatio West
- 6 years ago
- Views:
Transcription
1 athematical alent earch Year 29 caemic Year Important information: 1. You must show your work an prove your answers on all problems. If you just sen a numerical answer with no proof for a problem other than Problem 1, you will get no more than 1 point. 2. Put your name an ID# on every page you submit. 3. No single page shoul contain solutions to more than one problem. Every solution you submit shoul begin on a new page, an you shoul only submit work on one sie of each piece of paper. 4. ubmit your solutions by November 27, 2017, via one (an only one!) of the methos below: (a) Web: Log on to to uploa a PDF file containing your solutions. (No other file type will be accepte.) Dealine: 8 P Eastern / 5 P Pacific on November 27, 2017 (b) ail: P.O. Box 4499 New York, NY (olutions must be postmarke on or before November 27, 2017.) 5. Once you sen in your solutions, that submission is final. You cannot resubmit solutions. 6. Confirm that your aress in your Profile is correct. You can o so by logging onto an visiting the y pages. 7. Roun 2 results will be poste at when available. o see your results, log on to the website, then go to y. You will also receive an when your scores an comments are available (provie that you i item #6 above). hese are only part of the complete rules. Please rea the entire rules on.
2 athematical alent earch Year 29 caemic Year Each problem is worth 5 points. 1/2/29. Given a rectangular gri with some cells containing one letter, we say a row or column is eible if it has more than one cell with a letter an all such cells contain the same letter. Given such a gri, the hungry, hungry letter monster repeats the following proceure: he fins all eible rows an all eible columns an simultaneously eats all the letters in those rows an columns, removing those letters from the gri an leaving those cells empty. He continues this until no more eible rows an columns remain. Call a gri a meal if the letter monster can eat all of its letters using this proceure. In the 7 by 7 gri to the right, fill each empty space with one letter so that the gri is a meal an there are a total eight s, nine s, ten s, eleven s, an eleven s. ome letters have been given to you. You o not nee to prove that your answer is the only one possible; you merely nee to fin an answer that satisfies the constraints above. (Note: In any other problem, you nee to provie a full proof. Only in this problem is an answer without justification acceptable.) olution
3 athematical alent earch Year 29 caemic Year /2/29. Let b be a positive integer. Grogg writes own a sequence whose first term is 1. Each term after that is the total number of igits in all the previous terms of the sequence when written in base b. For example, if b = 3, the sequence starts 1, 1, 2, 3, 5, 7, 9, 12,.... If b = 2521, what is the first positive power of b that oes not appear in the sequence? olution First, we look for a pattern in how the sequence increases. It increases by 1 with each term until we hit b. hen, the sequence increases by 2 with each term until we hit b 2. In general, once the sequence has passe b k 1, it will increase by k each term until it passes b k. his means that, if b r 1 is in the sequence, b r will be in the sequence if an only if b r b r 1 is a multiple of r. Or, equivalently, iff b r b r 1 (mo r). ince b 0 is in the sequence by efinition, we re looking for the first power of b such that b r b r 1 (mo r). ince b = lcm(1, 2,..., 10) + 1, we know that b 1 (mo k) for 2 k 10. o, the first time this equivalence might fail is at r = 11. n inee it oes fail at r = 11, since (mo 11) an = (mo 11). hus, b 11 is the first power of b that oes not appear in the sequence. Note: It s easiest to gain an unerstaning of what s going on by trying b = 10. rying simpler problems that you unerstan better is an important problem solving strategy. In this case, this problem actually came from first trying the case for b = 10.
4 athematical alent earch Year 29 caemic Year /2/29. he tug-of-war team nees to pick a representative to sen to the national tug-of-war convention. hey on t care who they sen, as long as they on t sen the weakest person on the team. heir team consists of 20 people, who each pull with a ifferent constant strength. hey want to esign a tournament, with each roun planne ahea of time, which at the en will allow them to pick a vali representative. Each roun of the tournament is a 10-on-10 tug-of-war match. roun may en in one sie winning, or in a tie if the strengths of each sie are matche. how that they can choose a representative using a tournament with 10 rouns. olution Consier the following cyclic sequence of games. In each game, the top 10 players play against the bottom 10 in the list. Player 1 Player 2 Player 3 Player 4 Player 5 Player 6 Player 7 Player 8 Player 9 Player 10 Player 11 Player 12 Player 13 Player 14 Player 15 Player 16 Player 17 Player 18 Player 19 Player 20 Player 2 Player 3 Player 4 Player 5 Player 6 Player 7 Player 8 Player 9 Player 10 Player 11 Player 12 Player 13 Player 14 Player 15 Player 16 Player 17 Player 18 Player 19 Player 20 Player 1 Player 10 Player 11 Player 12 Player 13 Player 14 Player 15 Player 16 Player 17 Player 18 Player 19 Player 20 Player 1 Player 2 Player 3 Player 4 Player 5 Player 6 Player 7 Player 8 Player 9 Player 11 Player 12 Player 13 Player 14 Player 15 Player 16 Player 17 Player 18 Player 19 Player 20 Player 1 Player 2 Player 3 Player 4 Player 5 Player 6 Player 7 Player 8 Player 9 Player 10 We get each successive list by moving the player on the top of the previous list to the bottom of the next list. Note that there are a total of 11 games here, but the last game is exactly the same as the first, so we know the results of all 11 games by only playing the first 10. Note that if the first game is a tie, the secon game etermines which of player 1 an player 11 is stronger. o, without loss of generality, we ll assume the bottom team lost the first game. In each successive game, one player on each team switches spots. o, the first time the bottom team wins a game, we know that the player that switche to the bottom is stronger than the person she swappe with.
5 athematical alent earch Year 29 caemic Year o, we will have a representative if the bottom team ever wins a game. But, we know the bottom team wins the 11th game because it s the exact opposite of the first game! o, we must be able to fin a representative in at most 10 games. Note: While we expect it is the case, the authors o not know if 10 games is optimal.
6 athematical alent earch Year 29 caemic Year /2/29. Zan starts with a rational number 0 < a < 1 written on the boar in lowest terms. b hen, every secon, Zan as 1 to both the numerator an enominator of the latest fraction an writes the result in lowest terms. Zan stops as soon as he writes a fraction of the form n, for some positive integer n. If a starte in that form, Zan oes nothing. n+1 b s an example, if Zan starts with 13 14, then after one secon he writes = 7, then after two secons 8, then 9 = 3, at which point he stops (a) Prove that Zan will stop in less than b a secons. (b) how that if is the final number, then n Create PDF with GO2PDF for free, if you wish to remove n+1 this line, click here to buy Virtual PDF Printer n 1 n < a b n n + 1. olution (a) We go by inuction on b a. he base case b a = 1 is one by efinition, because Zan won t make any moves. uppose the fraction is a an the claim is true for all values b less than b a. Let m be the smallest positive integer with gc(a + m, b + m) > 1, an efine = gc(a + m, b + m). Note that we have m <, since otherwise we coul write m = + k an m = m woul be a smaller solution. he efinition of m means after m steps, we get a fraction whose numerator an enominator iffer by b a, which is an integer since = gc(a + m, b + m) = gc(a + m, [b + m] [a + m]) = gc(a + m, b a). By the inuction hypothesis, it takes at most b a 1 steps to finish after these m steps. o to complete the inuction we nee to show that m + b a 1 < b a. ince an b a are positive integers, we can say that ( ) b a ( 1) 1 0. Expaning an rearranging, this becomes + b a 1 b a. ince m <, this implies the inequality we wante to show.
7 athematical alent earch Year 29 caemic Year (b) We will assume that Zan s sequence has more than one term, since otherwise the result is obvious. First, we claim that Zan s sequence is strictly increasing. hat is, a+1 > a. b+1 b Clearing enominators, this is equivalent to b(a + 1) a(b + 1) = b a > 0, which is true since a < 1. his means that a < n, so it now suffices to show that b b n+1 n 1 < a. o that en, suppose towar a contraiction that a < k, where k < n. n b b k+1 Clearing the enominators in our conition, we get ak + a < kb. ing k to both sies an using that x < y x+1 y for integers x, y, this becomes ak + a + k + 1 kb + k. fter factoring the left sie an iviing both sies by (k + 1)(b + 1), we have a + 1 b + 1 k k + 1. his means that Zan s sequence is boune by n number is. o, we must have n+1 n 1 n < a b n n + 1. k, which is impossible if Zan s final k+1
8 athematical alent earch Year 29 caemic Year /2/29. here are n istinct points in the plane, no three of which are collinear. uppose that an B are two of these points. We say that segment B is inepenent if there is a straight line such that points an B are on one sie of the line, an the other n 2 points are on the other sie. What is the maximum possible number of inepenent segments? olution (REVIED base on input by Kevin Ren.) If n = 1, there are 0 inepenent segments. If n = 2, there is exactly 1 inepenent segment. If n = 3, there are exactly 3 inepenent segments (the eges of the triangle forme by the three points). If n 4, let H = H 1 H 2... H k be the convex hull of the given points an G 1, G 2,..., G l be all given points that are not vertices of H. We will nee two cases, first when H is a triangle, an secon when H is not a triangle. First assume the convex hull of the set of points is a triangle BC. No inepenent segment can have both of its enpoints in the interior of H. We claim that for any ege, say B, of this triangle there is at most one point X in the interior of BC such that both X an XB are inepenent. o that en, suppose that we have two points X an Y in the interior of BC such that X, BX an Y, BY are inepenent. First, we note that if Y an BX cross, then neither of them can be inepenent. o see this note that in this case XY B is a convex quarilateral. he segment that separate Y from the other points woul have to pass through X, XY, an B. he only such line is the iagonal BX, which is impossible because an Y are not on the same sie of that iagonal. imilarly, BX cannot be inepenent. o, Y an BX o not cross. Without loss of generality, Y is containe in the interior of XC. In this case, a segment that separates BY from, C, an X must pass through Y, CY, an XY. But that is impossible, because any such line passes through Y. his proves the claim.
9 athematical alent earch Year 29 caemic Year herefore, we can boun the number of inepenent segments when the convex hull is a triangle. First, if there is an interior point X such that X, BX, an CX are all inepenent, then the other n 4 interior points are part of at most one inepenent segment, an each sie of the convex hull is an inepenent segment. his gives at most (n 4) = n + 2 inepenent segments. lternatively, if there is no interior point X such that X, BX, an CX are inepenent, then there are at most three interior points incient to two inepenent segments, one from each sie. his gives 6 inepenent segments. he remaining n 6 interior points are part of at most one inepenent segment, an each sie of the convex hull is an inepenent segment. o, we see that there are at most (n 6) = n + 3 inepenent segments in this case. ll together, we can say that there are at most n + 3 inepenent segments when the convex hull is a triangle. Next, we consier the case that the convex hull is not a triangle. Let H = H 1 H 2... H k be the convex hull of the given points an G 1, G 2,..., G l be all given points that are not vertices of H. If both of the enpoints of an inepenent segment are vertices of H then it must be a sie of H: here are at most k such inepenent segments.
10 athematical alent earch Year 29 caemic Year Next we look at inepenent segments with one enpoint an H i an the other a G j. If H i G j is inepenent, then G j lies in the interior of H i 1 H i H i+1 (H-inices run moulo k). ince no three such triangles have a common interior point, no G j is an enpoint of more than two inepenent segments. If G j is an enpoint of two inepenent segments, we say that it is a ouble. Let m be the number of oubles. If G j is a ouble, then it must lie in the interior of the intersection δ i of H i 1 H i H i+1 an H i H i+1 H i+2 for some i. uppose that some δ i contains two oubles P an Q. ince H i 1 H i H i+1 H i+2 is a convex quarilateral, the line P Q oes not intersect at least one of the segments H i 1 H i, H i H i+1, an H i+1 H i+2, say H i 1 H i. his means that (with P an Q s labels switche if nee be) H i 1 P QH i is a convex quarilateral. herefore, the segment H i 1 Q intersects the segment H i P in an interior point an H i P cannot be an inepenent segment, a contraiction. herefore, the number of oubles is at most the number of δs. ince there are l Gs an k δs, this means that the number of inepenent segments involving Gs is boune above by l + min{k, l}. ing in the eges of the convex hull, we see that the total number of inepenent segments is at most k + l + min{k, l} when the convex hull is not a triangle. ince k + l = n, this is at most n + n. 2 his gives us a boun of max(n + 3, n + n ). For n > 5, this boun is simply n + n 2 2 an is attaine when k = n an each G 2 j lies in the interior of δ j. o complete the proof, we just have to wrestle with the cases n = 4 an n = 5. If n = 4, there are at most 6 inepenent segments, achieve by placing a single point insie a triangular convex hull. Finally, we consier n = 5. If the convex hull is not a triangle, we know there are at most n + n = = 7 inepenent segments. 2 We claim that no interior point can form an inepenent segment with all three vertices in a triangular convex hull BC. o see this, note that there are exactly 2 vertices say X, Y in the interior of BC. he line XY intersects exactly two of the sies of BC, without loss of generality, assume that B is the thir sie. hen, XY B forms a convex quarilateral, as shown below.
11 athematical alent earch Year 29 caemic Year We know from earlier that neither Y nor BX can be inepenent in this case, so we have the claim. hus, there are at most = 7 inepenent segments for n = 5. his is achieve in the picture above (B, BC, C, X, XC, Y B, an Y C are inepenent). n hus the maximum value is n + for n 4, an 0 for n = 1, 1 for n = 2, an 3 2 for n = 3. (Problem propose by Nikolai Beluhov) Problems by Nikolai Beluhov, Billy wartworth, ichael ang, an taff. must be submitte by November 27, Please visit for etails about solution submission. c 2017 rt of Problem olving Initiative, Inc.
A NEW PUZZLE FOR ITERATED COMPLETE GRAPHS OF ANY DIMENSION
A NEW PUZZLE FOR ITERATED COMPLETE GRAPHS OF ANY DIMENSION ELIZABETH SKUBAK AND NICHOLAS STEVENSON ADVISOR: PAUL CULL OREGON STATE UNIVERSITY ABSTRACT. The Towers of Hanoi puzzle can be use to label a
More informationECON 282 Final Practice Problems
ECON 282 Final Practice Problems S. Lu Multiple Choice Questions Note: The presence of these practice questions does not imply that there will be any multiple choice questions on the final exam. 1. How
More informationContents Maryland High School Programming Contest 1. 1 Stacked Floating Mountains 2. 2 Chess Puzzle 3. 3 Life Connections 4
2010 Marylan High School Programming Contest 1 Contents 1 Stacke Floating Mountains 2 2 Chess Puzzle 3 3 Life Connections 4 4 Circle of Friens 5 5 Floating Mountain Stability 6 6 Aim It Right! 7 7 Navi
More informationBMT 2018 Combinatorics Test Solutions March 18, 2018
. Bob has 3 different fountain pens and different ink colors. How many ways can he fill his fountain pens with ink if he can only put one ink in each pen? Answer: 0 Solution: He has options to fill his
More informationWind sculpture. Cable 2. Cable 1. Sculpture
Win sculpture Your frien, an artist, has been thinking about an interesting way to isplay a new win sculpture she has just create. In orer to create an aural as well as visual effect, she woul like to
More informationThe CENTRE for EDUCATION in MATHEMATICS and COMPUTING cemc.uwaterloo.ca Galois Contest. Thursday, April 18, 2013
The CENTRE for EDUCATION in MATHEMATIC and COMUTING cemc.uwaterloo.ca 201 Galois Contest Thursday, April 18, 201 (in North America and outh America) Friday, April 19, 201 (outside of North America and
More informationOrganization Team Team ID# If each of the congruent figures has area 1, what is the area of the square?
1. [4] A square can be divided into four congruent figures as shown: If each of the congruent figures has area 1, what is the area of the square? 2. [4] John has a 1 liter bottle of pure orange juice.
More information14th Bay Area Mathematical Olympiad. BAMO Exam. February 28, Problems with Solutions
14th Bay Area Mathematical Olympiad BAMO Exam February 28, 2012 Problems with Solutions 1 Hugo plays a game: he places a chess piece on the top left square of a 20 20 chessboard and makes 10 moves with
More informationGrade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015 Chomp Chomp is a simple 2-player
More informationSolutions to the 2004 CMO written March 31, 2004
Solutions to the 004 CMO written March 31, 004 1. Find all ordered triples (x, y, z) of real numbers which satisfy the following system of equations: xy = z x y xz = y x z yz = x y z Solution 1 Subtracting
More informationResource Allocation for Cooperative Transmission in Wireless Networks with Orthogonal Users
Resource Allocation for Cooperative Transmission in Wireless Networks with Orthogonal Users D. Richar Brown III Electrical an Computer Engineering Department Worcester Polytechnic Institute Worcester,
More informationGrade 6 Math Circles Combinatorial Games November 3/4, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Combinatorial Games November 3/4, 2015 Chomp Chomp is a simple 2-player game. There
More informationSolutions to Exercises on Page 86
Solutions to Exercises on Page 86 #. A number is a multiple of, 4, 5 and 6 if and only if it is a multiple of the greatest common multiple of, 4, 5 and 6. The greatest common multiple of, 4, 5 and 6 is
More informationGrade 7/8 Math Circles Game Theory October 27/28, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Game Theory October 27/28, 2015 Chomp Chomp is a simple 2-player game. There is
More informationLESSON 18: INTRODUCTION TO FUNCTIONS OF SEVERAL VARIABLES MATH FALL 2018
LESSON 8: INTRODUCTION TO FUNCTIONS OF SEVERAL VARIABLES MATH 6020 FALL 208 ELLEN WELD. Partial Derivatives We aress how to take a erivative of a function of several variables. Although we won t get into
More informationState Math Contest (Junior)
Name: Student ID: State Math Contest (Junior) Instructions: Do not turn this page until your proctor tells you. Enter your name, grade, and school information following the instructions given by your proctor.
More informationRosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples
Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples Section 1.7 Proof Methods and Strategy Page references correspond to locations of Extra Examples icons in the textbook. p.87,
More information37 Game Theory. Bebe b1 b2 b3. a Abe a a A Two-Person Zero-Sum Game
37 Game Theory Game theory is one of the most interesting topics of discrete mathematics. The principal theorem of game theory is sublime and wonderful. We will merely assume this theorem and use it to
More informationSECONDARY TRANSMISSION POWER OF COGNITIVE RADIOS FOR DYNAMIC SPECTRUM ACCESS
SECONDARY TRANSMISSION POWER OF COGNITIVE RADIOS FOR DYNAMIC SPECTRUM ACCESS Xiaohua Li 1 1 Department of ECE State University of New York at Binghamton Binghamton, NY 139, USA {xli,jhwu1}@binghamton.eu
More informationCache-Aided Content Delivery in Fog-RAN Systems with Topological Information and no CSI
Cache-Aie Content Delivery in Fog-RAN Systems with Topological Information an no CSI Wei-Ting Chang, Ravi Tanon, Osvalo Simeone Abstract In this work, we consier a Fog Raio Access Network (F-RAN) system
More information25 C3. Rachel gave half of her money to Howard. Then Howard gave a third of all his money to Rachel. They each ended up with the same amount of money.
24 s to the Olympiad Cayley Paper C1. The two-digit integer 19 is equal to the product of its digits (1 9) plus the sum of its digits (1 + 9). Find all two-digit integers with this property. If such a
More informationProblem Solving Methods
Problem olving Methods Blake Thornton One of the main points of problem solving is to learn techniques by just doing problems. o, lets start with a few problems and learn a few techniques. Patience. Find
More information18.S34 (FALL, 2007) PROBLEMS ON PROBABILITY
18.S34 (FALL, 2007) PROBLEMS ON PROBABILITY 1. Three closed boxes lie on a table. One box (you don t know which) contains a $1000 bill. The others are empty. After paying an entry fee, you play the following
More informationThe Analysis and Complementarity of Abbe Principle Application Limited in Coordinate Measurement
Proceeings of the Worl Congress on Engineering 00 Vol III The Analysis an Complementarity of Abbe Principle Application Limite in Coorinate Measurement Fei Yetai, Shang Ping, Chen Xiaohuai, Huang Qiangxian
More informationTOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1
TOPOLOGY, LIMITS OF COMPLEX NUMBERS Contents 1. Topology and limits of complex numbers 1 1. Topology and limits of complex numbers Since we will be doing calculus on complex numbers, not only do we need
More informationCounting Things. Tom Davis March 17, 2006
Counting Things Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles March 17, 2006 Abstract We present here various strategies for counting things. Usually, the things are patterns, or
More informationProblem 2A Consider 101 natural numbers not exceeding 200. Prove that at least one of them is divisible by another one.
1. Problems from 2007 contest Problem 1A Do there exist 10 natural numbers such that none one of them is divisible by another one, and the square of any one of them is divisible by any other of the original
More informationProblem A To and Fro (Problem appeared in the 2004/2005 Regional Competition in North America East Central.)
Problem A To and Fro (Problem appeared in the 2004/2005 Regional Competition in North America East Central.) Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number
More informationAsymptotic Results for the Queen Packing Problem
Asymptotic Results for the Queen Packing Problem Daniel M. Kane March 13, 2017 1 Introduction A classic chess problem is that of placing 8 queens on a standard board so that no two attack each other. This
More informationTeam Round University of South Carolina Math Contest, 2018
Team Round University of South Carolina Math Contest, 2018 1. This is a team round. You have one hour to solve these problems as a team, and you should submit one set of answers for your team as a whole.
More information2009 ACM ICPC Southeast USA Regional Programming Contest. 7 November, 2009 PROBLEMS
2009 ACM ICPC Southeast USA Regional Programming Contest 7 November, 2009 PROBLEMS A: Block Game... 1 B: Euclid... 3 C: Museum Guards... 5 D: Knitting... 7 E: Minesweeper... 9 F: The Ninja Way... 10 G:
More information12th Bay Area Mathematical Olympiad
2th Bay Area Mathematical Olympiad February 2, 200 Problems (with Solutions) We write {a,b,c} for the set of three different positive integers a, b, and c. By choosing some or all of the numbers a, b and
More informationFigure 1: The Game of Fifteen
1 FIFTEEN One player has five pennies, the other five dimes. Players alternately cover a number from 1 to 9. You win by covering three numbers somewhere whose sum is 15 (see Figure 1). 1 2 3 4 5 7 8 9
More informationOn the Capacity Regions of Two-Way Diamond. Channels
On the Capacity Regions of Two-Way Diamond 1 Channels Mehdi Ashraphijuo, Vaneet Aggarwal and Xiaodong Wang arxiv:1410.5085v1 [cs.it] 19 Oct 2014 Abstract In this paper, we study the capacity regions of
More informationCaltech Harvey Mudd Mathematics Competition February 20, 2010
Mixer Round Solutions Caltech Harvey Mudd Mathematics Competition February 0, 00. (Ying-Ying Tran) Compute x such that 009 00 x (mod 0) and 0 x < 0. Solution: We can chec that 0 is prime. By Fermat s Little
More information16 DESEMBER AC to AC VOLTAGE CONVERTERS
DSMBR AC to AC VOLTAG CONVRTRS THR PHAS AC RGULATORS Instructional Objectives Stuy of the following: The circuits use for the threephase ac regulators (ac to ac voltage converters) The operation of the
More information4th Pui Ching Invitational Mathematics Competition. Final Event (Secondary 1)
4th Pui Ching Invitational Mathematics Competition Final Event (Secondary 1) 2 Time allowed: 2 hours Instructions to Contestants: 1. 100 This paper is divided into Section A and Section B. The total score
More informationBilbo s New Adventures
Bilbo s New Adventures Problem 1 Solve the equation: x + x + 1 x + = 0 Solution The left side of the equation is defined for x 0 Moving x + to the right hand side of the equation one gets: x + x + 1 =
More informationHigh School Math Contest. Prepared by the Mathematics Department of. Rose-Hulman Institute of Technology Terre Haute, Indiana.
High School Math Contest Prepared by the Mathematics Department of Rose-Hulman Institute of Technology Terre Haute, Indiana November 1, 016 Instructions: Put your name and home address on the back of your
More informationCSE548, AMS542: Analysis of Algorithms, Fall 2016 Date: Sep 25. Homework #1. ( Due: Oct 10 ) Figure 1: The laser game.
CSE548, AMS542: Analysis of Algorithms, Fall 2016 Date: Sep 25 Homework #1 ( Due: Oct 10 ) Figure 1: The laser game. Task 1. [ 60 Points ] Laser Game Consider the following game played on an n n board,
More informationUNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST
UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST First Round For all Colorado Students Grades 7-12 October 31, 2009 You have 90 minutes no calculators allowed The average of n numbers is their sum divided
More informationSolutions of problems for grade R5
International Mathematical Olympiad Formula of Unity / The Third Millennium Year 016/017. Round Solutions of problems for grade R5 1. Paul is drawing points on a sheet of squared paper, at intersections
More informationSolutions to the European Kangaroo Pink Paper
Solutions to the European Kangaroo Pink Paper 1. The calculation can be approximated as follows: 17 0.3 20.16 999 17 3 2 1000 2. A y plotting the points, it is easy to check that E is a square. Since any
More informationMETHOD 1: METHOD 2: 4D METHOD 1: METHOD 2:
4A Strategy: Count how many times each digit appears. There are sixteen 4s, twelve 3s, eight 2s, four 1s, and one 0. The sum of the digits is (16 4) + + (8 2) + (4 1) = 64 + 36 +16+4= 120. 4B METHOD 1:
More informationEuclid Contest Tuesday, April 15, 2014 (in North America and South America)
The CENTRE for EDUCTION in MTHEMTICS and COMPUTING cemc.uwaterloo.ca Euclid Contest Tuesday, pril 15, 2014 (in North merica and South merica) Wednesday, pril 16, 2014 (outside of North merica and South
More informationAlgebra/Geometry Session Problems Questions 1-20 multiple choice
lgebra/geometry Session Problems Questions 1-0 multiple choice nswer only one choice: (a), (b), (c), (d), or (e) for each of the following questions. Only use a number pencil. Make heavy black marks that
More informationMathematical Olympiads November 19, 2014
athematical Olympiads November 19, 2014 for Elementary & iddle Schools 1A Time: 3 minutes Suppose today is onday. What day of the week will it be 2014 days later? 1B Time: 4 minutes The product of some
More informationCheckpoint Questions Due Monday, October 7 at 2:15 PM Remaining Questions Due Friday, October 11 at 2:15 PM
CS13 Handout 8 Fall 13 October 4, 13 Problem Set This second problem set is all about induction and the sheer breadth of applications it entails. By the time you're done with this problem set, you will
More informationI.M.O. Winter Training Camp 2008: Invariants and Monovariants
I.M.. Winter Training Camp 2008: Invariants and Monovariants n math contests, you will often find yourself trying to analyze a process of some sort. For example, consider the following two problems. Sample
More informationMath Kangaroo 2002 Level of grades 11-12
1 of 5 www.mathkangaroo.com Problems 3 points each Math Kangaroo 2002 Level of grades 11-12 1. A certain polyhedron has exactly n faces and one of these faces is a pentagon. What is the least possible
More information1.0 MEASUREMENT OF PARAXIAL PROPERTIES OF OPTICAL SYSTEMS
.0 MEASUREMENT OF PARAXIAL PROPERTIES OF OPTICAL SYSTEMS James C. Wyant Optical Sciences Center University of Arizona Tucson, AZ 8572 jcwyant@u.arizona.eu If we wish to completely characterize the paraxial
More informationVMO Competition #1: November 21 st, 2014 Math Relays Problems
VMO Competition #1: November 21 st, 2014 Math Relays Problems 1. I have 5 different colored felt pens, and I want to write each letter in VMO using a different color. How many different color schemes of
More informationAnalyzing Games: Solutions
Writing Proofs Misha Lavrov Analyzing Games: olutions Western PA ARML Practice March 13, 2016 Here are some key ideas that show up in these problems. You may gain some understanding of them by reading
More information12. 6 jokes are minimal.
Pigeonhole Principle Pigeonhole Principle: When you organize n things into k categories, one of the categories has at least n/k things in it. Proof: If each category had fewer than n/k things in it then
More informationIntroduction to Counting and Probability
Randolph High School Math League 2013-2014 Page 1 If chance will have me king, why, chance may crown me. Shakespeare, Macbeth, Act I, Scene 3 1 Introduction Introduction to Counting and Probability Counting
More informationELEMENTS OF NUMBER THEORY & CONGRUENCES. Lagrange, Legendre and Gauss. Mth Mathematicst
ELEMENTS OF NUMBER THEORY & CONGRUENCES Lagrange, Legendre and Gauss ELEMENTS OF NUMBER THEORY & CONGRUENCES 1) If a 0, b 0 Z and a/b, b/a then 1) a=b 2) a=1 3) b=1 4) a=±b Ans : is 4 known result. If
More informationLESSON 2: THE INCLUSION-EXCLUSION PRINCIPLE
LESSON 2: THE INCLUSION-EXCLUSION PRINCIPLE The inclusion-exclusion principle (also known as the sieve principle) is an extended version of the rule of the sum. It states that, for two (finite) sets, A
More informationWinter Quarter Competition
Winter Quarter Competition LA Math Circle (Advanced) March 13, 2016 Problem 1 Jeff rotates spinners P, Q, and R and adds the resulting numbers. What is the probability that his sum is an odd number? Problem
More informationEXPLAINING THE SHAPE OF RSK
EXPLAINING THE SHAPE OF RSK SIMON RUBINSTEIN-SALZEDO 1. Introduction There is an algorithm, due to Robinson, Schensted, and Knuth (henceforth RSK), that gives a bijection between permutations σ S n and
More information10-1. Combinations. Vocabulary. Lesson. Mental Math. able to compute the number of subsets of size r.
Chapter 10 Lesson 10-1 Combinations BIG IDEA With a set of n elements, it is often useful to be able to compute the number of subsets of size r Vocabulary combination number of combinations of n things
More informationSUDOKU Mahabharat. Episode 7 21 st 23 rd March. Converse by Swaroop Guggilam
Episode 7 21 st 23 rd March by Swaroop Guggilam Important Links Submission Page : http://logicmastersindia.com/sm/201503/ Discussion Thread : http://logicmastersindia.com/t/?tid=936 bout Sudoku Mahabharat
More informationSMT 2014 Advanced Topics Test Solutions February 15, 2014
1. David flips a fair coin five times. Compute the probability that the fourth coin flip is the first coin flip that lands heads. 1 Answer: 16 ( ) 1 4 Solution: David must flip three tails, then heads.
More informationa b c d e f g h 1 a b c d e f g h C A B B A C C X X C C X X C C A B B A C Diagram 1-2 Square names
Chapter Rules and notation Diagram - shows the standard notation for Othello. The columns are labeled a through h from left to right, and the rows are labeled through from top to bottom. In this book,
More informationCPSC 217 Assignment 3
CPSC 217 Assignment 3 Due: Friday November 24, 2017 at 11:55pm Weight: 7% Sample Solution Length: Less than 100 lines, including blank lines and some comments (not including the provided code) Individual
More informationCOUNTING AND PROBABILITY
CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.2 Possibility Trees and the Multiplication Rule Copyright Cengage Learning. All rights reserved. Possibility
More informationCapacity Gain from Transmitter and Receiver Cooperation
Capacity Gain from Transmitter an Receiver Cooperation Chris T. K. Ng an Anrea J. Golsmith Dept. of Electrical Engineering Stanfor University, Stanfor, CA 90 Email: ngctk, anrea}@wsl.stanfor.eu arxiv:cs/00800v1
More informationActivity 6: Playing Elevens
Activity 6: Playing Elevens Introduction: In this activity, the game Elevens will be explained, and you will play an interactive version of the game. Exploration: The solitaire game of Elevens uses a deck
More informationNotes on 4-coloring the 17 by 17 grid
otes on 4-coloring the 17 by 17 grid lizabeth upin; ekupin@math.rutgers.edu ugust 5, 2009 1 or large color classes, 5 in each row, column color class is large if it contains at least 73 points. We know
More informationEXCELLENCE IN MATHEMATICS EIGHTH GRADE TEST CHANDLER-GILBERT COMMUNITY COLLEGE S. TWELFTH ANNUAL MATHEMATICS CONTEST SATURDAY, JANUARY 21 st, 2012
EXCELLENCE IN MATHEMATICS EIGHTH GRADE TEST CHANDLER-GILBERT COMMUNITY COLLEGE S TWELFTH ANNUAL MATHEMATICS CONTEST SATURDAY, JANUARY 21 st, 2012 1. DO NOT OPEN YOUR TEST BOOKLET OR BEGIN WORK UNTIL YOU
More information1 Write a Function in
www.ck12.org Chapter 1. Write a Function in Slope-Intercept Form CHAPTER 1 Write a Function in Slope-Intercept Form Here you ll learn how to write the slope-intercept form of linear functions and how to
More informationWireless Event-driven Networked Predictive Control Over Internet
UKACC International Conference on Control 22 Cariff, UK, 3-5 September 22 Wireless Event-riven Networke Preictive Control Over Internet Wenshan Hu, Hong Zhou, an Qijun Deng Abstract In networke control
More informationReading 14 : Counting
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 14 : Counting In this reading we discuss counting. Often, we are interested in the cardinality
More informationIvan Guo. Broken bridges There are thirteen bridges connecting the banks of River Pluvia and its six piers, as shown in the diagram below:
Ivan Guo Welcome to the Australian Mathematical Society Gazette s Puzzle Corner No. 20. Each issue will include a handful of fun, yet intriguing, puzzles for adventurous readers to try. The puzzles cover
More informationThe Classification of Quadratic Rook Polynomials of a Generalized Three Dimensional Board
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 3 (2017), pp. 1091-1101 Research India Publications http://www.ripublication.com The Classification of Quadratic Rook Polynomials
More informationLecture 2. 1 Nondeterministic Communication Complexity
Communication Complexity 16:198:671 1/26/10 Lecture 2 Lecturer: Troy Lee Scribe: Luke Friedman 1 Nondeterministic Communication Complexity 1.1 Review D(f): The minimum over all deterministic protocols
More informationShuli s Math Problem Solving Column
Shuli s ath Problem Solving Column Volume 1, Issue 2 ugust 16, 2008 Edited and uthored by Shuli Song Colorado Springs, Colorado shuli_song@yahoo.com Content 1. Basic Knowledge: ow any Numbers You Count
More informationIntroductory Probability
Introductory Probability Combinations Nicholas Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK Agenda Assigning Objects to Identical Positions Denitions Committee Card Hands Coin Toss Counts
More informationDivision of Mathematics Alfred University
Division of Mathematics Alfred University Alfred, NY 14802 Instructions: 1. This competition will last seventy-five minutes from 10:05 to 11:20. 2. The use of calculators is not permitted. 3. There are
More informationApril 6, 2013 RIT Competition Sprint Round Problems 1-30
April 6, 2013 RIT Competition Sprint Round Problems 1-30 Name DO NOT BEGIN UNTIL YOU ARE INSTRUCTED TO DO SO. This section of the competition consists of 30 problems. You will have 40 minutes to complete
More informationCounting Things Solutions
Counting Things Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles March 7, 006 Abstract These are solutions to the Miscellaneous Problems in the Counting Things article at:
More informationMATHEMATICS LEVEL 7 8 (Α - Β Γυμνασίου)
LEVEL 7 8 (Α - Β Γυμνασίου) 19 March 011 10:00-11:15 3 points 1) Which of the following has the largest value? (A) 011 1 (B) 1 011 (C) 1 x 011 (D) 1 + 011 (E) 1 011 ) Elsa plays with cubes and tetrahedrons.
More informationC2. Design of Digital Filters
C2. Design of Digital Filters Objectives Unerstan what is an ieal filter vs a non-ieal filter Given signal an noise specifications in the frequency omain, how to esign a igital filter; For the same problem,
More informationMath 32A Discussion Session Week 9 Notes November 28 and 30, 2017
Math 3A Discussion Session Week 9 Notes November 8 an 30, 07 This week we ll explore some of the ieas from chapter 5, focusing mostly on the graient. We ll motivate this exploration with an example that
More informationDaniel Plotnick. November 5 th, 2017 Mock (Practice) AMC 8 Welcome!
November 5 th, 2017 Mock (Practice) AMC 8 Welcome! 2011 = prime number 2012 = 2 2 503 2013 = 3 11 61 2014 = 2 19 53 2015 = 5 13 31 2016 = 2 5 3 2 7 1 2017 = prime number 2018 = 2 1009 2019 = 3 673 2020
More informationProblem F. Chessboard Coloring
Problem F Chessboard Coloring You have a chessboard with N rows and N columns. You want to color each of the cells with exactly N colors (colors are numbered from 0 to N 1). A coloring is valid if and
More informationMinimal tilings of a unit square
arxiv:1607.00660v1 [math.mg] 3 Jul 2016 Minimal tilings of a unit square Iwan Praton Franklin & Marshall College Lancaster, PA 17604 Abstract Tile the unit square with n small squares. We determine the
More informationSect Linear Equations in Two Variables
99 Concept # Sect. - Linear Equations in Two Variables Solutions to Linear Equations in Two Variables In this chapter, we will examine linear equations involving two variables. Such equations have an infinite
More informationMathematical Olympiad for Girls
UKMT UKMT UKMT United Kingdom Mathematics Trust Mathematical Olympiad for Girls Tuesday 2nd October 208 Organised by the United Kingdom Mathematics Trust These are polished solutions and do not illustrate
More informationEpisode 5 11 th 14 th May Casual & Word by Rakesh Rai
and Episode 5 11 th 1 th May 018 by Rakesh Rai Puzzle Ramayan rounds will also serve as qualifiers for Indian Puzzle Championship for year 018. Please check http://logicmastersindia.com/pr/018pr.asp for
More informationSSM2040 Filter Analysis Part 1 - Ryan Williams
SSM2040 Filter Analysis Part 1 - Ryan Williams http://www.siy.org/estrukto The following analysis is use to etermine the maximum bias current neee for the iscrete OTA cells in the ssm2040 filter (René
More informationLEVEL I. 3. In how many ways 4 identical white balls and 6 identical black balls be arranged in a row so that no two white balls are together?
LEVEL I 1. Three numbers are chosen from 1,, 3..., n. In how many ways can the numbers be chosen such that either maximum of these numbers is s or minimum of these numbers is r (r < s)?. Six candidates
More informationLEARN TO PLAY CHESS CONTENTS 1 INTRODUCTION. Terry Marris December 2004
LEARN TO PLAY CHESS Terry Marris December 2004 CONTENTS 1 Kings and Queens 2 The Rooks 3 The Bishops 4 The Pawns 5 The Knights 6 How to Play 1 INTRODUCTION Chess is a game of war. You have pieces that
More informationSeries. Teacher. Numbers
Series C Teaher Numers Series C Numers Contents Stuent ook answers Assessment 79 Stuent progress reor Assessment answers 3 Ojetives 5 Series Author: Rahel Flenley Copyright Series C Numers Page a Page
More informationStat 155: solutions to midterm exam
Stat 155: solutions to midterm exam Michael Lugo October 21, 2010 1. We have a board consisting of infinitely many squares labeled 0, 1, 2, 3,... from left to right. Finitely many counters are placed on
More informationLesson 10.1 Skills Practice
Lesson 10.1 Skills Practice Location, Location, Location! Line Relationships Vocabulary Write the term or terms from the box that best complete each statement. intersecting lines perpendicular lines parallel
More information(1) 2 x 6. (2) 5 x 8. (3) 9 x 12. (4) 11 x 14. (5) 13 x 18. Soln: Initial quantity of rice is x. After 1st customer, rice available In the Same way
1. A shop stores x kg of rice. The first customer buys half this amount plus half a kg of rice. The second customer buys half the remaining amount plus half a kg of rice. Then the third customer also buys
More informationMATHEMATICS ON THE CHESSBOARD
MATHEMATICS ON THE CHESSBOARD Problem 1. Consider a 8 8 chessboard and remove two diametrically opposite corner unit squares. Is it possible to cover (without overlapping) the remaining 62 unit squares
More informationBRITISH COLUMBIA SECONDARY SCHOOL MATHEMATICS CONTEST, 2006 Senior Preliminary Round Problems & Solutions
BRITISH COLUMBIA SECONDARY SCHOOL MATHEMATICS CONTEST, 006 Senior Preliminary Round Problems & Solutions 1. Exactly 57.4574% of the people replied yes when asked if they used BLEU-OUT face cream. The fewest
More informationOCTAGON 5 IN 1 GAME SET
OCTAGON 5 IN 1 GAME SET CHESS, CHECKERS, BACKGAMMON, DOMINOES AND POKER DICE Replacement Parts Order direct at or call our Customer Service department at (800) 225-7593 8 am to 4:30 pm Central Standard
More informationOnce you get a solution draw it below, showing which three pennies you moved and where you moved them to. My Solution:
Arrange 10 pennies on your desk as shown in the diagram below. The challenge in this puzzle is to change the direction of that the triangle is pointing by moving only three pennies. Once you get a solution
More information