100%(1)100% found this document useful (1 vote)

420 views5 pages© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

Attribution Non-Commercial (BY-NC)

100%(1)100% found this document useful (1 vote)

420 views5 pagesAttribution Non-Commercial (BY-NC)

You are on page 1of 5

Problem 1. 8 singers participate in an art festival where m songs are performed. Each song is performed by 4 singers, and each pair of singers performs together in the same number of songs. Determine the minimum value of m. Solution. Notice that for every song performed, there are 4 = 6 ways to pair up the 2 four singers. Thus there were 6 pairs who performed together in each song. Suppose every pair of singer sang together in k songs. There are a total of 8 = 28 pairs of 2 singers, so by counting the total number of times each pair of singers perform, we have the equality 28k = 6m which means 14 | m thus m 14. Finally, we give a construction for m = 14. By numbering the singers from 1 to 8, divide them into 14 sets of 4 people each, to represent the singers for each of the 14 songs as follows: {1,2,3,4}, {3,4,5,6}, {5,6,7,8}, {1,2,7,8}, {1,2,5,6}, {2,3,6,7}, {3,4,7,8}, {1,4,5,8}, {1,3,5,7}, {2,4,6,8}, {1,3,6,8}, {2,3,5,8}, {2,4,5,7}, {1,4,6,7}. Problem 2. (Baltic Way 2001) A set of 8 problems was prepared for an examination. Each student was given 3 of them. No two students received more than one common problem. What is the largest possible number of students? Solution. Denote the problems by A, B,C, D, E, F, G, H, then 8 possible problem sets are ABC, ADE, AFG, BDG, BFH,CDH,CEF, EGH. Hence, there could be 8 students. Suppose that some problem (e.g., A) was given to 4 students. Then each of these 4 students should receive 2 different supplementary problems, and there should be at least 9 problems, a contradiction. Therefore each problem was given to at most 3 students, and there were at most 8 3 = 24 awardings of problems. As each student was awarded 3 problems, there were at most 8 students. Problem 3. 17 students took part in a mathematical contest with 9 problems. It is given that every problem was answered correctly by exactly 11 students. Prove that there were two students who, between them, solved all 9 problems. Solution. We set up an incidence matrix with columns P1 , P2 , . . . , P9 to represent the problems and rows a1 , a2 , . . . , a17 to represent the students. The cell in row i and column j is lled with 1 if student ai solved problem Pj , and 0 otherwise. Since every problem was answered correctly by exactly 11 students, there must be exactly six 0s in each column. The number of column pairs of 0s is therefore 6 9 = 135. Now 2 suppose that no two students solved all 9 problems between them. This means that for every pair of students ai and a j , 1 i < j 17, there is at least one problem they both didnt solve, contributing to at least one column pair of 0s. Thus total number of column pairs 17 = 136, a contradiction. 2 Problem 4. (SMO(S)2001 Round 2) The numbers {1, 2, . . . , n2 } are randomly arranged on a n2 n2 board, such that each number appears exactly n2 times. Prove that there is a row or a column that contains at least n distinct numbers. Solution. Set up an incidence matrix with columns corresponding to the numbers 1 to n2 and rows r1 , r2 , . . . , rn2 , c1 , c2 , . . . , cn2 to represent the rows and columns of the board

Prepared by Ho Jun Wei Hwa Chong Math Olympiad Programme (Open)

respectively. Fill cell in column k with a 1 if the number k appears on that particular row ri or column c j of the board, and 0 if it does not appear in that row/column of the board. Every number appears exactly n2 times on the board. If a certain number appears in exactly a columns and b rows of the board, then we must have ab n2 a + b 2n by AM-GM inequality. Then in every column of our incidence matrix, there must be at least 2n 1s, thus the total number of 1s in the matrix 2n3 . Since there are 2n2 rows in our incidence matrix, by pigeonhole principle, there must be at least one row that contains at least n 1s. This means that at least one row or column on the board contains n distinct numbers. Problem 5. In a chess club, n people gathered to play chess against each other, as they pleased. No two people played against each other more than once. At the end of the day, it was observed that a total of 3n games had been played. Moreover, if we chose any two players, say A and B, there would be at most one other player who had played with both A and B. Prove that n > 30. Solution. Set up an incidence matrix with n rows and n columns, and ll the cell in row i and column j with a 1 if person i played with person j, and 0 otherwise (a person cannot play against himself). Let ci represent the number of 1s in column i. Each match contributes to two 1s, thus ci = 6n. By Jensens inequality, the function x x2 x 2 = 2 is concave upwards, thus the total number of column pairs is

