USA Mathematical Talent Search Round 3 Solutions Year 27 Academic Year
|
|
- Alicia Long
- 5 years ago
- Views:
Transcription
1 /3/27. Fill i each space of the grid with either a or a so that all sixtee strigs of four cosecutive umbers across ad dow are distict. You do ot eed to prove that your aswer is the oly oe possible; you merely eed to fid a aswer that satisfies the costraits above. (Note: I ay other USAMTS problem, you eed to provide a full proof. Oly i this problem is a aswer without justificatio acceptable.) Solutio Let row be the -th row with a horizotal word ad let colum j be the j-th colum with a vertical word. (I particular, the loe i the top left corer is ot cosidered its ow row.) We use the otatio R i C j to deote the square i row i ad colum j. For example, we are give that R C 2 is a, while R C is ot give to us. There are oly two squares that itersect exactly oe word, the top left ad bottom right. Every other square is part of exactly two words. Therefore, if the bottom right square is a, the total umber of s i all 6 strigs is odd. But we ow that there are 32 total s, so the bottom right square must be a. This leaves colum 7 as the oly possible positio for the strig. There are two possible locatios for the strig : colum 5 ad colum 6. However, if colum 5 were, the there would be 5 strigs i the grid of the form xx (rows 2, 4, 5, 6, ad 7). But we ow there are oly 4 such strigs, so the strig must be placed i colum 6.
2 Looig at the grid, we see that all strigs of the form xx are accouted for (rows 2, 4, 7, ad 8). Thus, looig at colum 3, we see that R 3 C 3 is, looig at row 5, we see that R 5 C 5 is, ad looig at row 6, we see that R 6 C 5 is. After placig these, looig at colum 5 tells us that R 4 C 5 is. Hece, colum 5 is. Sice row 6 is, row 5 must be. Sice row 5 is, colum 8 must be. The colum 5 ad row 6 are both of the form x, which meas R 3 C 2 must be. Hece row 3 is, ad colum 2 must be. Sice row 8 is, we see that row 2 must be, which meas that row 4 must be. Colums 2 ad 3 are both of the form x, so looig at row tells us that R C 4 must be a. Fially, there are oly 7 strigs that start with a i our grid so far, so R C is a. This completes the grid.
3 2/3/27. Fames is playig a computer game with fallig two-dimesioal blocs. The playig field is 7 uits wide ad ifiitely tall with a bottom border. Iitially the etire field is empty. Each tur, the computer gives Fames a 3 solid rectagular piece of three uit squares. Fames must decide whether to oriet the piece horizotally or vertically ad which colum(s) the piece should occupy (3 cosecutive colums for horizotal pieces, colum for vertical pieces). Oce he cofirms his choice, the piece is dropped straight dow ito the playig field i the selected colums, stoppig all three of the piece s squares as soo as the piece hits either the bottom of the playig field or ay square from aother piece. All of the pieces must be cotaied completely iside the playig field after droppig ad caot partially occupy colums. If at ay time a row of 7 spaces is all filled with squares, Fames scores a poit. Ufortuately, Fames is playig i ivisible mode, which prevets him from seeig the state of the playig field or how may poits he has, ad he already arbitrarily dropped some umber of pieces without rememberig what he did with them or how may there were. For partial credit, fid a strategy that will allow Fames to evetually ear at least oe more poit. For full credit, fid a strategy for which Fames ca correctly aouce I have eared at least oe more poit ad ow that he is correct. Solutio Drop a horizotal piece occupyig colums 3, 4, ad 5. The drop two horizotal pieces occupyig colums, 2, ad 3 ad colums 5, 6, ad 7. We illustrate this i the diagram below (the ew pieces dropped at this step are i gray). Sice the three pieces we just dropped spa every colum, oe of latter two pieces is guarateed to be our highest piece o the board at this poit. Without loss of geerality, we assume the piece o the right is ow our highest piece (as i the diagram above). We repeat this patter. Whe we drop the horizotal piece occupyig colums 3, 4, ad 5, it will be
4 stopped by the horizotal piece occupyig colums 5, 6, ad 7 that we dropped previously. Each of our successive pieces will the be stopped by this piece. Thus, our board loos lie this: At this poit, Fames ca simply drop oe vertical piece i the middle ad exclaim I have eared at least oe more poit, as desired. Note: If Fames repeatedly dropped vertical pieces i each colum, he would evetually ear a poit, but he caot ow whe that has happeed.
5 3/3/27. For >, let a be the umber of zeroes that! eds with whe writte i base. Fid the maximum value of a. Solutio We claim that the maximum value of a is. I biary, 2! is writte as, which eds with 2 zero. So a 2 =, ad a 2 2 =. So to coclude, it suffices to show that a is at most for all 2 2. Notice that the umber of zeroes that! eds with whe writte i base is the same as the maximum power of that divides!. Fix ad write = p m, where p is some prime dividig ad m is relatively prime to p. The a is at most the largest power of p dividig!. By Legedre s formula, the maximum power of p dividig! is ν p (!) =. So we have a j= < p j j= j= p j p j = The sum o the far right is geometric, ad sums to p. Thus, Dividig through by gives a < (p ). a < (p ). Therefore, if has ay prime divisor greater tha 2, or is divisible by the square of ay prime, a < 2. So we see that the maximum value of a is 2. j= p j.
6 4/3/27. Let ABC be a triagle with AB < AC. Let the agle bisector of BAC meet BC at D, ad let M be the midpoit of BC. Let P be the foot of the perpedicular from B to AD. Exted BP to meet AM at Q. Show that DQ is parallel to AB. Solutio B P Q D M A L C Let BP meet AC at L. By costructio, AP B = AP L = 9 ad P AL = P AB sice AP is the agle bisector from A. So AP B ad AP L are similar. Sice they share side AP, we see that AP B is cogruet to AP L. So P is the midpoit of BL. Sice M is the midpoit of BC, this implies that BP M is similar to BLC with ratio 2, ad P M is parallel to AC. Sice P M is parallel to AC, triagles DP M ad DAC are similar. Hece, = DM. To AC DC fiish, it suffices to show MDQ is similar to MBA, which meas that it suffices to show that MD = MQ. DB QA Sice AQL = P QM ad P M is parallel to AL, we see that QP M is similar to QLA. Thus MQ = MD ad we just eed to show that =. QA AL DB AL Notice that if a b = c d 2, the a = b 2a c d 2c AC 2P M =. Applyig this to AC MD CD 2MD. But 2P M = LC because BP M BLC with ratio 2. So AC 2P M = AC LC = AL. = DM DC gives us Similarly, we have CM = BD + DM, so CD = BD + DM + DM = BD + 2DM. Thus, MD CD 2MD = MD BD.
7 Puttig these together, we have as desired. AL = MD BD, Note: This problem ad solutio were proposed by Xie Guo-Xue.
8 5/3/27. Let a, a 2,..., a be a sequece of itegers. Iitially, a =, a 2 = ad the remaiig umbers are. After every secod, we perform the followig process o the sequece: for i =, 2,..., 99, replace a i with a i + a i+, ad replace a with a + a. (All of this is doe simultaeously, so each ew term is the sum of two terms of the sequece from before ay replacemets.) Show that for ay iteger M, there is some idex i ad some time t for which a i > M at time t. Solutio Fix a positive iteger M. Throughout this solutio we cosider idices modulo, so a 2 is really just a 2. Let a, deote a after secods, with a beig the origial sequece (a = a, ). We wat to show that the for some ad we have a, > M. We have a, = a + a 2 a,2 = a, + a 2, = (a + a 2 ) + (a 2 + a 3 ) = a + 2a 2 + a 3 a,3 = a,2 + a 2,2 = (a + 2a 2 + a 3 ) + (a 2 + 2a 3 + a 4 ) = a + 3a 2 + 3a 3 + a 4. Cotiuig this patter, we claim that ( ) a, = a + a + + ( ) a for all. We show this by iductio o. It s clearly true for =. Now suppose it s true for ad we ll show it s true for +. By iductio, we have a, = a, + a +, ( ( ) ( ) ) ( ( ) = a + a + + a a + + a (( ) ) (( ) ( )) = a + + a a But by Pascals idetity, ( ) ( r + ( r ) = r). Hece, we have the result. Of course, most of these terms are actually. Crossig out the s we have (( ) ( ) ) a i, = a i + a + a i 2 i ( ) ( ) =. i (mod ) 2 i (mod ) (( 2 i ) a 2 + ( 2 ( 22 i ) ) a +3 + ) ) a 22 + Where the last equality follows because a = ad a 2 =. Let ω be a th root of uity. Suppose toward a cotradictio that for all i ad, a i, < M. The by the triagle iequality a i, ω i < M. i=
9 However, we ca rewrite this sum as a i, ω i = i= = ω i= ( = i (mod ) ( ) ω ( ) ω i ( ) )ω +. = By the biomial theorem, we ca rewrite this as 2 i (mod ) ω ( ( + ω ) ω( + ω ) ) = (ω ω 2 )( + ω ). Taig magitudes, we have a i, ω i = ω ω 2 + ω. i= ( ) But + ω >, so we ca mae this absolute value arbitrarily large by cosiderig large eough. This cotradicts a i, ω i < M, i= ad we see that we must have some time t ad idex i for which a i > M at time t. ω i Note: This problem ca be geeralized. It s false if is replaced by 2 or 3, but true for ay other replacemet, by the same argumet as above. c 26 Art of Problem Solvig Foudatio
1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationThe Structure of Z p when p is Prime
LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationSolutions for May. 3 x + 7 = 4 x x +
Solutios for May 493. Prove that there is a atural umber with the followig characteristics: a) it is a multiple of 007; b) the first four digits i its decimal represetatio are 009; c) the last four digits
More information(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.
SOLUTIONS Homewor 5 Due /6/19 Exercise. (a Cosider the set {a, b, c}. For each of the followig, (A list the objects described, (B give a formula that tells you how may you should have listed, ad (C verify
More informationSOLUTIONS TO PRISM PROBLEMS Junior Level 2014
SOLUTIONS TO PRISM PROBLEMS Juior Level 04. (B) Sice 50% of 50 is 50 5 ad 50% of 40 is the secod by 5 0 5. 40 0, the first exceeds. (A) Oe way of comparig the magitudes of the umbers,,, 5 ad 0.7 is 4 5
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationJoe Holbrook Memorial Math Competition
Joe Holbrook Memorial Math Competitio 8th Grade Solutios October 5, 07. Sice additio ad subtractio come before divisio ad mutiplicatio, 5 5 ( 5 ( 5. Now, sice operatios are performed right to left, ( 5
More informationProblem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient
Problem 4: Evaluate by egatig actually u-egatig its upper idex We ow that Biomial coefficiet r { where r is a real umber, is a iteger The above defiitio ca be recast i terms of factorials i the commo case
More informationInduction: Solutions
Writig Proofs Misha Lavrov Iductio: Solutios Wester PA ARML Practice March 6, 206. Prove that a 2 2 chessboard with ay oe square removed ca always be covered by shaped tiles. Solutio : We iduct o. For
More informationFirst selection test, May 1 st, 2008
First selectio test, May st, 2008 Problem. Let p be a prime umber, p 3, ad let a, b be iteger umbers so that p a + b ad p 2 a 3 + b 3. Show that p 2 a + b or p 3 a 3 + b 3. Problem 2. Prove that for ay
More informationLet us consider the following problem to warm up towards a more general statement.
Lecture 4: Sequeces with repetitios, distributig idetical objects amog distict parties, the biomial theorem, ad some properties of biomial coefficiets Refereces: Relevat parts of chapter 15 of the Math
More informationSEQUENCE AND SERIES NCERT
9. Overview By a sequece, we mea a arragemet of umbers i a defiite order accordig to some rule. We deote the terms of a sequece by a, a,..., etc., the subscript deotes the positio of the term. I view of
More information18th Bay Area Mathematical Olympiad. Problems and Solutions. February 23, 2016
18th Bay Area Mathematical Olympiad February 3, 016 Problems ad Solutios BAMO-8 ad BAMO-1 are each 5-questio essay-proof exams, for middle- ad high-school studets, respectively. The problems i each exam
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More information2011 Problems with Solutions
1. Argumet duplicatio The Uiversity of Wester Australia SCHOOL OF MATHEMATICS AND STATISTICS BLAKERS MATHEMATICS COMPETITION 2011 Problems with Solutios Determie all real polyomials P (x) such that P (2x)
More informationMath 4400/6400 Homework #7 solutions
MATH 4400 problems. Math 4400/6400 Homewor #7 solutios 1. Let p be a prime umber. Show that the order of 1 + p modulo p 2 is exactly p. Hit: Expad (1 + p) p by the biomial theorem, ad recall from MATH
More informationSolutions. tan 2 θ(tan 2 θ + 1) = cot6 θ,
Solutios 99. Let A ad B be two poits o a parabola with vertex V such that V A is perpedicular to V B ad θ is the agle betwee the chord V A ad the axis of the parabola. Prove that V A V B cot3 θ. Commet.
More informationSEQUENCES AND SERIES
Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationMath 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions
Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x
More informationSection 5.1 The Basics of Counting
1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of
More informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationSimple Polygons of Maximum Perimeter Contained in a Unit Disk
Discrete Comput Geom (009) 1: 08 15 DOI 10.1007/s005-008-9093-7 Simple Polygos of Maximum Perimeter Cotaied i a Uit Disk Charles Audet Pierre Hase Frédéric Messie Received: 18 September 007 / Revised:
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationFind a formula for the exponential function whose graph is given , 1 2,16 1, 6
Math 4 Activity (Due by EOC Apr. ) Graph the followig epoetial fuctios by modifyig the graph of f. Fid the rage of each fuctio.. g. g. g 4. g. g 6. g Fid a formula for the epoetial fuctio whose graph is
More informationChapter 2 The Solution of Numerical Algebraic and Transcendental Equations
Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said
More informationLecture 23 Rearrangement Inequality
Lecture 23 Rearragemet Iequality Holde Lee 6/4/ The Iequalities We start with a example Suppose there are four boxes cotaiig $0, $20, $50 ad $00 bills, respectively You may take 2 bills from oe box, 3
More informationUNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007
UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST First Roud For all Colorado Studets Grades 7- November, 7 The positive itegers are,,, 4, 5, 6, 7, 8, 9,,,,. The Pythagorea Theorem says that a + b =
More informationSummer High School 2009 Aaron Bertram
Summer High School 009 Aaro Bertram 3 Iductio ad Related Stuff Let s thik for a bit about the followig two familiar equatios: Triagle Number Equatio Square Number Equatio: + + 3 + + = ( + + 3 + 5 + + (
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationSubstitute these values into the first equation to get ( z + 6) + ( z + 3) + z = 27. Then solve to get
Problem ) The sum of three umbers is 7. The largest mius the smallest is 6. The secod largest mius the smallest is. What are the three umbers? [Problem submitted by Vi Lee, LCC Professor of Mathematics.
More information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationMath 220A Fall 2007 Homework #2. Will Garner A
Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative
More informationPROPERTIES OF AN EULER SQUARE
PROPERTIES OF N EULER SQURE bout 0 the mathematicia Leoard Euler discussed the properties a x array of letters or itegers ow kow as a Euler or Graeco-Lati Square Such squares have the property that every
More informationRandom Models. Tusheng Zhang. February 14, 2013
Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the
More information2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.
CHAPTER 2 The Real Numbers 2.. The Algebraic ad Order Properties of R Defiitio. A biary operatio o a set F is a fuctio B : F F! F. For the biary operatios of + ad, we replace B(a, b) by a + b ad a b, respectively.
More informationChapter 2. Periodic points of toral. automorphisms. 2.1 General introduction
Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad
More informationMa 530 Infinite Series I
Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li
More informationChapter Vectors
Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it
More informationMathematics Extension 1
016 Bored of Studies Trial Eamiatios Mathematics Etesio 1 3 rd ctober 016 Geeral Istructios Total Marks 70 Readig time 5 miutes Workig time hours Write usig black or blue pe Black pe is preferred Board-approved
More informationBaltic Way 2002 mathematical team contest
Baltic Way 00 mathematical team cotest Tartu, November, 00 Problems ad solutios 1. Solve the system of equatios a 3 + 3ab + 3ac 6abc = 1 b 3 + 3ba + 3bc 6abc = 1 c 3 + 3ca + 3cb 6abc = 1 i real umbers.
More informationProblem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t =
Mathematics Summer Wilso Fial Exam August 8, ANSWERS Problem 1 (a) Fid the solutio to y +x y = e x x that satisfies y() = 5 : This is already i the form we used for a first order liear differetial equatio,
More informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More information1 Last time: similar and diagonalizable matrices
Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationand each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.
MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
More informationObjective Mathematics
. If sum of '' terms of a sequece is give by S Tr ( )( ), the 4 5 67 r (d) 4 9 r is equal to : T. Let a, b, c be distict o-zero real umbers such that a, b, c are i harmoic progressio ad a, b, c are i arithmetic
More informationProof of Fermat s Last Theorem by Algebra Identities and Linear Algebra
Proof of Fermat s Last Theorem by Algebra Idetities ad Liear Algebra Javad Babaee Ragai Youg Researchers ad Elite Club, Qaemshahr Brach, Islamic Azad Uiversity, Qaemshahr, Ira Departmet of Civil Egieerig,
More informationM A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O
M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet
More informationINTEGRATION BY PARTS (TABLE METHOD)
INTEGRATION BY PARTS (TABLE METHOD) Suppose you wat to evaluate cos d usig itegratio by parts. Usig the u dv otatio, we get So, u dv d cos du d v si cos d si si d or si si d We see that it is ecessary
More informationHomework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is
Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of
More informationWHAT COOL MATH! JULY CURRICULUM INSPIRATIONS: Math for America DC:
CURRICULUM INSPIRATIONS: www.maa.org/ci Math for America DC: www.mathforamerica.org/dc Iovative Olie Courses: www.gdaymath.com Tato Tidbits: www.jamestato.com WHAT COOL MATH! CURIOUS MATHEMATICS FOR FUN
More informationANSWERS SOLUTIONS iiii i. and 1. Thus, we have. i i i. i, A.
013 ΜΑΘ Natioal Covetio ANSWERS (1) C A A A B (6) B D D A B (11) C D D A A (16) D B A A C (1) D B C B C (6) D C B C C 1. We have SOLUTIONS 1 3 11 61 iiii 131161 i 013 013, C.. The powers of i cycle betwee
More informationP1 Chapter 8 :: Binomial Expansion
P Chapter 8 :: Biomial Expasio jfrost@tiffi.kigsto.sch.uk www.drfrostmaths.com @DrFrostMaths Last modified: 6 th August 7 Use of DrFrostMaths for practice Register for free at: www.drfrostmaths.com/homework
More informationMATH 304: MIDTERM EXAM SOLUTIONS
MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest
More informationMathematical Foundations -1- Sets and Sequences. Sets and Sequences
Mathematical Foudatios -1- Sets ad Sequeces Sets ad Sequeces Methods of proof 2 Sets ad vectors 13 Plaes ad hyperplaes 18 Liearly idepedet vectors, vector spaces 2 Covex combiatios of vectors 21 eighborhoods,
More informationInequalities. Putnam Notes, Fall 2006 University of Utah
Iequalities Putam Notes, Fall 2006 Uiversity of Utah There are several stadard methods for provig iequalities, ad there are also some classical iequalities you should kow about. Method 1: Good old calculus
More informationSolutions to Problem Set 8
8.78 Solutios to Problem Set 8. We ow that ( ) ( + x) x. Now we plug i x, ω, ω ad add the three equatios. If 3 the we ll get a cotributio of + ω + ω + ω + ω 0, whereas if 3 we ll get a cotributio of +
More informationBertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.
Bertrad s Postulate Our goal is to prove the followig Theorem Bertrad s Postulate: For every positive iteger, there is a prime p satisfyig < p We remark that Bertrad s Postulate is true by ispectio for,,
More informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More informationThe Advantage Testing Foundation Solutions
The Advatage Testig Foudatio 202 Problem I the morig, Esther biked from home to school at a average speed of x miles per hour. I the afteroo, havig let her bike to a fried, Esther walked back home alog
More informationDifferent kinds of Mathematical Induction
Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}
More information4755 Mark Scheme June Question Answer Marks Guidance M1* Attempt to find M or 108M -1 M 108 M1 A1 [6] M1 A1
4755 Mark Scheme Jue 05 * Attempt to fid M or 08M - M 08 8 4 * Divide by their determiat,, at some stage Correct determiat, (A0 for det M= 08 stated, all other OR 08 8 4 5 8 7 5 x, y,oe 8 7 4xy 8xy dep*
More informationEnd-of-Year Contest. ERHS Math Club. May 5, 2009
Ed-of-Year Cotest ERHS Math Club May 5, 009 Problem 1: There are 9 cois. Oe is fake ad weighs a little less tha the others. Fid the fake coi by weighigs. Solutio: Separate the 9 cois ito 3 groups (A, B,
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationMath 312 Lecture Notes One Dimensional Maps
Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,
More informationSection 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations
Differece Equatios to Differetial Equatios Sectio. Calculus: Areas Ad Tagets The study of calculus begis with questios about chage. What happes to the velocity of a swigig pedulum as its positio chages?
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More informationHomework 2 January 19, 2006 Math 522. Direction: This homework is due on January 26, In order to receive full credit, answer
Homework 2 Jauary 9, 26 Math 522 Directio: This homework is due o Jauary 26, 26. I order to receive full credit, aswer each problem completely ad must show all work.. What is the set of the uits (that
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More information1+x 1 + α+x. x = 2(α x2 ) 1+x
Math 2030 Homework 6 Solutios # [Problem 5] For coveiece we let α lim sup a ad β lim sup b. Without loss of geerality let us assume that α β. If α the by assumptio β < so i this case α + β. By Theorem
More informationInternational Contest-Game MATH KANGAROO Canada, Grade 11 and 12
Part A: Each correct aswer is worth 3 poits. Iteratioal Cotest-Game MATH KANGAROO Caada, 007 Grade ad. Mike is buildig a race track. He wats the cars to start the race i the order preseted o the left,
More informationBINOMIAL COEFFICIENT AND THE GAUSSIAN
BINOMIAL COEFFICIENT AND THE GAUSSIAN The biomial coefficiet is defied as-! k!(! ad ca be writte out i the form of a Pascal Triagle startig at the zeroth row with elemet 0,0) ad followed by the two umbers,
More informationMATH spring 2008 lecture 3 Answers to selected problems. 0 sin14 xdx = x dx. ; (iv) x +
MATH - sprig 008 lecture Aswers to selected problems INTEGRALS. f =? For atiderivatives i geeral see the itegrals website at http://itegrals.wolfram.com. (5-vi (0 i ( ( i ( π ; (v π a. This is example
More informationSeptember 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1
September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationHomework 9. (n + 1)! = 1 1
. Chapter : Questio 8 If N, the Homewor 9 Proof. We will prove this by usig iductio o. 2! + 2 3! + 3 4! + + +! +!. Base step: Whe the left had side is. Whe the right had side is 2! 2 +! 2 which proves
More informationMath 299 Supplement: Real Analysis Nov 2013
Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality
More informationExam 2 CMSC 203 Fall 2009 Name SOLUTION KEY Show All Work! 1. (16 points) Circle T if the corresponding statement is True or F if it is False.
1 (1 poits) Circle T if the correspodig statemet is True or F if it is False T F For ay positive iteger,, GCD(, 1) = 1 T F Every positive iteger is either prime or composite T F If a b mod p, the (a/p)
More informationPROPERTIES OF SQUARES
PROPERTIES OF SQUARES The square is oe of the simplest two-dimesioal geometric figures. It is recogized by most pre-idergarters through programs such as Sesame Street, the comic strip Spoge Bob Square
More informationACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory
1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.
More informationAssignment 5: Solutions
McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece
More information1 Approximating Integrals using Taylor Polynomials
Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More information( ) = p and P( i = b) = q.
MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of
More informationChapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:
Chapter 7 COMBINATIONS AND PERMUTATIONS We have see i the previous chapter that (a + b) ca be writte as 0 a % a & b%þ% a & b %þ% b where we have the specific formula for the biomial coefficiets: '!!(&)!
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More information