Yep... so they says that the area of the extended leaf is 18+6x... You know that the area is length into breath... here the breath doesn't change.. so it'll be 3ft... can get the length by dividing area by 3... that is 6+2x... Now the new length wil be 2times that plus the previous 6ft length
The answer to this question is that the trains will meet after 3 hours.
We can work this out by considering that is the closing speed of the two
trains is (50+60=)110 miles per hour, then this must mean that the
combined distance that the trains need to travel before they meet is 330
miles. If the time that is taken to travel 330 miles at 110 miles per
hour, then you simply need to divide 330/110 to find your answer - 3
hours.
Well, we could try adding up odd numbers, and look to see when we reach 400. But I'm hoping to find an easier way.
First of all ... I'm not sure this will help, but let's stop and notice it anyway ...
An odd number of odd numbers (like 1, 3, 5) add up to an odd number, but
an even number of odd numbers (like 1,3,5,7) add up to an even number.
So if the sum is going to be exactly 400, then there will have to be an even
number of items in the set.
Now, let's put down an even number of odd numbers to work with,and see
what we can notice about them:
1, 3, 5, 7, 9, 11, 13, 15 .
Number of items in the set . . . 8
Sum of all the items in the set . . . 64
Hmmm. That's interesting. 64 happens to be the square of 8 .
Do you think that might be all there is to it ?
Let's check it out:
Even-numbered lists of odd numbers:
1, 3 Items = 2, Sum = 4
1, 3, 5, 7 Items = 4, Sum = 16
1, 3, 5, 7, 9, 11 Items = 6, Sum = 36
1, 3, 5, 7, 9, 11, 13, 15 . . Items = 8, Sum = 64 .
Amazing ! The sum is always the square of the number of items in the set !
For a sum of 400 ... which just happens to be the square of 20,
we just need the <em><u>first 20 consecutive odd numbers</u></em>.
I slogged through it on my calculator, and it's true.
I never knew this before. It seems to be something valuable
to keep in my tool-box (and cherish always).