n i=1

ci 2

ci n

=n

6 = 15n. 2

Also, for every pair of people A and B, at most one person played with both A and B, thus between every two rows, there can be at most one column pair, so total number of column pairs n = n(n1) . Combining both inequalities, we obtain 15n n(n1) 2 2 2 which implies n 31 as desired. Problem 6. (SMO(O)2004 Round 2) Let m, n be integers so that m n > 1. Let F1 , . . . , Fk be a collection of n-element subsets of {1, ..., m} so that Fi Fj contains at most 1 element, 1 i < j k. Show that k m(m 1) n(n 1)

Solution. Let S be the set of all possible two-element subsets {X,Y } {1, 2, 3, . . . , m}. Clearly |S| = m . Each Fi contains n elements, there are exactly n elements in S that 2 2 are subsets of Fi . Also, note that |Fi Fj | 1, thus no element in S can be a subset of two sets Fi and Fj . This means k n |S| k m(m1) . 2 n(n1) Problem 7. (SMO(O)2006 Round 2) Let n be a positive integer. Let S1 , S2 , . . . , Sk be a collection of 2n-element subsets of {1, 2, 3, 4, . . . , 4n 1, 4n} so that Si S j contains at most n elements for all 1 i < j k. Show that k 6(n+1)/2 Solution. Let A be the set of all possible (n + 1)-element subsets of {1, 2, 3, 4, . . . , 4n 4n 2n 1, 4n}. Clearly |A| = n+1 . Since each Si contains 2n elements, there will be n+1 elements in A that are subsets of Si . Furthermore, each element in A can be a subset of

4n n+1 2n n+1

4n (4n 1) . . . 3n . 2n (2n 1) . . . n

Finally, we prove by induction that 4n (4n 1) . . . 3n 6(n+1)/2 . 2n (2n 1) . . . n For n = 1 the result is trivially true. Now suppose it holds for n = r. 4r (4r 1) . . . 3r 6(r+1)/2 , 2r (2r 1) . . . r (4r + 4) (4r + 3) . . . (3r + 3) (4r + 4)(4r + 3)(4r + 2)(4r + 1)(r) = (2r + 2) (2r + 1) . . . (r + 1) (3r + 2)(3r + 1)(3r)(2r + 2)(2r + 1) (4r + 4)(4r + 3)(4r + 2)(4r + 1)(r) (r+1)/2 6 (3r + 2)(3r + 1)(3r)(2r + 2)(2r + 1) (4r + 4)(4r + 2) (4r + 3)(4r + 1) r (r+1)/2 = 6 (2r + 2)(2r + 1) (3r + 2)(3r + 1) 3r 16 1 4 6(r+1)/2 9 3 64 (r+1)/2 = 6 27 6 6(r+1)/2 Let = = 6(r+2)/2 The induction is complete. Thus k 4n (4n 1) . . . 3n 6(n+1)/2 for all integers n. 2n (2n 1) . . . n

Problem 8. Consider the set A = {1, 2, 3, . . . , 100}. Let S1 , S2 , S3 , . . . , S5n be subsets of A, such that every element of A appears in exactly 4n of these subsets. Prove that there exists i, j, k, such that Si S j Sk = A. Solution. We set up an incidence matrix with 100 columns and rows S1 , S2 , . . . , S5n . The cell in row Si and column j is lled with 1 if j appears in Si and 0 otherwise. Since each number appears in exactly 4n subsets, thus every column has exactly 4n 1s and n 0s. We dene a column triplet as a triplet of 0s occuring in a column. Thus if there are ci 0s in column i, the number of column triplets in that column is ci . The 3 total number of column triplets is therefore 100 n . Suppose to the contrary that for 3 all i < j < k, we have Si S j Sk = A, then each selection of (i, j, k) must admit at least one column triplet. Thus there are at least 5n column triplets. We therefore obtain the 3 inequality 5n n 100 3 3 but this is a contradiction, since

5n 3 n 3

100

5n(5n 1)(5n 2) 5n(5n 5)(5n 10) = 125. n(n 1)(n 2) n(n 1)(n 2) 3

