Geodesics on Regular Polyhedra with Endpoints at the Vertices

Size: px
Start display at page:

Download "Geodesics on Regular Polyhedra with Endpoints at the Vertices"

Transcription

1 Arnol Mth J (2016) 2: DOI /s z RESEARCH CONTRIBUTION Geoesis on Regulr Polyher with Enpoints t the Verties Dmitry Fuhs 1 To Sergei Thnikov on the osion of his 60th irthy Reeive: 3 Otoer 2015 / Revise: 23 Otoer 2015 / Aepte: 3 Mrh 2016 / Pulishe online: 23 Mrh 2016 Institute for Mthemtil Sienes (IMS), Stony Brook University, NY 2016 Astrt In reent work of Dvis et l (2016), the uthors onsier geoesis on regulr polyher whih egin n en t verties (n o not touh other verties) The ses of regulr tetrher n ues re onsiere The uthors prove tht (in these ses) geoesi s ove never egins t ens t the sme vertex n ompute the proilities with whih geoesi emnting from given vertex ens t every other vertex The min oservtion of the present rtile is tht there exists lose reltion etween the prolem onsiere in Dvis et l (2016) n the prolem of lssifition of lose geoesis on regulr polyher onsiere in rtiles (Fuhs n Fuhs, Mos Mth J 7: , 2007; Fuhs, Geom Dei 170: , 2014) This pproh yiels ifferent proofs of result of Dvis et l (2016) n permits to otin similr results for regulr other n iosher (in prtiulr, suh geoesi never ens where it egins) Keywors Regulr polyher Geoesi segments Enpoints 1 Introution A geoesi on surfe of polyheron is, y efinition, lolly shortest urve whih my trnsverslly interset eges, ut oes not ontin verties esies, possily, the enpoints A geoesi is stright within the fes n t every intersetion with n ege, the opposite ngles forme y the geoesi n the ege (in the two fes tthe to this ege) re equl If geoesi hs two enpoints t verties, we ll it simple geoesi segment (A simple geoesi segment is llowe to hve self-intersetions) B Dmitry Fuhs fuhs@mthuviseu 1 University of Cliforni, Dvis, USA

2 202 D Fuhs v u Fig 1 The plnr evelopment of regulr tetrheron All the results of Dvis et l (2016) mentione elow re given with proofs, whih, t lest in the se of the ue, re not the sme s in Dvis et l (2016) 2 Tetrheon Theorem 21 (Dvis et l 2016, Corollry 38) A simple geoesi segment strting t some vertex of regulr tetrheron never ens t the sme vertex n ens t the three other verties with equl proilities 1 Proof Consier the plnr evelopment of the regulr tetrheron with verties,,, (see Fig 1) A line segment in this plne strting t the leftmost point mrke n ening t one of the verties within the ngle shown in Fig 1 hs the form p u + q v where p n q re non-negtive integers Nmely, it ens t vertex mrke, ifp n q re oth even, t vertex mrke, ifp is o n q is even, t vertex mrke, ifp is even n q is o, n t vertex mrke, ifp n q re oth o It orrespons to simple geoesi segment if n only if p n q re reltively prime; in prtiulr, if it ens t, then it oes not orrespon to ny simple geoesi segment Theorem follows 3 Otheron Theorem 31 A simple geoesi segment strting t some vertex of regulr otheron never ens t the sme vertex It ens t the opposite vertex with the proility 1 4 n t the eh of the other verties with the proility 3 16 Proof Figure 2 shows regulr otrheron (left) n its plnr evelopment The ltter is multivlue in the sense tht every vertex,, is, tully, two verties ( 1 Here n elow, speking of the proility with whih geoesi segment with given strting point ens t some vertex, I men the symptoti proility for the set of geoesis of oune length

3 Geoesis on Regulr Polyher with Enpoints t the Verties 203 v u Fig 2 A regulr otheron n its (multivlue) plnr evelopment Fig 3 The segment p u + q v overe y the tringles of the tiling represents n, et), every ege represents four eges ( represents,,, n, et), n every tringulr fe represents eight tringulr fes Thus every line in the plne emnting, sy, from the leftmost vertex n not following the eges represents (polygonl) line on the surfe of the otheron, ut following this line we my nee to reple y, y, n/or y For positive reltively prime p, q, vetor p u + q v represents simple geoesi segment on the surfe ening t or,ifp q 0 mo 3, ening t or,if p q 1 mo 3 n ening t or,ifp q 1mo 3 The most importrnt thing we nee to prove is tht it never ens t Let p > q > 0, GCD(p, q) = 1, p q mo 3 Figure 3 shows prllelogrm spnne y p u n q v (on the piture, p = 13, q = 7) We onsier the igonl segment overe y tringles of the tiling The verties re lele oring to the following rules The left lower tringle is ; if two tringles shre sie, then the two verties not on this sie re lele y the sme letter, one with prime, one without prime, like n, n, et We re intereste in verties lele y or The form sequene,,,, where the neighors re verties of the tringles shring sie not ontining these verties These sies re mrke (enirle) on the piture We nee to show tht the numer of mrke sies is o It is 13 on the piture Let us onsier the generl se Let r = q The following segments re mrke (oorintes re given in the p q sis {u, v}):

