TRIANGLE RECTANGLE CERCLE
http://math.univ-lyon1.fr/irem/IMG/pdf/4e_trianglerectange_cercle_mediane.pdf
????? ??? ½½
13 13 et 10. Le cercle circonscrit de ce tri- squared terms is the average of (5 ? 4)2
Crux Mathematicorum
After one number is erased the average (arithmetic mean) of the remaining tangentes au cercle circonscrit au triangle ABC aux sommets B et C. Démontrer.
4 Chap G3 TRIANGLE RECTANGLE ET CERCLE. TRIANGLE
Triangle rectangle et cercle. 1) Triangle inscrit dans un cercle cercle circonscrit à un triangle Construction à l'équerre et à la règle graduée.
Editorial Board
M et N les deuxi`emes points d'intersection des cercles circonscrits de ?AOB Let ABC be a triangle with centroid G and medians mamb
Editorial Board
Le cercle inscrit du triangle ABC touche AB et AC en D et E Let ma mb and mc be the lengths of the medians of a triangle ABC with circum-.
Editorial Board
Soit E le centre du cercle inscrit du triangle ABC et soit F le Consider an arbitrary triangle ABC with medians mamb
Editorial Board
de son cercle inscrit. Soit P un point sur le cercle circonscrit du triangle AIB se situant `a l'intérieur du triangle ABC. Les lignes passant par P et
Crux Mathematicorum
Since medians are divided by the centroid in a 2 : 1 ratio we see this holds if and cercles circonscrits des triangles IBC
Crux Mathematicorum
Soit ABC un triangle acutangle et O le centre du cercle circonscrit au Let ABC be a triangle with orthocenter H. Let HM be the median and HS be.
Crux Mathematicorumis a problem-solving journal at the secondary and university undergraduate levels,
published online by the Canadian Mathematical Society. Its aim is primarily educational; it is not a research
journal. Online submission:Crux Mathematicorumest une publication de r´esolution de probl`emes de niveau secondaire et de premier
cycle universitaire publi´ee par la Soci´et´e math´ematique du Canada. Principalement de nature ´educative,
le Crux n"est pas une revue scientifique. Soumission en ligne:The Canadian Mathematical Society grants permission to individual readers of this publication to copy articles for
their own personal use. c CANADIAN MATHEMATICAL SOCIETY 2020. ALL RIGHTS RESERVED.ISSN 1496-4309 (Online)
La Soci´et´e math´ematique du Canada permet aux lecteurs de reproduire des articles de la pr´esente publication `a des
fins personnelles uniquement. c SOCI´ET´E MATH´EMATIQUE DU CANADA 2020 TOUS DROITS R´ESERV´ES. ISSN 1496-4309 (´electronique)Supported by / Soutenu par :Intact Financial Corporation
University of the Fraser Valley
Editorial Board
Editor-in-ChiefKseniya GaraschukUniversity of the Fraser Valley MathemAttic EditorsJohn McLoughlinUniversity of New BrunswickShawn GodinCairine Wilson Secondary School
Kelly PatonQuest University Canada
Olympiad Corner EditorsAlessandro VentulloUniversity of MilanAnamaria SavuUniversity of Alberta
Articles EditorRobert DawsonSaint Mary's University Associate EditorsEdward BarbeauUniversity of TorontoChris FisherUniversity of Regina
Edward WangWilfrid Laurier University
Dennis D. A. EppleBerlin, Germany
Magdalena GeorgescuBGU, Be'er Sheva, Israel
Chip CurtisMissouri Southern State University
Guest EditorsVasile RaduBirchmount Park Collegiate InstituteAaron SlobodinUniversity of Victoria
Andrew McEachernYork University
Editor-at-LargeBill SandsUniversity of Calgary
Managing EditorDenise CharronCanadian Mathematical SocietyIN THIS ISSUE / DANS CE NUM
ERO143 EditorialKseniya Garaschuk
144 In MemoriamRobert Dawson
145 MathemAttic: No. 14
145 Problems: MA66{MA70
149 Solutions: MA41{MA45
153 Problem Solving Vignettes: No. 11Shawn Godin
159 Olympiad Corner: No. 382
159 Problems: OC476{OC480
161 Solutions: OC451{OC455
169 Michel Bataille's Focus On:::Index
175 Problems: 4531{4540
181 Bonus Problems: B1{B25
185 Solutions: 4481{4490Crux Mathematicorum
Founding Editors / Redacteurs-fondateurs: Leopold Sauve & Frederick G.B. Maskell Former Editors / Anciens Redacteurs: G.W. Sands, R.E. Woodrow, Bruce L.R. Shawyer,Shawn Godin
Crux Mathematicorum
with Mathematical Mayhem Former Editors / Anciens Redacteurs: Bruce L.R. Shawyer, James E. Totten, Vaclav Linek,Shawn Godin
Editorial /143
EDITORIAL
Math in the Time of Coronavirus. While we nd ourselves adjusting many of our habits, changing our everyday activities due to various necessary restrictions, for me, engaging in mathematics oered a kind of repose and feeling of normalcy. I now teach via videoconferencing with a toddler in the background and hold research meetings over the phone while walking my dog. However, myCruxwork has changed very little, and I am indeed grateful for that. So if you too are looking for a mathematical distraction from the pandemic, look no further. This issue has a couple of non-standard features. First, Chris Fisher has put to- gether a comprehensive index for Michel Bataille'sFocus On:::column. There, you will nd columns arranged according to topics (Algebra, Geometry, Inequal- ities, Calculus, Combinatorics, Trigonometry) with citations and short content descriptions. Secondly, in this issue we have 25 Bonus Problems. While we have high standards for problem acceptance, we simply receive too many good prob- lems. As we try to balance each issue's problem oerings between authors and topics, we inevitably acquire a backlog. To ensure that no problem stays in the waiting-to-be-published stage for too long, we will be occasionally publishing a Bonus Problems list. This gives authors a chance to cite their problems, while providing our readers with more materials. Please note that this material is truly bonus: we will not be considering solutions to these problems.Stay healthy and safe.
Kseniya Garaschuk
Copyright©Canadian Mathematical Society, 2020
144/ In Memoriam
IN MEMORIAM
Fans of recreational mathematics will mourn the recent death of John H. Con- way. While many of his important discoveries in geometry and group theory can't be explained without many hours of lead-in, (even the grand antiprism is fairly mindboggling) and even the many of our readers will have experimented with Con- way's \Game of Life." Maybe you have read \On Numbers and Games", or the more popular \Winning Ways" which he coauthored with Elwyn Berlekamp and Richard Guy (by sad coincidence, all three authors of this tour de force have died within a little over a year of each other.) Maybe at some point you learned his \Doomsday Rule" for nding the day of the week of any day in history, or how to win at Nim or Hackenbush. However it happened, whatever it was: so many of us are the richer for John's time among us, and if you aren't yet - it's not too late! Randall Munroe's XKCD webcomic gave John the rare tribute of a memorial cartoon. Here are some snapshots by Mr. Munroe's generous permission. For the full animation, seehttps://imgs.xkcd.com/comics/rip_john_conway.gif Robert DawsonCrux Mathematicorum, Vol. 46(4), April 2020MathemAttic /145
MATHEMATTIC
No. 14
The problems featured in this section are intended for students at the secondary school level.Click here to submit solutions, comments and generalizations to anyproblem in this section.To facilitate their consideration, solutions should be received byJune 15, 2020.MA66. The 16 small squares shown in the diagram each have a side length of
1 unit. How many pairs of vertices (intersections of lines) are there in the diagram
whose distance apart is an integer number of units?MA67. Consider numbers of the form 10n+ 1, wherenis a positive inte-
ger. We shall call such a numbergrimeif it cannot be expressed as the product of two smaller numbers, possibly equal, both of which are of the form 10k+ 1, wherekis a positive integer. How many grime numbers are there in the sequence11;21;31;41;:::;981;991?
MA68.PQRSis a square. The pointsTandUare the midpoints ofQRand RSrespectively. The lineQScutsPTandPUatWandVrespectively. Whatfraction of the area of the squarePQRSis the area of the pentagonRTWV U?Copyright©Canadian Mathematical Society, 2020
146/ MathemAttic
MA69. The diagram shows two straight linesPRandQScrossing atO. What is the value ofx?MA70. Challengeborough's underground train network consists of six lines, p;q;r;s;t;u, as shown. Wherever two lines meet, there is a station which enables passengers to change lines. On each line, each train stops at every station. Jessica wants to travel from stationXto stationY. She does not want to use any line more than once, nor return to stationXafter leaving it, nor leave stationYhaving reached it. How many dierent routes, satisfying these conditions, can she choose?.Crux Mathematicorum, Vol. 46(4), April 2020
MathemAttic /147
Les problemes proposes dans cette section sont appropries aux etudiants de l'ecole sec- ondaire.Cliquez ici an de soumettre vos solutions, commentaires ougeneralisations aux problemes proposes dans cette section.Pour faciliter l'examen des solutions, nous demandons aux lecteurs de les faire parvenir
au plus tard le15 juin 2020. La redaction souhaite remercier Rolland Gaudet, professeur titulaire a la retraite al'Universite de Saint-Boniface, d'avoir traduit les problemes.MA66. Les 16 petits carres illustres ci-bas sont tous de c^otes 1 unite. Combien
de paires de sommets se trouvent a une distance entiere d'unites?MA67. Soient les entiers de la forme 10n+ 1, ounest entier positif.
Un tel nombre est ditremiers'il n'est pas possible de le representer comme produit de deux plus petits entiers possiblement egaux, toujours de la forme10k+ 1 oukserait entier positif. Combien de nombres remiers y a-t-il parmi
11;21;31;41;:::;981;991?
MA68.PQRSest un carre. Les pointsTetUsont les mi points deQR etRSrespectivement. La ligneQSintersectePTetPUenWetVrespective- ment. Quelle fraction de la surface du carrePQRSest occupee par le pentagone RTWV U?Copyright©Canadian Mathematical Society, 2020148/ MathemAttic
MA69. Le diagramme ci-bas montre deux lignesPRetQSintersectant en O. Quelle est la valeur dex?MA70. Le metro de Winnibourg consiste de six lignes,p;q;r;s;t;u, telles qu'indiquees ci-bas. Lorsque deux lignes se rencontrent, on y retrouve une station permettant de changer de ligne. De plus, le metro s'arr^ete a toute station sur sa ligne. Jehane desire voyager de la stationXa la stationY. Mais elle refuse d'utiliser une quelconque ligne plus qu'une fois, en plus de ne jamais revenir une deuxieme fois a la stationX, ni de quitter la stationYapres y ^etre arrivee. Determiner le nombre de telles routes dierentes.Crux Mathematicorum, Vol. 46(4), April 2020MathemAttic /149
MATHEMATTIC
SOLUTIONS
Statements of the problems in this section originally appear in 2019: 45(9), p. 495{496.MA41. The diagram shows the densest packing of seven circles in an equi-
lateral triangle.Determine the exact fraction of the area of the triangle that is covered by the circles. Originally from \Shaking Hands in Corner Brook and Other Math Problems" by Peter Booth, Bruce Shawyer and John Grant McLoughlin. We received 7 submissions, of which 6 were correct and complete. We present the solution by Dominique Mouchet, modied by the editor.Copyright©Canadian Mathematical Society, 2020150/ MathemAttic
On prend 1 comme longueur du c^ote du grand triangle equilateral. On noteraR le rayon des cercles. Exprimons la hauteurMHen fonction deR: •le triangleMKEa pour angles 906030 etEK=R. DoncME= 2R. •EIest la hauteur d'un triangle equilateral de c^ote 2R. DoncEI= 2Rp3
2 =Rp3: •IJ=JH= 2R. DoncMH=ME+EI+IJ+IH= 2R+Rp3 + 2R+ 2R=R6 +p3
CommeMH=p3
2 , on obtient R=p3 2 6 +p3 =p3 6p3233=2p3122
La fractionpde la surface du triangle couverte par les 7 triangles est donc: p=7R2p3 4 =28p3 134p3484
=7363
13p3120:6371:
MA42. Find all functions of the formf(x) =a+bxb+xwhereaandbare constants such thatf(2) = 2f(5) andf(0) + 3f(2) = 0. Originally Question 2 of 1980 J.I.R. McKnight Mathematics Scholarship Paper. We received 8 submissions, all of which were correct and complete. We present the solution by Jose Luis Daz-Barrero, modied by the editor.The condition gives us that
andab = 0: The above results in the nonlinear system of equations:8b2+ (10 +a)ba= 0;
6b24ab+ 2a= 0:(1)
The resultant of the above system is
4a(a+ 1)(19a300):
Crux Mathematicorum, Vol. 46(4), April 2020
MathemAttic /151
Substituting the zeros ofain the above we see that (a;b) = (0;0), (a;b) = (1;1) and (a;b) = (300=19;10=19) solve (1). Thus f(x) = 0; f(x) =1 +x1x;andf(x) =300 + 10x10 + 19x, are the only functions which satisfy the stated condition. MA43. Ifnis not divisible by 4, prove that 1n+ 2n+ 3n+ 4nis divisible by5 for any positive integern.
Adapted from Problem 2 of the 1901 Competition in Hungarian Problem Book 1 (1963). We received 13 submissions, all of which were correct and complete. We present the generalized solution by the Problem Solving Group from Missouri State University, modied by the editor. We will show, more generally, that ifpis any prime number andnis a positive integer then 1 n+ 2n+ 3n+:::+ (p1)n is a multiple ofpif and only ifnis not divisible byp1. It is well known that sincepis prime, there is an element2Zp(a primitive root) such that for alli2Zp;i=kfor some integerk, with 0kp2. Therefore p1X i=1i np2X k=0 knp2X k=0(n)k: Note thatn1 modpif and only ifnis a multiple ofp1.We prove both directions:
)(Contrapositive) Ifnis a multiple ofp1,n1 modpand p1X i=1i np2X k=0(n)kp160 modp:Thus our sum is not a multiple ofp.
(Ifnis not a multiple ofp1,n160 modp, son12Zp. Using the formula for nite geometric series (withb=n), we have p1X i=1i nmodpp2X k=0(n)kmodpbp11(b1)1modp0 modp:Thus our sum is a multiple ofp.
We observe the original problem considers the case whenp= 5.Copyright©Canadian Mathematical Society, 2020
152/ MathemAttic
MA44. Find the largest positive integer which divides all expressions of the formn5n3wherenis a positive integer. Justify your answer.Proposed by John McLoughlin.
We received 11 submissions, all of which were correct and complete. We present the joint solution by the Problem Solving Group from Missouri State University and Tianqi Jiang (solved independently), modied by the editor. First note that whenn= 2, we have that 2523= 24. Thus the number we seek must be a factor of 24. We show 3jn5n3. Asn5n3=n3(n+1)(n1) is divisible by three consecutive integers, it follows one of these numbers is a multiple of 3. Thus 3jn5n3.We show 8jn5n3by considering cases. Ifn= 2k, then
n5n3= (2k)3(2k+ 1)(2k1) = 8k3(2k+ 1)(2k1):
Thus 8jn5n3. Ifn= 2k+ 1, then
n5n3= (2k+ 1)3(2k+ 2)(2k) = (2k+ 1)322k(k+ 1):
As one ofkork+ 1 is even, it follows 8jn5n3.
Since 3 and 8 are relatively prime, 24jn5n3. As we established 24 as an upper bound, our proof is complete. MA45. A sequences1;s2;:::;snis harmonic if the reciprocals of the terms are in arithmetic sequence. Supposes1;s2;:::;s10are in harmonic sequence. Given s1= 1:2 ands10= 3:68, nds1+s2++s10.
Originally Question 11 of 1988 Illinois CTM, State Finals AA. We received 2 submissions, both correct and complete. We present the solution byDoddy Kastanya.
The arithmetic sequence of interest isa1;a2;:::;a10where s 1=1a1; s2=1a
2;:::;s10=1a
10: From the problem statement, we know thata1=11:2=56 anda10=13:68=100368 For the arithmetic sequence, there are eight items in betweena1anda10with equal spacing. Turning the denominator for these two values to 9936, we geta1=82809936 anda10=27009936 . The spacing between two numbers is6209936 . With this knowledge, the other items can be determined:a2=76609936 ,a3=70409936 , up toa9=33209936 The corresponding values ofs1throughs10can be easily calculated. Finally, the sum ofs1throughs10is calculated as 20.46.Crux Mathematicorum, Vol. 46(4), April 2020Shawn Godin /153
PROBLEM SOLVING
VIGNETTES
No. 11
Shawn Godin
Picking Representations
In many cases, a problem's solution is aided by thinking about the problem in a dierent way than it was originally presented. This may be by looking at a dierent, but related problem whose solution leads back to the original. We can also think about a problem dierently by choosing some other way to represent it. Analytic geometry is an example, where we can think of geometric problems algebraically or algebraic problems geometrically. When I thought about this topic the following problem came to mind: A gas powered go-cart is empty and on a track. Around the track are a number of gas cans. The total amount of gas in all the cans is equal to the amount of gas needed to go around the track once. Show that, no matter how the gas and cans are distributed, you can nd a place to start so that you can make it all the way around the track. I was introduced to this problem byCruxEditorial Board member Ed Barbeau at a workshop he did for teachers over 20 years ago. It's one of those problems you can convince yourself must work, but coming up with an airtight argument that convinces others is another thing. The key to the insightful solution that was given by Ed was to imagine that we are allowed to have a \negative" amount of gas in our tank. Then the graph of the gas in our tank versus the distance driven will be a piecewise linear function where all the pieces of the graph will have equal, negative slopes; there will be a step discontinuity at the location of each gas can; and when we have nished one trip around the track our tank will, again, be empty.APosition on trackGas in tank (A)BCDEndCopyright©Canadian Mathematical Society, 2020
154/ Problem Solving Vignettes
Thus if we draw the graph and nd the lowest point, this will be the place that we should start.DPosition on track(D)Gas in tank
ABCEnd
For example, in the graphs above, we are assuming that there are four gas cansA, B,C, andD. If we start at canA, we get the rst graph above on the previous page. Thus, we see that we should have started at canD, which would have given us the second graph above. Choosing the graphical representation not only helped make our argument clearer, it also gave way to the solution. Now, let's consider Problem 3 from the 2019Canadian Mathematical Olympiad:
Letmandnbe positive integers. A2m2ngrid of squares is coloured in the usual chessboard fashion. Find the number of ways of placing mncounters on the white squares, at most one counter per square, so that no two counters are on white squares that are diagonally adjacent. An example of a way to place the counters whenm= 2andn= 3is shown below.Since counters cannot be on diagonally adjacent squares, any 22 square drawn on the grid can only contain at most one counter. This suggests partitioning the grid into 22 squares, as in the diagram below. Since there are(2m)(2n)(2)(2) =mn22 squares on the grid, each of these squares will have exactly one counter.
Crux Mathematicorum, Vol. 46(4), April 2020
Shawn Godin /155
Notice that there are two congurations that the 22 squares can be in: either the counter can be in the upper corner (U), or the lower corner (L). When we look at two 22 squares beside each other we see thatUU,ULandLLare allquotesdbs_dbs47.pdfusesText_47[PDF] Médiane (avec lien qui marche)
[PDF] mediane , intervalle de confiance et moyenne
[PDF] Médiane ; statistique ; quartiles
[PDF] médiane calcul
[PDF] médiane d'un triangle
[PDF] médiane d'une série
[PDF] mediane d'un triangle
[PDF] mediane d'un triangle equilateral
[PDF] médiane d'un triangle rectangle
[PDF] médiane d'une série
[PDF] mediane d'une serie statistique
[PDF] médiane d'une série statistique continue
[PDF] Médiane de 32 chiffres urgent /!\
[PDF] médiane définition