<p>Okay, I have 2 questions about some classic elementary problems that the ACT loves to ask.</p>
<ol>
<li><p>For the questions that ask how many diagonals can be drawn in...(this shape), is there a way to figure it out without drawing in lines and counting?</p></li>
<li><p>I never learned how to do the problems that were structured like this:
Diane works at a greeting card store and can stack 50 cards per hour.
John works at the same store and can stack 24 cards per hour.</p></li>
</ol>
<p>How many cards can they stack if they work together in one hour?</p>
<p>If anyone could give me advice, I would greatly appreciate it :) .</p>
<p>here is a simple formula for your first question
number of diagonals of polygon = n(n-3)/2
n is the number of vertices</p>
<p>2) diane can stack 50 cards per hour so this converts into 50x where x is the number of hours
john can stack 24 cards per hour so this converts into 24x where x is also the number of hours
since they are working together, you add 50x + 24x = y
where y is the total number of cards they can stack up in x hours
since you asked 1 hour just plug in 1 and your done, y=74</p>
<p>I think what JDE really is asking is how long would it take them to stack 100 cards, because this is a little more tricky. If not, then WLsilver is correct</p>
<p>I have a very specific math question that looks eerily simple yet I cannot conquer it. I would really appreciate some sketchy 1:30am help from ANYONE! I saw the answer online but I just cannot reach it. I’ve tried every combination possible. Take a look at the link and tell me if you have any better luck. </p>
<p>1/2bh is an awnser. The base is 4 (notice the x coordinates of 5 and 1) and the higheigt is given to you. You probably though the base was three like me in the begining</p>