<p>The triangle question:</p>
<p>We’ll have to use the Pythagorean theorem at least twice to get the answer. First, you’ve got to find the value of the line that goes from the bottom of the ‘h’ line to one of the lines that connect to the vertex (the ones that start from the edges of the squares). Once you’ve picked the place, use the Pythagorean theorem to find it:</p>
<p>m^2 + m^2 = c^2 = 2(m^2). c = m<em>sqrt(2). The thing is, this is the value for 2 of the lines I described earlier (the ones that connect from the bottom of ‘h’ to one of the edges of the square). So, just divide it by 2. m</em>sqrt(2)/2</p>
<p>Now, you simply use the theorem again to find h.</p>
<p>(m*sqrt(2)/2)^2 + h^2 = m^2. Remember, E=M, that’s why I did m^2 instead of e^2, to make it possible to subtract and what not.</p>
<h2>2(m^2)/4 + h^2 = m^2. That’s basically .5(m^2) + h^2 = m^2, so subtract the .5(m^2) from the m^2 to get h^2 = .5(m^2). That’s also h^2 = m^2/2, and h = m/sqrt(2).</h2>
<p>The board problem:</p>
<p>Simply look for a pattern.</p>
<p>Basically, saying that a board with N rows and N squares in each row is saying you can make boards of 2x2, 3x3, 4x4, etc.</p>
<p>Draw a 2x2. You get 4 squares on boundaries.
Draw a 3x3. You get 8 squares on boundaries.
Draw a 4x4. You get 12 squares on boundaries.</p>
<p>There seems to be a pattern here, and that is to add 4 every time you go up one number in ‘n’. That also means the total amount of squares for the boundaries following the rules given by the question must be a multiple of 4. Look at the answer choices; only 52 is a multiple of 4.</p>