Problem 9. (USAMO 1984) A math exam has two papers, where each paper consists of at least one question and both papers have 28 questions altogether. Each pupil attempted 7 questions. Each pair of questions was attempted by just two pupils. Show that one pupil attempted either zero or at least four questions in the rst paper. Solution. Each pupil attempts 7 questions and hence 21 pairs of questions. There are 28 = 378 pairs of questions in total and each is attempted by 2 pupils. So there 2 must be 3782 = 36 pupils. Suppose n pupils solved question 1. Each solved 6 pairs 21 involving question 1, so there must be 3n pairs involving question 1. But there are 27 pairs involving question 1, so n = 9. The same applies to any other question. So each question was solved by 9 pupils. Suppose the result is false. Suppose there are m questions in the rst paper, and that the number of pupils solving 1, 2, 3 questions in the rst paper is a, b, c respectively. So a + b + c = 36, a + 2b + 3c = 9m. Now consider pairs of problems in the rst paper. There are m(m1) such pairs. Pupils solving just 1 solve no pairs, those solving 2 solve 1 2 pair and those solving 3 solve 3 pairs, so we have b + 3c = m(m 1). Solving for b we get 29 23 b = 2m2 + 29m 108 = 2(m )2 < 0. 4 8 This is a contradiction, so the result must be true. Problem 10. (China 1994) Given that S = {1, 2, 3, . . . , 10} and A1 , A2 , . . . , Ak are subsets of S satisfying |Ai | = 5 for 1 i k and |Ai A j | 2 for 1 i < j k, nd the maximum value of k. Solution. We construct an incidence matrix of 10 columns and rows A1 to Ak . We ll each cell in column i and row A j with 1 if the number i appears in A j , and 0 otherwise. Let ci be the number of 1s in column i. Since |Ai | = 5, we have a total of 5k 1s in the matrix, thus ci = 5k. Next we count column pairs of 1s. For each pair (Ai , A j ), we have at most 2 column pairs since they contain at most two common element. Therefore, 10 ci k 2 2 2 = k(k 1). i=1 However, by Jensens inequality, the function total number of column pairs is

10 i=1 x 2

x2 x 2

ci 2

10

ci 10

= 10

k 2

k k = 5( )( 1). 2 2

Combining the inequalities, we obtain k k 5( )( 1) k(k 1) k 6, 2 2 Finally, we can easily verify that the following 6 sets satisfy the condition. {1, 2, 3, 4, 5}, {1, 2, 6, 7, 8}, {1, 3, 6, 9, 10}, {2, 4, 7, 9, 10}, {3, 5, 7, 8, 10}, {4, 5, 6, 8, 9} Thus the maximum value of k is 6.

Problem 11. (IMO 2001 Problem 3) Twenty-one girls and twenty-one boys took part in a mathematical competition. It turned out that each contestant solved at most six problems, and for each pair of a girl and a boy, there was at least one problem that was solved by both the girl and the boy. Show that there is a problem that was solved by at least three girls and at least three boys. Solution. We set up a 2121 matrix with rows corresponding to the boys b1 , b2 , . . . , b21 and columns corresponding to the girls g1 , g2 , . . . , g21 . For each pair (bi , g j ), we ll the corresponding cell with question number of a problem that both bi and g j solved (for instance, if b1 and g1 both solved question 9, we ll this cell with a 9). Next, consider the row b1 . Since each boy solved at most six problems, there are at most six different question numbers that appear in the row b1 . For every question number that appears more than three times in that row, we shade the cell blue. By pigeonhole principle, there will be a problem that was solved by at least 4 girls. Thus there are at most 5 question numbers in the row whose cells are unshaded, and each of these question numbers occupies at most 2 cells (otherwise it will be shaded), thus there will at least be 11 cells shaded blue in the row b1 . This argument extends to all rows, thus there will be at least 21 11 = 232 blue cells. Next, considering the column g1 , we shade a cell pink if the question number appears at least three times in that column. By a similar argument, there are at least 11 pink cells in column g1 , and at least 21 11 = 232 pink cells in the entire matrix. Since there are only 21 21 = 441 < 232 + 232 cells in the matrix, there must be a cell that is shaded both pink and blue. This problem was solved by at least 3 girls (since it is shaded blue) and at least 3 boys (since it is shaded pink).

