DOCSLIB.ORG

Homework 1.1 and 1.2 with SOLUTIONS

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Homework 1.1 and 1.2 with SOLUTIONS Math 220 Linear Algebra (Spring 2018) Homework 1.1 and 1.2 WITH SOLUTIONS Due Thursday January 25 These will be graded in detail and will count as two (TA graded) homeworks. Be sure to start each of these problems on a new sheet of paper, summarize the problem, and explain what you are doing so that a classmate who is struggling can follow what you are doing by just reading your work (do not refer to any external references, including the text). 1. (9 points) Determine whether each of the following equations are linear or nonlinear. If it is linear, put it into the canonical form, a1x1 + a2x2 + ::: + anxn = b and if it is nonlinear, explain why it is nonlinear. cos(ln 1) (a) e x1 + x2 = −0:9x3 + :1x2 Solution: The equation is linear|note that ecos(ln(1)) = ecos(0) = e1 = e is just a constant|and the canonical form is ex1 + 0:9x2 + 0:9x3 = 0: (b) x1 + 2x2 − 3x2x3 = −21 Solution: This equation is not linear because of the x2x3 term in the left-hand side. 2 (c)( x1 − x2) = 15x3 Solution: This equation is not linear either, though it might not be readily visible 2 2 before expanding the square in the left-hand side. Doing so yields x1 −2x1x2 +x2 = 15x3, which is evidently nonlinear because of the x1x2 term. 2. (15 points) Solve the system of equations, unless the system of equations is inconsistent, and then write inconsistent. Use elementary row operations and be sure to get the augmented matrix in at least row echelon form. (No points if the augmented matrix is not, at some point, in row echelon form). (a) x1 + 2x2 + 2x3 = 4 x1 + 3x2 + 3x3 = 5 2x1 + 6x2 + 5x3 = 6 Solution: We set up the augmented matrix 21 2 2 43 41 3 3 55 : 2 6 5 6 We add −1 times the first row to the second row, and −2 times the first row to the second row, yielding 21 2 2 43 40 1 1 15 : 0 2 1 −2 Next add −2 times the second row to the third row, giving us row echelon form: 21 2 2 43 40 1 1 15 : 0 0 −1 −4 From here on we can either do backwards substitution to solve for x3, x2, and x1, or we can keep on performing elementary row operations to reach reduced row echelon form. We will do the latter in order to practice matrix manipulation. We multiply the last row by −1, making the pivot element 1 there, 21 2 2 43 40 1 1 15 0 0 1 4 and then add −1 times the last row to the second row, and −2 times the last row to the first row: 21 2 0 −43 40 1 0 −35 : 0 0 1 4 We are almost done, it only remains to get right of the 2 in the first row, which we accomplish by adding −2 times the second row to the first row, leaving us with 21 0 0 23 40 1 0 −35 : 0 0 1 4 Since this is now in reduced row echelon form we can read off the unique solution x1 = 2, x2 = −3, and x3 = 4, and we see also that this system is consistent. (b) x1 + 2x2 + x4 = 7 x1 + x2 + x3 − x4 = 3 3x1 + x2 + 5x3 − 7x4 = 1 Solution: We set up the augmented matrix 21 2 0 1 73 41 1 1 −1 35 : 3 1 5 −7 1 Adding −1 times the first row and −3 times the first row to the second and third row respectively we get 21 2 0 1 73 40 −1 1 −2 −45 ; 0 −5 5 −10 −20 and then add −5 times row two to row three, whence 21 2 0 1 73 40 −1 1 −2 −45 : 0 0 0 0 0 Multiplying the second row by −1 and subtracting 2 times this new row from row 1 we end up with 21 0 2 −3 −13 40 1 −1 2 45 : 0 0 0 0 0 Reading off this matrix we now see that the system is consistent with infinitely many solutions, namely 8 >x1 = −1 − 2x3 + 3x4; > <x2 = 4 + x3 − 2x4; x is free; > 3 :> x4 is free: (c) x1 + 2x2 + 2x3 = −2 3x1 − 2x2 + 3x3 = −4 4x1 + 5x3 = 0 Solution: As per usual we set up an augmented coefficient matrix: 21 2 2 −23 43 −2 3 −45 : 4 0 5 0 In an effort to get a pivot in the first column we add −3 times row 1 to row 2, and −4 times row 1 to row 3: 21 2 2 −23 40 −8 −3 25 : 0 −8 −3 8 To get a pivot in the second column we now add −1 times row two to row three: 21 2 2 −23 40 −8 −3 25 : 0 0 0 6 The augmented matrix is now in row echelon form, but note that the last column has a pivot. This means that the system is not consistent. Another way of seeing the same is to spell out what the last row is really saying: 0x1 +0x2 +0x3 = 6, or in other words 0 = 6, which is impossible. All this to say, the system is inconsistent. 3. (9 points) (a) Explain the difference between a coefficient matrix and an augmented matrix. Solution: A coefficient matrix is a matrix made up of the coefficients from a system of linear equations. An augmented matrix is similar in that it, too, is a coefficient matrix, but in addition it is augmented with a column consisting of the values on the right-hand side of the equations of the linear system. (b) If you know that a system of linear equations has at least two solutions, how many solutions must it actually have? Explain. Solution: It must have infinitely many solutions. There are three options for a system of linear equations: it has no solutions at all (called inconsistent), exactly one solution, or infinitely many solutions. Hence if it has more than one solution, it has infinitely many. (c) How many solutions can a consistent system of linear equations have? Discuss the different possibilities. Solution: A system being consistent means it has solutions at all. There are now two possibilities: either there is exactly one unique solution, or there are infinitely many solutions. 4. (12 points) (a) Give an example of two row equivalent matrices in echelon form. Note that although the reduced echelon form is unique, there will be several different row equivalent matrices in echelon form. Solution: For example 21 0 03 21 0 03 40 1 05 and 40 1 15 : 0 0 1 0 0 1 There are infinitely many solutions to this problem; the particular one shown above was obtained by starting with a matrix (in this case the identity matrix, which happens to be in reduced row echelon form) and adding its third row to its second row. Since this is an elementary row operation they remain row equivalent, and since we haven't introduced any nonzero elements under the pivot elements it remains in row echelon form. (b) Suppose a 4×6 coefficient matrix has 4 pivot columns. Is the corresponding system of equations consistent? Justify your answer. Solution: The system is consistent with infinitely many solutions since there's a pivot in every row but not every column. The columns without pivot elements correspond to free variables. (c) if a 7 × 5 augmented matrix has a pivot in every column, what can you say about the solutions to the corresponding system of equations? Justify your answer. Solution: Because the matrix at hand is augmented and has a pivot in every column, the rightmost column in particular must be a pivot column. This means that the system is not consistent, since it means that the row corresponding to the last pivot element looks like 0 0 0 0 b where b 6= 0, which means that 0 = b, which is impossible. Hence the system is inconsistent. (d) If a consistent system of equations has more unknowns than equations, what can be said about the number of solutions? Solution: A system with more unknowns than equations has either no solutions or infinitely many solutions. Since our system is specified to be consistent (meaning it has solutions), it must be the second option..
Load more

