IMAR Problema 1. Fie P un punct situat în interiorul unui triunghi ABC. Dreapta AP intersectează
|
|
- Moris Lindsey
- 5 years ago
- Views:
Transcription
1 IMAR 017 Problema 1 Fie P u puct situat î iteriorul uui triughi ABC Dreapta AP itersectează latura BC î puctul D ; dreapta BP itersectează latura CA î puctul E ; iar dreapta CP itersectează latura AB î puctul F Cercul de diametru BC itersectează cercul de diametru AD î puctele a şi a ; cercul de diametru CA itersectează cercul de diametru BE î puctele b şi b ; iar cercul de diametru AB itersectează cercul de diametru CF î puctele c şi c Arătaţi că puctele a, a, b, b, c, c sut cociclice Problema Fie u umăr atural eul Petru fiecare umăr atural eul k, otăm cu r k restul împărţirii lui la k Arătaţi că r k > Problema 3 O mulţime specială este o mulţime de umere aturale impare, astfel îcât iciu elemet al său u divide u alt elemet şi orice submulţime de cardial 3 coţie u elemet care divide suma celorlalte două O mulţime specială este maximală, dacă ea u este coţiută î icio altă mulţime specială Determiaţi umărul de elemete pe care îl poate avea o mulţime specială maximală Problema 4 Fie u umăr îtreg mai mare sau egal cu 3 şi fie P mulţimea tuturor -goaelor plaare simple), care u au icio pereche de laturi disticte paralele sau de-a lugul uei aceleiaşi drepte Petru fiecare poligo P di P, fie f P ) umărul miim de triughiuri formate de drepte-suport ale laturilor lui P, a căror reuiue acoperă poligoul P Determiaţi valoarea maximă pe care o poate lua f P ), câd P parcurge mulţimea P
2 IMAR 017 Solutios Problem 1 Let P be a poit i the iterior of the triagle ABC, ad let the lies AP, BP, CP meet the sides BC, CA, AB respectively at the poits D, E, F Let the circles o diameters BC ad AD meet at poits a ad a ; the circles o diameters CA ad BE meet at poits b ad b ; ad the circles o diameters AB ad CF meet at poits c ad c Show that the poits a, a, b, b, c, c lie o a circle Solutio Let A, B, C ad P have positio vectors a, b, c ad p = α α + + γ a + α + + γ b + γ α + + γ c, where α,, γ are the barycetric coordiates of P The D has positio vector + γ b + γ + γ c, so the circles o diameters BC ad AD have equatios r b) r c) = 0 ad r a) r respectively; alteratively, but equivaletly, the latter reads + γ b r a) r b) + γr a) r c) = 0 γ ) + γ c = 0, Ay liear combiatio of the two is the equatio of a circle or straight lie through a ad a I particular, the liear combiatio formed by multiplyig the first equatio by γ ad the secod by α, ad addig, is αr a) r b) + γr b) r c) + γαr c) r a) = 0 The symmetry of this equatio shows that this circle or, possibly, straight lie) also passes through b, b ad c, c Fially, otice that α + γ + γα is positive whe P lies iside the triagle ABC, so the locus is ideed a circle cetred at the poit whose barycetric coordiates are α + γ), γ + α), γα + ), respectively Remark The coditio for the locus to be a straight lie is α + γ + γα = 0, which implies that P lies o a ellipse through A, B ad C that has tagets at A, B ad C parallel to BC, CA ad AB, respectively Problem Let be a positive iteger For each positive iteger k, let r k deote the remaider leaves upo divisio by k Prove that r k > Solutio Let m =, ad split the set of itegers 1 through ito m + 1 pairwise disjoit subsets J 0, J 1,, J m, where J k cosists of all umbers of the form k l + 1), l = 0,, / k+1 1/
3 If j is a member of J k, the r j k, uless j = k i which case r j = 0 If k > 3 = m, the J k cosists of k aloe, so it cotributes othig to sum i questio Cosequetly, r k = r j k J k 1) = j J k = m + 1) 3 m +1 1) > k k+1 1 > > k k+1 3 ) Remarks The lower boud i the statemet is rough for the sum S = r k uder cosideratio It has bee cojectured that S c for some suitable positive costat c, but it is ot eve kow whether this is the case for ifiitely may values of It has, however, bee show that S > /13 ) for ifiitely may values of Clearly, S ) = 1)/ It has also bee cojectured that S /4 for all but fiitely may values of, but this questio is still ope as well Problem 3 A special set is a set of positive odd itegers o elemet of which divides aother, ad each 3-elemet subset of which has a member dividig the sum of the other two A special set is maximal if it is cotaied i o other special set Determie the umber of elemets a maximal special set may have Solutio Leavig aside the trivial case {1}, a maximal special set may have oly 3, 4 or 5 elemets Begi by oticig that if a < b are positive odd itegers, ad a does ot divide b, the a, b ad b a form a special set, so a maximal special set has at least three elemets At the other extreme, a special set i particular, oe that is maximal has at most five elemets The proof relies o the three facts below: 1) If a > b > c form a special set, the b + c is ot divisible by a This is because a is odd, ad b + c is a positive eve iteger less tha a ) If a > b are members of a special set S, the at most oe of the members of S less tha b does ot divide the sum a + b Suppose, if possible, c ad d are distict members of S less the b, either of which divides the sum a + b By 1), a divides either b + c or b + d, so a + c ad a + d are both divisible by b The c d = a + c) a + d) is a positive iteger less tha b ad divisible by b a cotradictio 3) If a, b, c, d form a special set, ad a + b ad a + c are both divisible by d, the b + c is ot divisible by d Otherwise, d would divide a + b) + a + c) b + c) = a, which is impossible, sice d is odd ad does ot divide a We are ow i a positio to prove that a special set has at most five elemets Suppose, if possible, a 1, a, a 3, b 1, b, b 3 are pairwise distict members of a special set We may ad will assume a 1 > a > a 3 > max b 1, b, b 3 ) Fix a pair of distict idices i ad j, ad write {i, j, k} = {1,, 3} By ), some b divides both a i + a k ad a j + a k, by 3), that b does ot divide a i + a j, so, with referece agai to ), it is the uique b ot dividig a i + a j Cosequetly, the three b s may be labelled so that b i ad b j both divide a i + a j, while b k does ot, {i, j, k} = {1,, 3}
4 By 1), a 1 does ot divide a 3 +b, ad sice b does ot divide a 1 +a 3, it follows that a 1 +b is divisible by a 3 Similarly, a + b 1 is divisible by a 3, ad hece so is a 1 + b ) + a + b 1 ) = a 1 +a )+b 1 +b ) Fially, sice a 1 +a is divisible by a 3, by ), so is b 1 +b, i cotradictio with 1) Cosequetly, a special set i particular, oe that is maximal has at most five elemets Next, we show that 5-elemet special sets actually exist Clearly, the umbers 3, 5, 7 form a special set To elarge this set to a 4-elemet special set by adjoiig a positive odd iteger k, otice that k divides o -term sum from {3, 5, 7}, to ifer that k satisfies oe of the two systems of liear cogrueces below: k mod ) k mod 3) k mod 7) k mod 5) or k mod ) k mod 5) k mod 7) k mod 3) By the Chiese remaider theorem, each of these systems has ifiitely may solutios; i each case, two solutios differ by a multiple of = 10 The least positive solutio of the former is 193, ad the least positive solutio of the latter is 107 To elarge the set {3, 5, 7, 193} to a 5-elemet special set by adjoiig a positive odd iteger k, otice agai that k divides o -term sum from {3, 5, 7, 193}, to ifer that k satisfies the system of liear cogrueces k mod ) k mod 5) k mod 7) ; k mod 3) k mod 193) clearly, 3 ad 5 both divide k As before, the Chiese remaider theorem settles the case; icidetally, the least positive solutio is 3467, ad all five umbers are prime Similarly, the set {3, 5, 7, 107} exteds to a 5-elemet special set by adjoiig ay positive odd iteger k satisfyig the system of liear cogrueces k mod ) k mod 3) k mod 7) ; k mod 5) k mod 107) clearly, 3 ad 5 both divide k +107 I this case, the least positive solutio is = Remark The 5-elemet special sets below are obtaied i the same way: {3, 5, 13, 17, 1767 = }, {3, 5, 17, 97, = }, {3, 7, 11, 35 = 5 47, 6309}, {3, 7, 11, 437 = 19 3, 6095 = } We ow show that the special set cosistig of 3, 5, 13, 17 is maximal Suppose, if possible, that k is a positive odd iteger such that 3, 5, 13, 17, k form a special set It is easily see that k divides o -term sum from {3, 5, 13, 17} 3
5 We first show that k + 5 is divisible by 3 if ad oly if k + 3 is divisible by 5; sice oe holds, so does the other If k + 5 is divisible by 3, the k + 13 is ot, so k + 3 is divisible by 13 It follows that k + 5 is ot divisible by 13, so k + 13 is divisible by 5, showig that k + 3 is ideed divisible by 5 Coversely, if k + 3 is divisible by 5, the k + 17 is ot, so k + 5 is divisible by 17 It follows that k + 3 is ot divisible by 17, so k + 17 is divisible by 3, showig that k + 5 is ideed divisible by 3 By the precedig, k + 3 is divisible by 13, ad k + 5 is divisible by 17 The former implies that k + 17 is ot divisible by 13, ad the latter implies that k + 13 is ot divisible by 17 To derive a cotradictio, recall that k divides o -term sum from {3, 5, 13, 17}; i particular, it does ot divide the sum Fially, we show that the special set cosistig of 11, 15, 51 is maximal Suppose, if possible, that k is a positive odd iteger such that 11, 15, 51, k form a special set, ad otice that k divides o -term sum from {11, 15, 51} Cosideratio of 15, 51 ad k shows that k is divisible by 3 It the follows that of the two umbers 15 ad 51, oe divides k + 11, so k + 15 ad k + 51 are both divisible by 11, which is clearly impossible Problem 4 Let be a iteger greater tha or equal to 3, ad let P be the collectio of all plaar simple) -gos o two distict sides of which are parallel or lie alog some lie For each member P of P, let f P ) be the least cardial a cover of P by triagles formed by lies of support of sides of P may have Determie the largest value f P ) may achieve, as P rus through P Solutio The required maximum is This follows from the fact that the image of f cosists of the first positive itegers Iduct o to show that f P ) for all P i P The base case = 3 is clear If P is covex, the f P ) = 1, sice P has three sides whose lies of support form a triagle that covers P simply exted two o-adjacet sides till they meet to obtai a polygo with fewer sides ad proceed iductively If P is ot covex, cosider a vertex v iterior to the covex hull of P Exted oe of the sides through v beyod v till it first meets agai the boudary, to split P ito a 1 -go P 1 ad a -go P, where Hece f P ) f 1 P 1 )+f P ) 1 + Give a positive iteger m, we ow describe a polygo P = a 0 a 1 a 1 i P such that f P ) = m Cosider a parallelogram aa 0 a 1 a m+1, let a,, a m be iterior poits of the triagle a 0 a 1 a m+1 formig, alog with a 1 ad a m+1, a m + 1)-poit cofiguratio i strictly covex positio, ad let a m+,, a 1 be iterior poits of the triagle aa 0 a m+1 formig, alog with a 0 ad a m+1, a m)-poit cofiguratio i strictly covex positio; clearly, it is always possible to choose the latter so that P has o parallel sides For coveiece, a triagle formed by the lies of support of three sides of P will be called a peritriagle To show that f P ) m, otice that, for each idex i i the rage 1 through m, coverig the midpoit of the side a i a i+1 of P requires a peritriagle i lyig i the same half-plae as a 0 relative to the lie a i a i+1, oe side of which cotais the lie-segmet a i a i+1 Sice, for distict idices i ad j i the rage 1 through m, the lie a i a i+1 separates a 0 ad the midpoit of the lie-segmet a j a j+1, the k are pairwise distict, so f P ) m To coclude that f P ) = m, otice that P is covered by the m peritriagles formed by the lies a 0 a 1, a i a i+1 ad a i+1 a i+, where i rus from 1 through m 4
The 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 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 informationSOLVED EXAMPLES
Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as
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 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 information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
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 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 informationDisjoint Systems. Abstract
Disjoit Systems Noga Alo ad Bey Sudaov Departmet of Mathematics Raymod ad Beverly Sacler Faculty of Exact Scieces Tel Aviv Uiversity, Tel Aviv, Israel Abstract A disjoit system of type (,,, ) is a collectio
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 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 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 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 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 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 informationHomework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger.
Homewor 1 Solutios Math 171, Sprig 2010 Hery Adams The exercises are from Foudatios of Mathematical Aalysis by Richard Johsobaugh ad W.E. Pfaffeberger. 2.2. Let h : X Y, g : Y Z, ad f : Z W. Prove that
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More information1. 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 informationPROBLEM SET 5 SOLUTIONS. Solution. We prove that the given congruence equation has no solutions. Suppose for contradiction that. (x 2) 2 1 (mod 7).
PROBLEM SET 5 SOLUTIONS 1 Fid every iteger solutio to x 17x 5 0 mod 45 Solutio We rove that the give cogruece equatio has o solutios Suose for cotradictio that the equatio x 17x 5 0 mod 45 has a solutio
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 information[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]
[ 47 ] Number System 1. Itroductio Pricile : Let { T ( ) : N} be a set of statemets, oe for each atural umber. If (i), T ( a ) is true for some a N ad (ii) T ( k ) is true imlies T ( k 1) is true for all
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 information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
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 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 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 informationStochastic Matrices in a Finite Field
Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices
More informationJEE(Advanced) 2018 TEST PAPER WITH SOLUTION (HELD ON SUNDAY 20 th MAY, 2018)
JEE(Advaced) 08 TEST PAPER WITH SOLUTION (HELD ON SUNDAY 0 th MAY, 08) PART- : JEE(Advaced) 08/Paper- SECTION. For ay positive iteger, defie ƒ : (0, ) as ƒ () j ta j j for all (0, ). (Here, the iverse
More informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
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 informationPart A, for both Section 200 and Section 501
Istructios Please write your solutios o your ow paper. These problems should be treated as essay questios. A problem that says give a example or determie requires a supportig explaatio. I all problems,
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 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 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 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 informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
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 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 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 informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
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 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 informationINEQUALITIES BJORN POONEN
INEQUALITIES BJORN POONEN 1 The AM-GM iequality The most basic arithmetic mea-geometric mea (AM-GM) iequality states simply that if x ad y are oegative real umbers, the (x + y)/2 xy, with equality if ad
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 informationNBHM QUESTION 2007 Section 1 : Algebra Q1. Let G be a group of order n. Which of the following conditions imply that G is abelian?
NBHM QUESTION 7 NBHM QUESTION 7 NBHM QUESTION 7 Sectio : Algebra Q Let G be a group of order Which of the followig coditios imply that G is abelia? 5 36 Q Which of the followig subgroups are ecesarily
More informationCardinality Homework Solutions
Cardiality Homework Solutios April 16, 014 Problem 1. I the followig problems, fid a bijectio from A to B (you eed ot prove that the fuctio you list is a bijectio): (a) A = ( 3, 3), B = (7, 1). (b) A =
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
More informationSNAP Centre Workshop. Basic Algebraic Manipulation
SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)
More informationM17 MAT25-21 HOMEWORK 5 SOLUTIONS
M17 MAT5-1 HOMEWORK 5 SOLUTIONS 1. To Had I Cauchy Codesatio Test. Exercise 1: Applicatio of the Cauchy Codesatio Test Use the Cauchy Codesatio Test to prove that 1 diverges. Solutio 1. Give the series
More informationLemma Let f(x) K[x] be a separable polynomial of degree n. Then the Galois group is a subgroup of S n, the permutations of the roots.
15 Cubics, Quartics ad Polygos It is iterestig to chase through the argumets of 14 ad see how this affects solvig polyomial equatios i specific examples We make a global assumptio that the characteristic
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
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 informationCoffee Hour Problems of the Week (solutions)
Coffee Hour Problems of the Week (solutios) Edited by Matthew McMulle Otterbei Uiversity Fall 0 Week. Proposed by Matthew McMulle. A regular hexago with area 3 is iscribed i a circle. Fid the area of a
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
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 informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationInternational Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL Christos Nikolaidis TOPIC NUMBER THEORY
Iteratioal Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL TOPIC NUMBER THEORY METHODS OF PROOF. Couterexample - Cotradictio - Pigeohole Priciple Strog mathematical iductio 2 DIVISIBILITY....
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More informationpage Suppose that S 0, 1 1, 2.
page 10 1. Suppose that S 0, 1 1,. a. What is the set of iterior poits of S? The set of iterior poits of S is 0, 1 1,. b. Give that U is the set of iterior poits of S, evaluate U. 0, 1 1, 0, 1 1, S. The
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
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 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 informationLECTURE 11: POSTNIKOV AND WHITEHEAD TOWERS
LECTURE 11: POSTNIKOV AND WHITEHEAD TOWERS I the previous sectio we used the techique of adjoiig cells i order to costruct CW approximatios for arbitrary spaces Here we will see that the same techique
More informationMathematical Induction
Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a
More informationUSA Mathematical Talent Search Round 3 Solutions Year 27 Academic Year
/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
More informationMATH 205 HOMEWORK #2 OFFICIAL SOLUTION. (f + g)(x) = f(x) + g(x) = f( x) g( x) = (f + g)( x)
MATH 205 HOMEWORK #2 OFFICIAL SOLUTION Problem 2: Do problems 7-9 o page 40 of Hoffma & Kuze. (7) We will prove this by cotradictio. Suppose that W 1 is ot cotaied i W 2 ad W 2 is ot cotaied i W 1. The
More informationInjections, Surjections, and the Pigeonhole Principle
Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs
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 informationON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS
ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary
More informationLecture XVI - Lifting of paths and homotopies
Lecture XVI - Liftig of paths ad homotopies I the last lecture we discussed the liftig problem ad proved that the lift if it exists is uiquely determied by its value at oe poit. I this lecture we shall
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 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 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 informationSolution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1
Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity
More informationOn a Smarandache problem concerning the prime gaps
O a Smaradache problem cocerig the prime gaps Felice Russo Via A. Ifate 7 6705 Avezzao (Aq) Italy felice.russo@katamail.com Abstract I this paper, a problem posed i [] by Smaradache cocerig the prime gaps
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 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 informationChapter 1. Complex Numbers. Dr. Pulak Sahoo
Chapter 1 Complex Numbers BY Dr. Pulak Sahoo Assistat Professor Departmet of Mathematics Uiversity Of Kalyai West Begal, Idia E-mail : sahoopulak1@gmail.com 1 Module-2: Stereographic Projectio 1 Euler
More informationOn Topologically Finite Spaces
saqartvelos mecierebata erovuli aademiis moambe, t 9, #, 05 BULLETIN OF THE GEORGIAN NATIONAL ACADEMY OF SCIENCES, vol 9, o, 05 Mathematics O Topologically Fiite Spaces Giorgi Vardosaidze St Adrew the
More informationAppendix F: Complex Numbers
Appedix F Complex Numbers F1 Appedix F: Complex Numbers Use the imagiary uit i to write complex umbers, ad to add, subtract, ad multiply complex umbers. Fid complex solutios of quadratic equatios. Write
More informationb i u x i U a i j u x i u x j
M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here
More informationDefinitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.
Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,
More informationWBJEE Answer Keys by Aakash Institute, Kolkata Centre
WBJEE - 7 Aswer Keys by, Kolkata Cetre MATHEMATICS Q.No. B A C B A C A B 3 D C B B 4 B C D D 5 D A B B 6 C D B B 7 B C C A 8 B B A A 9 A * B D C C B B D A A D B B C B 3 A D D D 4 C B A A 5 C B B B 6 C
More informationJEE ADVANCED 2013 PAPER 1 MATHEMATICS
Oly Oe Optio Correct Type JEE ADVANCED 0 PAPER MATHEMATICS This sectio cotais TEN questios. Each has FOUR optios (A), (B), (C) ad (D) out of which ONLY ONE is correct.. The value of (A) 5 (C) 4 cot cot
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
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 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More informationAPPENDIX F Complex Numbers
APPENDIX F Complex Numbers Operatios with Complex Numbers Complex Solutios of Quadratic Equatios Polar Form of a Complex Number Powers ad Roots of Complex Numbers Operatios with Complex Numbers Some equatios
More informationSequences I. Chapter Introduction
Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which
More informationCALCULUS BASIC SUMMER REVIEW
CALCULUS BASIC SUMMER REVIEW NAME rise y y y Slope of a o vertical lie: m ru Poit Slope Equatio: y y m( ) The slope is m ad a poit o your lie is, ). ( y Slope-Itercept Equatio: y m b slope= m y-itercept=
More informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
More informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty
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 informationPUTNAM TRAINING, 2008 COMPLEX NUMBERS
PUTNAM TRAINING, 008 COMPLEX NUMBERS (Last updated: December 11, 017) Remark. This is a list of exercises o Complex Numbers Miguel A. Lerma Exercises 1. Let m ad two itegers such that each ca be expressed
More informationThe Boolean Ring of Intervals
MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,
More informationMath 140A Elementary Analysis Homework Questions 1
Math 14A Elemetary Aalysis Homewor Questios 1 1 Itroductio 1.1 The Set N of Natural Numbers 1 Prove that 1 2 2 2 2 1 ( 1(2 1 for all atural umbers. 2 Prove that 3 11 (8 5 4 2 for all N. 4 (a Guess a formula
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More information