- 2002-2.pdf2002-2.pdfMuhammad Al Kahfi
- Warm-up Problems Solutions - 2014 Winter CampWarm-up Problems Solutions - 2014 Winter Camputhso roy
- 2009 Contest Entire Draft v62009 Contest Entire Draft v6Quang Đào Vũ
- 118296096 Zuming Feng Number Theory Mathematics Olympiad Coachs Seminar Coachnums Some Solutions 2004 22p118296096 Zuming Feng Number Theory Mathematics Olympiad Coachs Seminar Coachnums Some Solutions 2004 22pEmerson Soriano
- ProblemsFinalProblemsFinalคณิต ครูซัน ซีดาน
- combinatorics_matholympiadtraining'04.pdfcombinatorics_matholympiadtraining'04.pdfssshhhki
- Problems Number TheoryProblems Number Theoryzhazzu
- HW1SolsHW1SolsDon Nguyen
- 31th Imo 1990-Fix31th Imo 1990-FixGuffran septiahadi
- GroupHW2_S18_solutionsGroupHW2_S18_solutionskevinesg
- RZC-NumberTheory-Worksheet2RZC-NumberTheory-Worksheet2Jane Chang
- tartar_9tartar_9TrungNguyễnChí
- pset5_solpset5_solMuhammad Ali Fîdå
- Combinat or IcsCombinat or IcsPeanut ButterAndJelly
- Combinat or IcsCombinat or IcsPeanut ButterAndJelly
- J2 solutions latexJ2 solutions latexBob
- The Binomial TheoremThe Binomial TheoremJudith Andres
- PigeonholePigeonholeThanh Ta
- IMC2002-2IMC2002-2Arief Cahyadi
- A HISTORIA DA HUMANIDADE, DO SECULO 1AC A 3AC.A HISTORIA DA HUMANIDADE, DO SECULO 1AC A 3AC.Luís Farias
- A HISTORIA DA HUMANIDADE, DO SECULO 6AC A 10AC.A HISTORIA DA HUMANIDADE, DO SECULO 6AC A 10AC.Luís Farias
- v17_n4.pdfv17_n4.pdfnarmo66
- HW9HW9DongHa Bahn
- solutii_seniorisolutii_senioripppttt1234
- 2002SS2002SScuongacc
- Prob Comb MethodProb Comb MethodSrikar Varadaraj
- Inclusion ExclusionInclusion ExclusionBil Mafrouch
- PROBABILITY - SOLVED RXAMPLESPROBABILITY - SOLVED RXAMPLESUmer Khan
- hw1sol CShw1sol CSRifat Hasan
- training-pigeonhole-principletraining-pigeonhole-principleRohit Garg
- training-pigeonhole-principletraining-pigeonhole-principledkkdkf dsaa
- Week11 AnswersWeek11 AnswersAarav Parin
- y11-math-2022-model-paper-answer-keyy11-math-2022-model-paper-answer-keyAnish Anand kumar
- 3zeXUswe3PNDolLLTGZB3zeXUswe3PNDolLLTGZBaman Kumar Gupta
- IMO Longlist 1985 ProblemsIMO Longlist 1985 ProblemsTrung Đức
- Feynman’s sunshine numbersFeynman’s sunshine numbersahsbon
- Chapter 5 or 6 - DiscreteChapter 5 or 6 - DiscreteAngel Labrador Toyogon
- 1996SS1996SScuongacc
- KIDM-zadaci2-rj.pdfKIDM-zadaci2-rj.pdfanetica183993
- Individual SolutionIndividual SolutionJoaquim Marques
- USAJMO math olympiad SolutionsUSAJMO math olympiad SolutionsRUSDIN, S.Si
- Team Contest UCSC 2013 SolTeam Contest UCSC 2013 Soldoldrums7
- Total Gadha-Number System.pdfTotal Gadha-Number System.pdfChandramauli Govind
- Number System TGNumber System TGSonali Srivastava
- Https Doc 14 7g Apps Viewer.googleusercontentHttps Doc 14 7g Apps Viewer.googleusercontentdurga_gaayu
- Harvard-MIT+Mathematics+Tournament+2003-2008.pdfHarvard-MIT+Mathematics+Tournament+2003-2008.pdfrahul goyal
- Counting in Two WaysCounting in Two Wayssrinu27
- 13461346Silviu
- A HISTORIA DA HUMANIDADE, DO SECULO 4AC A 6AC.A HISTORIA DA HUMANIDADE, DO SECULO 4AC A 6AC.Luís Farias
- bw04problbw04problThai An Nguyen
- Worked Examples in Mathematics for Scientists and EngineersWorked Examples in Mathematics for Scientists and EngineersG. Stephenson
- Permutation and CombinationsPermutation and CombinationsRamesh Chandra
- The Green Book of Mathematical ProblemsThe Green Book of Mathematical ProblemsKenneth Hardy
- Study Guide for Applied Finite MathematicsStudy Guide for Applied Finite MathematicsNicholas A. Macri
- Differential FormsDifferential FormsHenri Cartan
- De Moiver's Theorem (Trigonometry) Mathematics Question BankDe Moiver's Theorem (Trigonometry) Mathematics Question BankMohmmad Khaja Shareef
- Algebraic EquationsAlgebraic EquationsDemetrios P. Kanoussis
- Differential Equations: A Concise CourseDifferential Equations: A Concise CourseH. S. Bear
- Trigonometric Ratios to Transformations (Trigonometry) Mathematics E-Book For Public ExamsTrigonometric Ratios to Transformations (Trigonometry) Mathematics E-Book For Public ExamsMohmmad Khaja Shareef
- Application of Derivatives Tangents and Normals (Calculus) Mathematics E-Book For Public ExamsApplication of Derivatives Tangents and Normals (Calculus) Mathematics E-Book For Public ExamsMohmmad Khaja Shareef
- MA2213 SummaryMA2213 SummaryKhor Shi-Jie
- MA2216 SummaryMA2216 SummaryKhor Shi-Jie
- Bridge Kickstarter Course Lesson 2 SlidesBridge Kickstarter Course Lesson 2 SlidesKhor Shi-Jie
- Bridge Kickstarter Course Worksheet 2Bridge Kickstarter Course Worksheet 2Khor Shi-Jie
- Bridge Kickstarter Course Lesson 2 SummaryBridge Kickstarter Course Lesson 2 SummaryKhor Shi-Jie
- Bridge Kickstarter Course Lesson 2 SlidesBridge Kickstarter Course Lesson 2 SlidesKhor Shi-Jie
- Bridge Kickstarter Course Worksheet 1Bridge Kickstarter Course Worksheet 1Khor Shi-Jie
- Bridge Kickstarter Course Lesson 1 SummaryBridge Kickstarter Course Lesson 1 SummaryKhor Shi-Jie
- Bridge Kickstarter Course Lesson 1 SlidesBridge Kickstarter Course Lesson 1 SlidesKhor Shi-Jie
- Worksheet for Lesson 3Worksheet for Lesson 3Khor Shi-Jie
- SoC Bridge Lesson 3SoC Bridge Lesson 3Khor Shi-Jie
- PC1144 Summary (Chapter 37-39)PC1144 Summary (Chapter 37-39)Khor Shi-Jie
- MA1505 SummaryMA1505 SummaryKhor Shi-Jie
- Summary of CS1231Summary of CS1231Khor Shi-Jie
- System Notes for J1System Notes for J1Khor Shi-Jie
- LeadsLeadsKhor Shi-Jie
- SMO(J) Mock Paper 1SMO(J) Mock Paper 1Khor Shi-Jie
- SMO(S) Mock Paper 1SMO(S) Mock Paper 1Khor Shi-Jie
- SMO(J) Mock PaperSMO(J) Mock PaperKhor Shi-Jie
- SMO(J) Mock PaperSMO(J) Mock PaperKhor Shi-Jie
- A Review of GeometryA Review of GeometryKhor Shi-Jie
- Basic Inequalities and Diophantine EquationsBasic Inequalities and Diophantine EquationsKhor Shi-Jie
- Combinatorics: The Next StepCombinatorics: The Next StepKhor Shi-Jie
- SMO(O) Mock PaperSMO(O) Mock PaperKhor Shi-Jie
- A Review of GeometryA Review of GeometryKhor Shi-Jie
- SIMO Combi InvarianceSIMO Combi InvarianceKhor Shi-Jie
- HCMOP Open Incidence MatrixHCMOP Open Incidence MatrixKhor Shi-Jie
- A Potpourri of AlgebraA Potpourri of AlgebraKhor Shi-Jie
- Pro-Materials Water ColourPro-Materials Water ColourEdlis Lied
- [Edu.joshuatly.com] Gerak Gempur Perak 2010 SPM Physics[Edu.joshuatly.com] Gerak Gempur Perak 2010 SPM PhysicsWong Chin
- HOTAS internetHOTAS internetRazvanHarag
- Principles of Electrochemestry Applied to CorrosionPrinciples of Electrochemestry Applied to CorrosionPEDRO JAVIER SAAVEDRA MARTINEZ
- Cylinder Liner TheoryCylinder Liner TheoryMuhammad Nasim Abbas
- Tibetan Spaniel.stdTibetan Spaniel.stdDRagonrouge
- THEME OF EVIL IN LORD OF THE FLIESTHEME OF EVIL IN LORD OF THE FLIESShiza Nadeem
- Exercise__3_NCM 105A(1)Exercise__3_NCM 105A(1)Kryzza Leizell
- Jis a 5528 2006 en Good Hot Rolled Steel Sheet PilesJis a 5528 2006 en Good Hot Rolled Steel Sheet PilesMan Ho Lam
- _Final Test Modul 1-2 Medicine New Base_Final Test Modul 1-2 Medicine New BasePurnima Choudhury
- A Rational Use of Clozapine Based on Adverse Drug Reactions, Pharmacokinetics, and Clinical PharmacopsychologyA Rational Use of Clozapine Based on Adverse Drug Reactions, Pharmacokinetics, and Clinical PharmacopsychologyDian Gblig
- WASTE-TO-ENERGY Information Memerandum dt 12 Apr, 2020WASTE-TO-ENERGY Information Memerandum dt 12 Apr, 2020RST
- The Printing Press and Beyond.pptxThe Printing Press and Beyond.pptxJonas Fango Gonzales
- GDeVbqNeEemLSgpXQLYWKg_28a03d470be64a3cbf240cc122513754_Larry_s-Commissary-salesDataGDeVbqNeEemLSgpXQLYWKg_28a03d470be64a3cbf240cc122513754_Larry_s-Commissary-salesDataAndres Felipe Rengifo Cusba
- An Alternate Look at Handgun Stopping Power _ Buckeye Firearms AssociationAn Alternate Look at Handgun Stopping Power _ Buckeye Firearms Associationrobert_tigner
- RPR FY2014 No.32 AppendixRPR FY2014 No.32 Appendixkla_alk
- Project Monitoring & Construction Supervision Manual - Jan2013Project Monitoring & Construction Supervision Manual - Jan2013SudeepSMenasinakai
- itemlist.xlsitemlist.xlsFikri Firgiawan
- Energy+Economics+Volume+23+issue+3+2001+%5Bdoi+10.1016%252Fs0140-9883%252800%252900061-x%5D+Friedel+Bolle+--+Competition+with+supply+and+demand+functionsEnergy+Economics+Volume+23+issue+3+2001+%5Bdoi+10.1016%252Fs0140-9883%252800%252900061-x%5D+Friedel+Bolle+--+Competition+with+supply+and+demand+functionsBANI KHASANREJO
- Brochure_Industrial Webinar_Mechanical Engineering (1).pdfBrochure_Industrial Webinar_Mechanical Engineering (1).pdfashish
- Dingli Operator’s Manual Jcpt0607aDingli Operator’s Manual Jcpt0607aJuan Pablo
- Amendments Nov 2011Amendments Nov 2011Tharun Raj
- Bacterial ConjugationBacterial ConjugationAdarsh Gupta K
- VectorsVectorsmelissa
- History-of-Aesthetics2-1b2hmui.pdfHistory-of-Aesthetics2-1b2hmui.pdfSaadat Hussain Shahji Panjtani
- More Problems on Conic SectionsMore Problems on Conic SectionsAze
- NEDCONEDCOFuaad Dodoo
- HYDRAULICS EXPERIMENT 1 - RECTANGULAR WEIR.docxHYDRAULICS EXPERIMENT 1 - RECTANGULAR WEIR.docxjosh de vera
- dwellingsdwellingsMic san
- Nhtsa Interim_guidance_electric and Hybrid VehiclesNhtsa Interim_guidance_electric and Hybrid Vehiclesravigobi