4 204 D Fuhs (0, 1) (1, 0) (1, 2) (2, 1) ([r, [r+1) ([r + 1, [r) ([r+2,[r) ([r+2,[r+1) ([r+3,[r+1) ([2r+2,[2r) ([2r+2,[2r+1) ([2r+3,[2r+1) ([2r+4,[2r) ([4r+3,[4r+1) ([4r+4,[4r) ([4r+5, [4r) ([4r+5, [4r + 1)([5r+5, [5r) ([5r+5, [5r+1) ([(p q 4)r+p q 3, [(p q 4)r+1) ([(p q 4)r + p q 2, [(p q 4)r) ([(p q 2)r+p q 3, [(p q 2)r+1) ([(p q 2)r+p q 2, [(p q 2)r) ([(p q 2)r+p q + 3, [(p + q 2)) ([(p q 1)r+p q 1, [(p + q 1)r+1) ([(p q 1)r+p q, [(p q 1)r+1) ([(p q 1)r+p q, [(p q 1)r) ([(p q)r+p q 1, [(p q)r) ([(p q)r+p q, [(p q)r 1) [the lst segment is, tully, (p 1, q) (p, q 1) In this listing of segments, we see the lternting of groups of prllel segments n stir-like hins The groups of prllel segments ontin, respetively, [r+1, [4r+[2r+1,,[(p q 2)r (p q 4)r+1, q [(p q 1)r items; the stir-like hins ontin, respetively, 2([2r [r) + 1, 2([5r [4r) + 1,,2([(p + q 1)r [(p + q 2)r+1items The totl is [r+[2r [4r+[5r [(p q 2)r+[(p q 1)r+q where the numer of 1 s is p q A simple omputtion shows tht this sum is ([ 3 p [ q ) , whih is ertinly o 3 3 We rrive t the following result No simple geoesi segment emnting from ens t If this segment is etermine y reltively prime p, q, then it ens t

5 Geoesis on Regulr Polyher with Enpoints t the Verties 205 v u Fig 4 The ue n plnr evelopment of the segment p u + q v with p = 3, q = 2 if n only if p q mo 3; symptotilly, the proility of this event is 1 4 The remining 3 4 is eqully (euse of the symmetry) istriute etween,,, n 4 Cue We egin this setion with formulting some results from Fuhs n Fuhs (2007) n Fuhs (2014) We lel the verties of the ue s shown in Fig 4, left An ritrry urve on the surfe of the ue not pssing through the verties my e presente s urve in the plne furnishe with the stnr squre lttie, n there rises leling of the verties long this urve Importnt remrk: verties of the lttie whose oorintes hve the sme prity get the lels from the set {,,, }, n verties whose oorintes hve ifferent prities get the lels from the set {,,, } (mrke in Fig 4) Stright segments in the plnr evelopment orrespon to geoesis on the surfe of the ue A segment [(, ), ( + p, + q) with integer, n reltively prime p, q orrespons to simple geoesi segment on the ue joining two verties of the ue, n ll suh geoesi segments n e otine in this wy If we shift the segment to prllel segment strting t the point (ε, 0) with smll ε>0, then we get geoesi on the ue, whih my e (n, tully, lwys is) not lose: the segment in Fig 4, right, shifte little it to the right, orrespons to geoesi strting ner n ening ner To get lose geoesi, we nee to repet the segment on the plne ertin (miniml) numer n C (p, q) of times Theorem 41 (Fuhs n Fuhs 2007, Theorem 44) (1) For ll p, q, n C (p, q) = 2, 3, or 4; (2) if p n q re oth o, then n C (p, q) = 3; (3) if one of p, q is even, then n C (p, q) = 2 or 4 To formulte neessry result from Fuhs (2014), we nee some nottion Let S e the set of pirs (p, q) of integers suh tht p is even, q is o, n p, q o not

6 206 D Fuhs Fig 5 The funtion V ( p, q) hve ommon ivisors > 1 [thus, for exmple, (0, 1), (2, 1) S,ut(0, 3) / S The group Ɣ 2 of integer 2 2 mtries ongruent to the ientity moulo 2 ts trnsitively in S; it is known tht Ɣ 2 is free group with genertors A = [ 12 01, B = [ Let H Ɣ 2 e the sugroup generte y A 2, B 2, ABA n BAB It is prove in Fuhs (2014) tht H hs inex 3 in Ɣ 2 n not norml Theorem 42 [Fuhs 2014, Theorem 22, Prt (3) The group H hs two orits in S, n these orits re {n C (p, q) = 2} n {n C (p, q) = 4} The symptoti size of the seon of these orits is twie the symptoti size of the first one We will nee here some itionl fts For every pir (p, q) of reltively prime integers the segment p u+q v etermines simple geoesi segment on the surfe of the ue strting t Denote y V (p, q) the enpoint of this geoesi For exmple, Fig 4 shows tht V (3, 2) = A smll tle of vlues of the funtion V is shown in Fig 5 The funtion V hs lot of symmetries, oth visile n hien First of ll, if, for given (p, q), the pir (p, q ) is one of ( p, q), (p, q), (q, p) or ( q, p), then V (p, q ) is esily relte to V (p, q) For exmple, if q > 0, then V ( p, q) is otine from V (p, q) y the trnsformtion, ( inee, ll we nee for this trnsition, is the replement of the squre y the squre ) et It is importnt tht ll these trnsformtions preserve (n ) To esrie some other symmetries, onsier the following two mtries from H: C = B 2 = [ 10 41, D = AB 1 A = [ 34 23

7 Geoesis on Regulr Polyher with Enpoints t the Verties 207 Fig 6 To proof of Lemm 43 Lemm 43 (1) V (C( p, q)) = V ( p, q) (2) The trnsformtion V ( p, q) V (D(p, q)) ts in the following wy:,, Proof Essentilly, this theorem is prove in Fuhs (2014) The proof is ontine in Fig 6 [orrowe from Fuhs (2014) We n reple the stnr funmentl squre of the lttie y one of the prllelogrms (0, 0), (1, 4), (1, 5), (0, 1) or (0, 0), (3, 2), (7, 5), (4, 3) The leling of verties shown in Fig 6 provies lels for the verties of these two prllelogrm In the left igrm, it is gin, n this proves Prt (1) In the right igrm, it is whih mens tht the whole leling is trnsforme y the rottion of the ue whih mps the fe into the fe This is the rottion of the ue y 120 roun the igonl, s esrie in Prt (2) Now we formulte the min result of this setion Theorem 44 Consier simple geoesi segment on the ue emnting from the vertex ; suppose tht it orrespons to some reltively prime p, q (1) (Dvis et l 2016, Corollry 515, Theorem 517) The vertex V (p, q) nnot e the sme s ; it is one of,, with the proility 4 27 for eh; one of,, with the proility 1 9 for eh n it is with the proility 2 9 (2) The vertex V (p, q) is one of,,, if n C (p, q) = 4, is one of,,,if n C (p, q) = 3, n is,ifn C (p, q) = 2 Proof As in the proof of Theorem 31, the min thing we nee to prove is tht simple geoesi segment eginning t vertex of the ue never ens t the sme vertex It is ler from the remrk in the eginning of the setion tht if it the enpoint of the simple geoesi segment oinies with the eginning, then this segment orrespons to the pir (p, q) with p, q eing oth o

8 208 D Fuhs Fig 7 Verties of the iosheron f e e f Return to Theorem 44 Notie tht for ritrry reltively prime o p, q there exists sequene of trnsformtions esrie efore n in Lemm 43 whih reue the pir (p, q) to (1, 1) Inee, omining the trnsformtion C with sign hnges n swpping of oorintes, we n reue the generl se to the se of positive p, q with p < q < 2p [esies the se (p, q) = (1, 1); n this trnsformtion oes not inrese the minimum of solute vlues p, q Then we pply D; (p, q) eomes (4p 3q, 3p 2q), n 2p < 2q < 4p p < 3p 2q < q, or 3p 2q < p; thus the minimum of p, q ereses Repeting this proeure suffiiently mny times, we rrive t (p, q) = (1, 1) Thus n ritrry (p, q) n e otine from (1, 1) y hin of inverse trnsformtion, n, sine V (1, 1) = n no one of our trnsformtions onnets with nything else, we n onlue tht V (p, q) = Finlly, onsier n ritrry simple geoesi segment σ strtingt; let its plnr evelopment is p u + q v Tke the geoesi segment σ prllel to σ n strting t point of the ege lose to Ifσ ens t,, or then repet σ 4 times; if σ ens t,,or, then repet σ 3 times; n if σ ens t, then repet σ 2 times Oviously, we get geoesi on the ue ening t point of one of the eges,, or But in the lst two ses, to get lose geoesi, we nee to repet lrey repete 4, or 3, or 2 times σ 3 more times, whih woul men tht n C (p, q) = 12 or 9, or 6, in ontrition to Prt (3) of Theorem 41 Thus, the geoesi σ repete 4, or 3, or 2 times is lose n we onlue tht if V (p, q) is,,or, then n C (p, q) = 4, if V (p, q) is, or, then n C (p, q) = 3 n if V (p, q) is, then n C (p, q) = 2 Theorem 44 follows 5 Iosheron We lel the 12 verties of the regulr iosheron s shown in Fig 7 Notie tht, here prime mens opposite : the vertex is opposite to, the vertex is opposite to, et

9 Geoesis on Regulr Polyher with Enpoints t the Verties 209 f e f f e f e e f e f e f Fig 8 To proof of Lemm 53 As in the ses of the tetrheron n the otheron, geoesis on the surfe of the iosheron (not pssing through the verties) re presente y stright lines in the plne furnishe y the stnr tringulr tiling A non-self-repeting lose geoesi orrespons to the segment p u + q v with reltively prime integer p, q repete ertin numer n I (p, q) of times Theorem 51 (Fuhs n Fuhs 2007, Theorem 61) The numer n I (p, q) tkes vlues 2, 3, n 5 The following informtions of the funtion n I re ontine in Fuhs (2014) Let S = {(p, q) Z Z GCD(p, q) = 1}/(p, q) ( p, q) The group PSL(2, Z) = SL(2, Z)/{±I } trnsitively ts in S LetH e the sugroup of PSL(2, Z) generte y K = [ Theorem 52 (Fuhs 2014, Theorem 31), L = [ , n M = [ (1) The group H hs inex 10 in P SL(2, Z) (2) The group H hs three orits in S, n these orits re {n I (p, q) = 2}, {n I (p, q) = 3}, n {n I (p, q) = 5} (3) The symptoti sizes of these three orits re relte s 2:3:5 As in the se of the ue, we nee some enhnement of Theorem 52 For reltively prime p, q,letv (p, q) e the vertex of the iosheron, whih is the enpoint of the simple geoesi segment eginning t n orresponing to the plnr segment p u + q v Lemm 53 (1) V (M(p, q)) = V (p, q) (2) The trnsformtion V (p, q) V (K (p, q)) is the rottion of the iosheron e f, e f (3) The trnsformtion V (p, q) V (L(p, q)) is the rottion of the iosheron inverse to the rottion in (2): f e, f e

10 210 D Fuhs Proof As in the proof of Lemm 43, the trnsformtions onsist in replements of the funmentl tringle of the tiling s shown in Fig 8 [mostly orrowe from Fuhs (2014) We see tht the trnsformtions in Prts (1) (3) of lemm orrespon to the replement of the funmentl tringle (showe in Fig 8) y, respetively, tringles,, n f(rwn in olfe lines in Fig 8) Lemm follows The following sttement is the min result of this setion Theorem 54 Consier simple geoesi segment on the iosheron emnting from the vertex n ening t some vertex h; suppose tht it orrespons to some reltively prime p, q (1) The vertex h nnot e (2) The vertex h is one of the verties,,, e, f with the proilitiy 1 for eh; 10 it is one of the verties,,, e, f with the sme proility 3 for eh; n 50 it is with the proility 1 5 (3) The vertex h is one of,,, e, f,ifn I (p, q) = 5, it is one of,,, e, f,if n I (p, q) = 3, n it is,ifn! (p, q) = 2 Proof A to Lemm 53 tht V ( p, q) is lso otine from V (p, q) y rottion, this time e f, e f Consier the group H SL(2; Z) generte y the mtries I, K, L, M The tion of the group H in S hs three orits, the inverse imges the orits of H in S with resopet to the projetion S S Lemm 53, supplemente y the lst remrk, shows tht the sets T A ={(p, q) V (p, q) A with A eing one of the four sets {}, {,,, e, f }, {,,, e, f }, { } re invrint with respet to H Sine the three orits re represente y the pirs (1, 1), (1, 2), (1, 4) n V (1, 1) =, V (1, 2) =, V 1, 4) =, We onlue tht T {} is empty, while the three other sets T A re the three orits of H, n Theorem 52 yiels ientifitions T {,,,e, f } = n 1 I (5), T {,,,e, f } = n 1 I (3), T { } = n 1! (2) Theorem follows 6 Doeheron I nnot sy muh out this se Still it seems very likely tht on the surfe of the oeheron there exist simple geoesi segments whih egin n en t the sme vertex By mens of omputer experiments, I hve foun vriety of likely exmples of this The shortest one is shown in Fig 9 It is 22-gonl geoesi emnting from the vertex A uner the ngle α = tn φ 57φ with the sie (φ = 1618 is the golen rtio) Aoring to the omputer, the istne etween the 22n ege n A oes not exee (we ssume tht the length of the sie is 1) In the sme

11 Geoesis on Regulr Polyher with Enpoints t the Verties 211 α A Fig 9 A simple geoesi segment AA on the oeheron time, the istnes etween the other eges n other verties re never less thn 002 This mens tht in the unlikely event tht the 22n ege oes not hit A, we n mke it ening t A y smll perturtion of α Aknowlegments This work ws one uring my sty t the Mx Plnk Institute in Bonn I m grteful to the Institute for its hospitlity Referenes Dvis, D, Dos, V, Tru, C, Yng, J: Geoesi trjetories on regulr polyher Disrete Mth (2016) (To pper) Fuhs, D: Perioi illir trjetories in regulr polygons n lose geoesis on regulr polyher Geom Dei 170, (2014) Fuhs, D, Fuhs, E: Close geoesis on regulr polyher Mos Mth J 7, (2007)

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite! Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

Section 1.3 Triangles

Section 1.3 Triangles Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into

More information

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply

More information

Proportions: A ratio is the quotient of two numbers. For example, 2 3

Proportions: A ratio is the quotient of two numbers. For example, 2 3 Proportions: rtio is the quotient of two numers. For exmple, 2 3 is rtio of 2 n 3. n equlity of two rtios is proportion. For exmple, 3 7 = 15 is proportion. 45 If two sets of numers (none of whih is 0)

More information

CIT 596 Theory of Computation 1. Graphs and Digraphs

CIT 596 Theory of Computation 1. Graphs and Digraphs CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege

More information

Lecture 2: Cayley Graphs

Lecture 2: Cayley Graphs Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re

More information

#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS

#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS #A42 INTEGERS 11 (2011 ON THE CONDITIONED BINOMIAL COEFFICIENTS Liqun To Shool of Mthemtil Sienes, Luoyng Norml University, Luoyng, Chin lqto@lynuedun Reeived: 12/24/10, Revised: 5/11/11, Aepted: 5/16/11,

More information

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

More information

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then. pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm

More information

Section 2.1 Special Right Triangles

Section 2.1 Special Right Triangles Se..1 Speil Rigt Tringles 49 Te --90 Tringle Setion.1 Speil Rigt Tringles Te --90 tringle (or just 0-60-90) is so nme euse of its ngle mesures. Te lengts of te sies, toug, ve very speifi pttern to tem

More information

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233, Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.

More information

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 ) Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us

More information

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6 CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized

More information

6.5 Improper integrals

6.5 Improper integrals Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =

More information

Lesson 2.1 Inductive Reasoning

Lesson 2.1 Inductive Reasoning Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,

More information

MCH T 111 Handout Triangle Review Page 1 of 3

MCH T 111 Handout Triangle Review Page 1 of 3 Hnout Tringle Review Pge of 3 In the stuy of sttis, it is importnt tht you e le to solve lgeri equtions n tringle prolems using trigonometry. The following is review of trigonometry sis. Right Tringle:

More information

Trigonometry Revision Sheet Q5 of Paper 2

Trigonometry Revision Sheet Q5 of Paper 2 Trigonometry Revision Sheet Q of Pper The Bsis - The Trigonometry setion is ll out tringles. We will normlly e given some of the sides or ngles of tringle nd we use formule nd rules to find the others.

More information

Lecture 8: Abstract Algebra

Lecture 8: Abstract Algebra Mth 94 Professor: Pri Brtlett Leture 8: Astrt Alger Week 8 UCSB 2015 This is the eighth week of the Mthemtis Sujet Test GRE prep ourse; here, we run very rough-n-tumle review of strt lger! As lwys, this

More information

Now we must transform the original model so we can use the new parameters. = S max. Recruits

Now we must transform the original model so we can use the new parameters. = S max. Recruits MODEL FOR VARIABLE RECRUITMENT (ontinue) Alterntive Prmeteriztions of the pwner-reruit Moels We n write ny moel in numerous ifferent ut equivlent forms. Uner ertin irumstnes it is onvenient to work with

More information

Lesson 2.1 Inductive Reasoning

Lesson 2.1 Inductive Reasoning Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,

More information

Monochromatic Plane Matchings in Bicolored Point Set

Monochromatic Plane Matchings in Bicolored Point Set CCCG 2017, Ottw, Ontrio, July 26 28, 2017 Monohromti Plne Mthings in Biolore Point Set A. Krim Au-Affsh Sujoy Bhore Pz Crmi Astrt Motivte y networks interply, we stuy the prolem of omputing monohromti

More information

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)

More information

Comparing the Pre-image and Image of a Dilation

Comparing the Pre-image and Image of a Dilation hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity

More information

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106 8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly

More information

Mathematical Proofs Table of Contents

Mathematical Proofs Table of Contents Mthemtil Proofs Tle of Contents Proof Stnr Pge(s) Are of Trpezoi 7MG. Geometry 8.0 Are of Cirle 6MG., 9 6MG. 7MG. Geometry 8.0 Volume of Right Cirulr Cyliner 6MG. 4 7MG. Geometry 8.0 Volume of Sphere Geometry

More information

SOME COPLANAR POINTS IN TETRAHEDRON

SOME COPLANAR POINTS IN TETRAHEDRON Journl of Pure n Applie Mthemtis: Avnes n Applitions Volume 16, Numer 2, 2016, Pges 109-114 Aville t http://sientifivnes.o.in DOI: http://x.oi.org/10.18642/jpm_7100121752 SOME COPLANAR POINTS IN TETRAHEDRON

More information

GM1 Consolidation Worksheet

GM1 Consolidation Worksheet Cmridge Essentils Mthemtis Core 8 GM1 Consolidtion Worksheet GM1 Consolidtion Worksheet 1 Clulte the size of eh ngle mrked y letter. Give resons for your nswers. or exmple, ngles on stright line dd up

More information

I 3 2 = I I 4 = 2A

I 3 2 = I I 4 = 2A ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents

More information

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1) Green s Theorem Mth 3B isussion Session Week 8 Notes Februry 8 nd Mrh, 7 Very shortly fter you lerned how to integrte single-vrible funtions, you lerned the Fundmentl Theorem of lulus the wy most integrtion

More information

A Study on the Properties of Rational Triangles

A Study on the Properties of Rational Triangles Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn

More information

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t

More information

In right-angled triangles the square on the side subtending the right angle is equal to the squares on the sides containing the right angle.

In right-angled triangles the square on the side subtending the right angle is equal to the squares on the sides containing the right angle. Mth 3329-Uniform Geometries Leture 06 1. Review of trigonometry While we re looking t Eulid s Elements, I d like to look t some si trigonometry. Figure 1. The Pythgoren theorem sttes tht if = 90, then

More information

Introduction to Olympiad Inequalities

Introduction to Olympiad Inequalities Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

More information

2.4 Theoretical Foundations

2.4 Theoretical Foundations 2 Progrmming Lnguge Syntx 2.4 Theoretil Fountions As note in the min text, snners n prsers re se on the finite utomt n pushown utomt tht form the ottom two levels of the Chomsky lnguge hierrhy. At eh level

More information

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 6: Minigoals Towards Simplifying and Rewriting Expressions MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

SEMI-EXCIRCLE OF QUADRILATERAL

SEMI-EXCIRCLE OF QUADRILATERAL JP Journl of Mthemtil Sienes Volume 5, Issue &, 05, Pges - 05 Ishn Pulishing House This pper is ville online t http://wwwiphsiom SEMI-EXCIRCLE OF QUADRILATERAL MASHADI, SRI GEMAWATI, HASRIATI AND HESY

More information

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005 RLETON UNIVERSIT eprtment of Eletronis ELE 2607 Swithing iruits erury 28, 05; 0 pm.0 Prolems n Most Solutions, Set, 2005 Jn. 2, #8 n #0; Simplify, Prove Prolem. #8 Simplify + + + Reue to four letters (literls).

More information

Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap

Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap Prtile Physis Mihelms Term 2011 Prof Mrk Thomson g X g X g g Hnout 3 : Intertion y Prtile Exhnge n QED Prof. M.A. Thomson Mihelms 2011 101 Rep Working towrs proper lultion of ey n sttering proesses lnitilly

More information

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of: 22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)

More information

Geometry of the Circle - Chords and Angles. Geometry of the Circle. Chord and Angles. Curriculum Ready ACMMG: 272.

Geometry of the Circle - Chords and Angles. Geometry of the Circle. Chord and Angles. Curriculum Ready ACMMG: 272. Geometry of the irle - hords nd ngles Geometry of the irle hord nd ngles urriulum Redy MMG: 272 www.mthletis.om hords nd ngles HRS N NGLES The irle is si shpe nd so it n e found lmost nywhere. This setion

More information

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

If the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows:

If the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows: Reltions. Solutions 1. ) true; ) true; ) flse; ) true; e) flse; f) true; g) flse; h) true; 2. 2 A B 3. Consier ll reltions tht o not inlue the given pir s n element. Oviously, the rest of the reltions

More information

Identifying and Classifying 2-D Shapes

Identifying and Classifying 2-D Shapes Ientifying n Clssifying -D Shpes Wht is your sign? The shpe n olour of trffi signs let motorists know importnt informtion suh s: when to stop onstrution res. Some si shpes use in trffi signs re illustrte

More information

STRAND I: Geometry and Trigonometry. UNIT 32 Angles, Circles and Tangents: Student Text Contents. Section Compass Bearings

STRAND I: Geometry and Trigonometry. UNIT 32 Angles, Circles and Tangents: Student Text Contents. Section Compass Bearings ME Jmi: STR I UIT 32 ngles, irles n Tngents: Stuent Tet ontents STR I: Geometry n Trigonometry Unit 32 ngles, irles n Tngents Stuent Tet ontents Setion 32.1 ompss erings 32.2 ngles n irles 1 32.3 ngles

More information

MTH 505: Number Theory Spring 2017

MTH 505: Number Theory Spring 2017 MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c

More information

Proving the Pythagorean Theorem

Proving the Pythagorean Theorem Proving the Pythgoren Theorem W. Bline Dowler June 30, 2010 Astrt Most people re fmilir with the formul 2 + 2 = 2. However, in most ses, this ws presented in lssroom s n solute with no ttempt t proof or

More information

F / x everywhere in some domain containing R. Then, + ). (10.4.1)

F / x everywhere in some domain containing R. Then, + ). (10.4.1) 0.4 Green's theorem in the plne Double integrls over plne region my be trnsforme into line integrls over the bounry of the region n onversely. This is of prtil interest beuse it my simplify the evlution

More information

THREE DIMENSIONAL GEOMETRY

THREE DIMENSIONAL GEOMETRY MD THREE DIMENSIONAL GEOMETRY CA CB C Coordintes of point in spe There re infinite numer of points in spe We wnt to identif eh nd ever point of spe with the help of three mutull perpendiulr oordintes es

More information

Total score: /100 points

Total score: /100 points Points misse: Stuent's Nme: Totl sore: /100 points Est Tennessee Stte University Deprtment of Computer n Informtion Sienes CSCI 2710 (Trnoff) Disrete Strutures TEST 2 for Fll Semester, 2004 Re this efore

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More information

GRUPOS NANTEL BERGERON

GRUPOS NANTEL BERGERON Drft of Septemer 8, 2017 GRUPOS NANTEL BERGERON Astrt. 1. Quik Introution In this mini ourse we will see how to ount severl ttriute relte to symmetries of n ojet. For exmple, how mny ifferent ies with

More information

Eigenvectors and Eigenvalues

Eigenvectors and Eigenvalues MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, Lecture 15: Equations for Deterministic Automata Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined

More information

CHEM1611 Answers to Problem Sheet 9

CHEM1611 Answers to Problem Sheet 9 CEM1611 Answers to Prolem Sheet 9 1. Tutomers re struturl isomers whih re relte y migrtion of hyrogen tom n the exhnge of single on n jent oule on. Compoun Tutomer 2 2 2 2 2 2 2 2 2 2 2 2. () Whih pir

More information

Factorising FACTORISING.

Factorising FACTORISING. Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will

More information

Lecture 4: Graph Theory and the Four-Color Theorem

Lecture 4: Graph Theory and the Four-Color Theorem CCS Disrete II Professor: Pri Brtlett Leture 4: Grph Theory n the Four-Color Theorem Week 4 UCSB 2015 Through the rest of this lss, we re going to refer frequently to things lle grphs! If you hen t seen

More information

STRAND J: TRANSFORMATIONS, VECTORS and MATRICES

STRAND J: TRANSFORMATIONS, VECTORS and MATRICES Mthemtics SKE: STRN J STRN J: TRNSFORMTIONS, VETORS nd MTRIES J3 Vectors Text ontents Section J3.1 Vectors nd Sclrs * J3. Vectors nd Geometry Mthemtics SKE: STRN J J3 Vectors J3.1 Vectors nd Sclrs Vectors

More information

arxiv: v2 [math.co] 31 Oct 2016

arxiv: v2 [math.co] 31 Oct 2016 On exlue minors of onnetivity 2 for the lss of frme mtrois rxiv:1502.06896v2 [mth.co] 31 Ot 2016 Mtt DeVos Dryl Funk Irene Pivotto Astrt We investigte the set of exlue minors of onnetivity 2 for the lss

More information

Trigonometry and Constructive Geometry

Trigonometry and Constructive Geometry Trigonometry nd Construtive Geometry Trining prolems for M2 2018 term 1 Ted Szylowie tedszy@gmil.om 1 Leling geometril figures 1. Prtie writing Greek letters. αβγδɛθλµπψ 2. Lel the sides, ngles nd verties

More information

A Primer on Continuous-time Economic Dynamics

A Primer on Continuous-time Economic Dynamics Eonomis 205A Fll 2008 K Kletzer A Primer on Continuous-time Eonomi Dnmis A Liner Differentil Eqution Sstems (i) Simplest se We egin with the simple liner first-orer ifferentil eqution The generl solution

More information

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4 Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one

More information

Part I: Study the theorem statement.

Part I: Study the theorem statement. Nme 1 Nme 2 Nme 3 A STUDY OF PYTHAGORAS THEOREM Instrutions: Together in groups of 2 or 3, fill out the following worksheet. You my lift nswers from the reding, or nswer on your own. Turn in one pket for

More information

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their

More information

Bisimulation, Games & Hennessy Milner logic

Bisimulation, Games & Hennessy Milner logic Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory

More information

2. VECTORS AND MATRICES IN 3 DIMENSIONS

2. VECTORS AND MATRICES IN 3 DIMENSIONS 2 VECTORS AND MATRICES IN 3 DIMENSIONS 21 Extending the Theory of 2-dimensionl Vectors x A point in 3-dimensionl spce cn e represented y column vector of the form y z z-xis y-xis z x y x-xis Most of the

More information

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014 S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown

More information

f (x)dx = f(b) f(a). a b f (x)dx is the limit of sums

f (x)dx = f(b) f(a). a b f (x)dx is the limit of sums Green s Theorem If f is funtion of one vrible x with derivtive f x) or df dx to the Fundmentl Theorem of lulus, nd [, b] is given intervl then, ording This is not trivil result, onsidering tht b b f x)dx

More information

m m m m m m m m P m P m ( ) m m P( ) ( ). The o-ordinte of the point P( ) dividing the line segment joining the two points ( ) nd ( ) eternll in the r

m m m m m m m m P m P m ( ) m m P( ) ( ). The o-ordinte of the point P( ) dividing the line segment joining the two points ( ) nd ( ) eternll in the r CO-ORDINTE GEOMETR II I Qudrnt Qudrnt (-.+) (++) X X - - - 0 - III IV Qudrnt - Qudrnt (--) - (+-) Region CRTESIN CO-ORDINTE SSTEM : Retngulr Co-ordinte Sstem : Let X' OX nd 'O e two mutull perpendiulr

More information

Solutions to Problem Set #1

Solutions to Problem Set #1 CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors

More information

Discrete Structures Lecture 11

Discrete Structures Lecture 11 Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.

More information

SECTION A STUDENT MATERIAL. Part 1. What and Why.?

SECTION A STUDENT MATERIAL. Part 1. What and Why.? SECTION A STUDENT MATERIAL Prt Wht nd Wh.? Student Mteril Prt Prolem n > 0 n > 0 Is the onverse true? Prolem If n is even then n is even. If n is even then n is even. Wht nd Wh? Eploring Pure Mths Are

More information

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment

More information

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

Exercise sheet 6: Solutions

Exercise sheet 6: Solutions Eerise sheet 6: Solutions Cvet emptor: These re merel etended hints, rther thn omplete solutions. 1. If grph G hs hromti numer k > 1, prove tht its verte set n e prtitioned into two nonempt sets V 1 nd

More information

12.4 Similarity in Right Triangles

12.4 Similarity in Right Triangles Nme lss Dte 12.4 Similrit in Right Tringles Essentil Question: How does the ltitude to the hpotenuse of right tringle help ou use similr right tringles to solve prolems? Eplore Identifing Similrit in Right

More information

Math Lesson 4-5 The Law of Cosines

Math Lesson 4-5 The Law of Cosines Mth-1060 Lesson 4-5 The Lw of osines Solve using Lw of Sines. 1 17 11 5 15 13 SS SSS Every pir of loops will hve unknowns. Every pir of loops will hve unknowns. We need nother eqution. h Drop nd ltitude

More information

QUADRATIC EQUATION. Contents

QUADRATIC EQUATION. Contents QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,

More information

EXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED

EXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED EXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED Astrt. The GCD Str of Dvi Theorem n the numerous ppers relte to it hve lrgel een evote to shoing the equlit

More information

On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area

On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area Journl of Grph Algorithms n Applitions http://jg.info/ vol. 13, no. 2, pp. 153 177 (2009) On Clss of Plnr Grphs with Stright-Line Gri Drwings on Liner Are M. Rezul Krim 1,2 M. Siur Rhmn 1 1 Deprtment of

More information

Figure 1. The left-handed and right-handed trefoils

Figure 1. The left-handed and right-handed trefoils The Knot Group A knot is n emedding of the irle into R 3 (or S 3 ), k : S 1 R 3. We shll ssume our knots re tme, mening the emedding n e extended to solid torus, K : S 1 D 2 R 3. The imge is lled tuulr

More information

THE PYTHAGOREAN THEOREM

THE PYTHAGOREAN THEOREM THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this

More information

SIMPLE NONLINEAR GRAPHS

SIMPLE NONLINEAR GRAPHS S i m p l e N o n l i n e r G r p h s SIMPLE NONLINEAR GRAPHS www.mthletis.om.u Simple SIMPLE Nonliner NONLINEAR Grphs GRAPHS Liner equtions hve the form = m+ where the power of (n ) is lws. The re lle

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

More information

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}

More information

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw

More information

set is not closed under matrix [ multiplication, ] and does not form a group.

set is not closed under matrix [ multiplication, ] and does not form a group. Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed

More information

CS261: A Second Course in Algorithms Lecture #5: Minimum-Cost Bipartite Matching

CS261: A Second Course in Algorithms Lecture #5: Minimum-Cost Bipartite Matching CS261: A Seon Course in Algorithms Leture #5: Minimum-Cost Biprtite Mthing Tim Roughgren Jnury 19, 2016 1 Preliminries Figure 1: Exmple of iprtite grph. The eges {, } n {, } onstitute mthing. Lst leture

More information

Vectors. a Write down the vector AB as a column vector ( x y ). A (3, 2) x point C such that BC = 3. . Go to a OA = a

Vectors. a Write down the vector AB as a column vector ( x y ). A (3, 2) x point C such that BC = 3. . Go to a OA = a Streth lesson: Vetors Streth ojetives efore you strt this hpter, mrk how onfident you feel out eh of the sttements elow: I n lulte using olumn vetors nd represent the sum nd differene of two vetors grphilly.

More information

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P. Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time

More information

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4. Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix

More information

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4 Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones

More information

Section 2.3. Matrix Inverses

Section 2.3. Matrix Inverses Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue

More information

3 Angle Geometry. 3.1 Measuring Angles. 1. Using a protractor, measure the marked angles.

3 Angle Geometry. 3.1 Measuring Angles. 1. Using a protractor, measure the marked angles. 3 ngle Geometry MEP Prtie ook S3 3.1 Mesuring ngles 1. Using protrtor, mesure the mrked ngles. () () (d) (e) (f) 2. Drw ngles with the following sizes. () 22 () 75 120 (d) 90 (e) 153 (f) 45 (g) 180 (h)

More information

Aperiodic tilings and substitutions

Aperiodic tilings and substitutions Aperioi tilings n sustitutions Niols Ollinger LIFO, Université Orléns Journées SDA2, Amiens June 12th, 2013 The Domino Prolem (DP) Assume we re given finite set of squre pltes of the sme size with eges

More information