Recommended publications
  • German Operetta on Broadway and in the West End, 1900–1940
    Downloaded from https://www.cambridge.org/core. IP address: 170.106.202.58, on 26 Sep 2021 at 08:28:39, subject to the Cambridge Core terms of use, available at https://www.cambridge.org/core/terms. https://www.cambridge.org/core/product/2CC6B5497775D1B3DC60C36C9801E6B4 Downloaded from https://www.cambridge.org/core. IP address: 170.106.202.58, on 26 Sep 2021 at 08:28:39, subject to the Cambridge Core terms of use, available at https://www.cambridge.org/core/terms. https://www.cambridge.org/core/product/2CC6B5497775D1B3DC60C36C9801E6B4 German Operetta on Broadway and in the West End, 1900–1940 Academic attention has focused on America’sinfluence on European stage works, and yet dozens of operettas from Austria and Germany were produced on Broadway and in the West End, and their impact on the musical life of the early twentieth century is undeniable. In this ground-breaking book, Derek B. Scott examines the cultural transfer of operetta from the German stage to Britain and the USA and offers a historical and critical survey of these operettas and their music. In the period 1900–1940, over sixty operettas were produced in the West End, and over seventy on Broadway. A study of these stage works is important for the light they shine on a variety of social topics of the period – from modernity and gender relations to new technology and new media – and these are investigated in the individual chapters. This book is also available as Open Access on Cambridge Core at doi.org/10.1017/9781108614306. derek b. scott is Professor of Critical Musicology at the University of Leeds.
    [Show full text]
  • 3D Volumetric Modeling with Introspective Neural Networks
    The Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19) 3D Volumetric Modeling with Introspective Neural Networks Wenlong Huang,*1 Brian Lai,*2 Weijian Xu,3 Zhuowen Tu3 1University of California, Berkeley 2University of California, Los Angeles 3University of California, San Diego Abstract Classification Decision Boundary In this paper, we study the 3D volumetric modeling problem by adopting the Wasserstein introspective neural networks method (WINN) that was previously applied to 2D static im- ages. We name our algorithm 3DWINN which enjoys the same properties as WINN in the 2D case: being simultane- Classification ously generative and discriminative. Compared to the existing Wasserstein 3D volumetric modeling approaches, 3DWINN demonstrates Distance competitive results on several benchmarks in both the genera- tion and the classification tasks. In addition to the standard in- ception score, the Frechet´ Inception Distance (FID) metric is also adopted to measure the quality of 3D volumetric genera- tions. In addition, we study adversarial attacks for volumetric Training Examples CNN Architecture Learned Distribution data and demonstrate the robustness of 3DWINN against ad- Synthesis versarial examples while achieving appealing results in both classification and generation within a single model. 3DWINN is a general framework and it can be applied to the emerging tasks for 3D object and scene modeling.1 Pseudo-negative Distribution Introduction The rich representation power of the deep convolutional neu- Figure 1: Diagram of the Wasserstein introspective neural ral networks (CNN) (LeCun et al. 1989), as a discrimina- networks (adapted from Figure 1 of (Lee et al. 2018)); the tive classifier, has led to a great leap forward for the im- upper figures indicate the gradual refinement over the clas- age classification and regression tasks (Krizhevsky 2009; sification decision boundary between training examples (cir- Szegedy et al.
    [Show full text]
  • Aquaris X2 X2 Pro Complete User Manual
    Aquaris X2 (X2 / X2 Pro) Complete User Manual Aquaris X2 / X2 Pro The BQ team would like to thank you for purchasing your new Aquaris X2 / X2 Pro. We hope you enjoy using it. Enjoy the fastest mobile network speeds with this unlocked smartphone thanks to 4G coverage. Its dual-SIM functionality (nano-SIM) means you can use two SIM cards at the same time, even if they are from different operators. You can browse the internet rapidly, check your email, enjoy games and apps (which can be acquired directly from the device), read e-books, transfer files via Bluetooth, record audio, watch films, take photos and record videos, listen to music, chat with your friends and family and enjoy your favourite social networks. It also comes with a fingerprint scanner, enabling you to add a digital fingerprint to unlock your smartphone, authorise purchases or sign in to an application. About this manual · To make sure that you use your smartphone correctly, please read this manual carefully before you start using it. · Some of the images and screenshots shown in this manual may differ slightly from those of the final product. Likewise, due to firmware updates, it is possible that some of the information in this manual does not correspond exactly to the operation of your device. · BQ shall not be held liable for any issues relating to performance or incompatibility resulting from modification of the registry settings by the user. Nor shall it be held liable for any incompatibility issues with third-party applications available through the app stores.
    [Show full text]
  • Script Identification in Printed Bilingual Documents
    Script Identification in Printed Bilingual Documents D. Dhanya and A.G. Ramakrishnan Department of Electrical Engineering, Indian Institute of Science, Bangalore 560 012, India [email protected] Abstract. Identification of script in multi-lingual documents is essen- tial for many language dependent applications suchas machinetransla- tion and optical character recognition. Techniques for script identification generally require large areas for operation so that sufficient information is available. Suchassumption is nullified in Indian context, as thereis an interspersion of words of two different scripts in most documents. In this paper, techniques to identify the script of a word are discussed. Two different approaches have been proposed and tested. The first method structures words into 3 distinct spatial zones and utilizes the informa- tion on the spatial spread of a word in upper and lower zones, together with the character density, in order to identify the script. The second technique analyzes the directional energy distribution of a word using Gabor filters withsuitable frequencies and orientations. Words withvar- ious font styles and sizes have been used for the testing of the proposed algorithms and the results obtained are quite encouraging. 1 Introduction Multi-script documents are inevitable in countries housing a national language different from English. This effect is no less felt in India, where as many as 18 regional languages coexist. Many official documents, magazines and reports are bilingual in nature containing both regional language and English. Knowledge of the script is essential in many language dependent processes such as machine translation and OCR. The complexity of the problem of script identification depends on the disposition of the input documents.
    [Show full text]
  • Linear Algebra and Matrix Theory
    Linear Algebra and Matrix Theory Chapter 1 - Linear Systems, Matrices and Determinants This is a very brief outline of some basic definitions and theorems of linear algebra. We will assume that you know elementary facts such as how to add two matrices, how to multiply a matrix by a number, how to multiply two matrices, what an identity matrix is, and what a solution of a linear system of equations is. Hardly any of the theorems will be proved. More complete treatments may be found in the following references. 1. References (1) S. Friedberg, A. Insel and L. Spence, Linear Algebra, Prentice-Hall. (2) M. Golubitsky and M. Dellnitz, Linear Algebra and Differential Equa- tions Using Matlab, Brooks-Cole. (3) K. Hoffman and R. Kunze, Linear Algebra, Prentice-Hall. (4) P. Lancaster and M. Tismenetsky, The Theory of Matrices, Aca- demic Press. 1 2 2. Linear Systems of Equations and Gaussian Elimination The solutions, if any, of a linear system of equations (2.1) a11x1 + a12x2 + ··· + a1nxn = b1 a21x1 + a22x2 + ··· + a2nxn = b2 . am1x1 + am2x2 + ··· + amnxn = bm may be found by Gaussian elimination. The permitted steps are as follows. (1) Both sides of any equation may be multiplied by the same nonzero constant. (2) Any two equations may be interchanged. (3) Any multiple of one equation may be added to another equation. Instead of working with the symbols for the variables (the xi), it is eas- ier to place the coefficients (the aij) and the forcing terms (the bi) in a rectangular array called the augmented matrix of the system. a11 a12 .
    [Show full text]
  • Using Row Reduction to Calculate the Inverse and the Determinant of a Square Matrix
    Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n × n square matrix A is called invertible if there exists a matrix X such that AX = XA = I, where I is the n × n identity matrix. If such matrix X exists, one can show that it is unique. We call it the inverse of A and denote it by A−1 = X, so that AA−1 = A−1A = I holds if A−1 exists, i.e. if A is invertible. Not all matrices are invertible. If A−1 does not exist, the matrix A is called singular or noninvertible. Note that if A is invertible, then the linear algebraic system Ax = b has a unique solution x = A−1b. Indeed, multiplying both sides of Ax = b on the left by A−1, we obtain A−1Ax = A−1b. But A−1A = I and Ix = x, so x = A−1b The converse is also true, so for a square matrix A, Ax = b has a unique solution if and only if A is invertible. 2 Calculating the inverse To compute A−1 if it exists, we need to find a matrix X such that AX = I (1) Linear algebra tells us that if such X exists, then XA = I holds as well, and so X = A−1. 1 Now observe that solving (1) is equivalent to solving the following linear systems: Ax1 = e1 Ax2 = e2 ... Axn = en, where xj, j = 1, .
    [Show full text]
  • Linear Algebra Review
    Linear Algebra Review Kaiyu Zheng October 2017 Linear algebra is fundamental for many areas in computer science. This document aims at providing a reference (mostly for myself) when I need to remember some concepts or examples. Instead of a collection of facts as the Matrix Cookbook, this document is more gentle like a tutorial. Most of the content come from my notes while taking the undergraduate linear algebra course (Math 308) at the University of Washington. Contents on more advanced topics are collected from reading different sources on the Internet. Contents 3.8 Exponential and 7 Special Matrices 19 Logarithm...... 11 7.1 Block Matrix.... 19 1 Linear System of Equa- 3.9 Conversion Be- 7.2 Orthogonal..... 20 tions2 tween Matrix Nota- 7.3 Diagonal....... 20 tion and Summation 12 7.4 Diagonalizable... 20 2 Vectors3 7.5 Symmetric...... 21 2.1 Linear independence5 4 Vector Spaces 13 7.6 Positive-Definite.. 21 2.2 Linear dependence.5 4.1 Determinant..... 13 7.7 Singular Value De- 2.3 Linear transforma- 4.2 Kernel........ 15 composition..... 22 tion.........5 4.3 Basis......... 15 7.8 Similar........ 22 7.9 Jordan Normal Form 23 4.4 Change of Basis... 16 3 Matrix Algebra6 7.10 Hermitian...... 23 4.5 Dimension, Row & 7.11 Discrete Fourier 3.1 Addition.......6 Column Space, and Transform...... 24 3.2 Scalar Multiplication6 Rank......... 17 3.3 Matrix Multiplication6 8 Matrix Calculus 24 3.4 Transpose......8 5 Eigen 17 8.1 Differentiation... 24 3.4.1 Conjugate 5.1 Multiplicity of 8.2 Jacobian......
    [Show full text]
  • Uncut (Album Review + Mini-Feature, UK, Print, 2013)
    NewAlbums THE PENNY DUANE PITRE PURE X BLACK REMEDY Bridges Crawlino Uo lnhale... Exhale... IMPORTANT The Staiis ' A OK, NowYou MEROK/ACEPHALE Can Panic! Just Intonating, brother SOUNDINISTAS - beautiful modern Austinpsychwaffir minimalism getlostinmusic t London-based festival Duane Pitre's career Atatimewhere 6fiO favourites hit cross- 8tlo traiectoryis fair\ 7fiO psychedelic rock is tniry AI cultural sweet spot unique - from professional madeoverinrugged On the followup to TPBR's zoog debut, No Oneb skateboarder through to minimalist composer fashionbyTySegall, Thee OhSees, etel.PM -tr Fault But Your Own, Keith MThomson's is abigleap in somerespects, thoughboth X seem content with being out of time ard m* deadpan compositions often recall the wry do share a love of, to paraphrase minimalist ofphase. Their second album, CrawlingUp Dia worldview of Loudon Wainwright. Emboldened guru La Monte Young, 'drawing a straight IheSfairs, takes a spacier, more ambied byhearty live shows, the dynamicallyprimed line and following it'. OnBridges, Pitre approach, a lava-lamp swirl of effects-selad eh arrangements blendmusic hall, folk and works the mathematical precision of the guitar and bubbling electronics through Balkan influences in a swishlycalibrated Just Intonation tuning systeminto two which frontman Nate Grace's falsetto fl@ fashion. The archness in some of Thomson's side Jong, gorgeously free-fl odting untethered. It is a wispy thing, not alwaprry' topical observations is offset by the sprightly compositions, full of arcing, swooping to gdp. But its more soulful moments canb tempos and welcome brushes of colour. stdngs that accumulate and disperse like quietly transcendent: the languidiazz-ktfr. Melliflous Croatian singer Mariiana tides of fog.
    [Show full text]
  • Amps: an Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids∗
    SIAM J. SCI.COMPUT. c 2017 Society for Industrial and Applied Mathematics Vol. 39, No. 5, pp. S809{S827 AMPS: AN AUGMENTED MATRIX FORMULATION FOR PRINCIPAL SUBMATRIX UPDATES WITH APPLICATION TO POWER GRIDS∗ YU-HONG YEUNGy , ALEX POTHENy , MAHANTESH HALAPPANAVARz , AND ZHENYU HUANGz Abstract. We present AMPS, an augmented matrix approach to update the solution to a linear system of equations when the matrix is modified by a few elements within a principal submatrix. This problem arises in the dynamic security analysis of a power grid, where operators need to perform N − k contingency analysis, i.e., determine the state of the system when exactly k links from N fail. Our algorithms augment the matrix to account for the changes in it, and then compute the solution to the augmented system without refactoring the modified matrix. We provide two algorithms|a direct method and a hybrid direct-iterative method|for solving the augmented system. We also exploit the sparsity of the matrices and vectors to accelerate the overall computation. We analyze the time complexity of both algorithms and show that it is bounded by the number of nonzeros in a subset of the columns of the Cholesky factor that are selected by the nonzeros in the sparse right-hand-side vector. Our algorithms are compared on three power grids with PARDISO, a parallel direct solver, and CHOLMOD, a direct solver with the ability to modify the Cholesky factors of the matrix. We show that our augmented algorithms outperform PARDISO (by two orders of magnitude) and CHOLMOD (by a factor of up to 5).
    [Show full text]
  • TP Matrices and TP Completability
    W&M ScholarWorks Undergraduate Honors Theses Theses, Dissertations, & Master Projects 5-2018 TP Matrices and TP Completability Duo Wang Follow this and additional works at: https://scholarworks.wm.edu/honorstheses Part of the Algebra Commons Recommended Citation Wang, Duo, "TP Matrices and TP Completability" (2018). Undergraduate Honors Theses. Paper 1159. https://scholarworks.wm.edu/honorstheses/1159 This Honors Thesis is brought to you for free and open access by the Theses, Dissertations, & Master Projects at W&M ScholarWorks. It has been accepted for inclusion in Undergraduate Honors Theses by an authorized administrator of W&M ScholarWorks. For more information, please contact [email protected]. TP Matrices and TP Completability A thesis submitted in partial fulfillment of the requirement for the degree of Bachelor of Science in Mathematics from The College of William and Mary by Duo Wang Committe Members: Charles Johnson Junping Shi Mark Greer Williamsburg, VA April 10, 2018 Abstract A matrix is called totally nonnegative (TN) if the determinant of every square submatrix is nonnegative and totally positive (TP) if the determinant of every square submatrix is positive. The TP (TN) completion problem asks which partial matrices have a TP (TN) completion. In this paper, several new TP-completable pat- terns in 3-by-n matrices are identified. The relationship between expansion and completability is developed based on the prior re- sults about single unspecified entry. These results extend our un- derstanding of TP-completable patterns. A new Ratio Theorem related to TP-completability is introduced in this paper, and it can possibly be a helpful tool in TP-completion problems.
    [Show full text]
  • Ts 136 423 V11.2.0 (2012-10)
    ETSI TS 136 423 V11.2.0 (2012-10) Technical Specification LTE; Access Network (E-UTRAN); X2 Application Protocol (X2AP) (3GPP TS 36.423 version 11.2.0 Release 11) 3GPP TS 36.423 version 11.2.0 Release 11 1 ETSI TS 136 423 V11.2.0 (2012-10) Reference RTS/TSGR-0336423vb20 Keywords LTE ETSI 650 Route des Lucioles F-06921 Sophia Antipolis Cedex - FRANCE Tel.: +33 4 92 94 42 00 Fax: +33 4 93 65 47 16 Siret N° 348 623 562 00017 - NAF 742 C Association à but non lucratif enregistrée à la Sous-Préfecture de Grasse (06) N° 7803/88 Important notice Individual copies of the present document can be downloaded from: http://www.etsi.org The present document may be made available in more than one electronic version or in print. In any case of existing or perceived difference in contents between such versions, the reference version is the Portable Document Format (PDF). In case of dispute, the reference shall be the printing on ETSI printers of the PDF version kept on a specific network drive within ETSI Secretariat. Users of the present document should be aware that the document may be subject to revision or change of status. Information on the current status of this and other ETSI documents is available at http://portal.etsi.org/tb/status/status.asp If you find errors in the present document, please send your comment to one of the following services: http://portal.etsi.org/chaircor/ETSI_support.asp Copyright Notification No part may be reproduced except as authorized by written permission.
    [Show full text]
  • About the Cover
    ABOUT THE COVER We are pleased to be continuing our new tradition of having pictures on four pages of the Spirit! In addition to the front and back covers, the alternate sides of these pages capture even more of what was special in 2012. The top picture on the front cover displays the four High Senior Captains of the White Chaos and the Blue Juveniles (left to right): Mitchell Lesser, Matt Shaffer, Danny Brack, and Jacob Stetson holding this year’s Color War plaque. The bottom picture shows many of our fine 2012 staff members getting ready for our always popular Wrestlemania. The inside of the front cover shows an all-star group of 13 year old happy campers (left to right): Aaron Stone, David Rubin, Anthony Shea, Sam Shapiro, Jackson Quist, Jordan Jones, Brett Middleton, Alex Romantz, Ben Burns, Brendan Delaney, Zach Miller, Ari Natansohn, Zach Zysk, and Justin Smith. This is followed below by the camp celebrating after our “House Game” victory over Robin Hood! The inside of the back cover depicts two scenes from West End’s World Cup. On top there is an action shot of the regatta event. This matchup is between South Africa and Brazil. On the bottom, there is a picture of this year’s World Cup Champion Greece, whose flag is now hanging in the dining hall for the entire year. Team members are from left to right front row Brian Barrera, Houston Barenholtz, Kaleb Decker, Noah Leslie, Jacob Denning, Kevin Wu, and Diego Rivera, and back row Farid Mawanda, Coach Mason Williams, and Jacob Stetson.
    [Show full text]