The factors of 48 are:
1 x 48
2 x 24
3 x 16
4 x 12
6 x 8
and visa versa: 48 x 1 etc.
To make the product negative, one of the factors has to be positive and one has to be negative. To find the greatest sum, make the bigger number the positive factor and the smaller number the negative factor. So, -1 x 48 = -48 and the sum of -1 + 48 = 47 which would be the greatest possible sum.
First, it would help to put 46 and 2/3 into an improper fraction: 140/3.
Then, since this is a percent, we put that improper fraction over 100: (140/3)/100 = 140/300.
Finally, we multiply this answer by 28 since "of" means multiply:
(140/300) * 28 = 196/15 = 13 1/15
I know my picture stinks, but it is possible. If you make it into a triangle shape, but move the table a bit closer to the throwing wheel (as shown) it works out great. If you ever get a problem like his again, just think outside the box for different solutions.
The first and only stop of the flight can be Boise, Omaha or Chicago. This means there are 3 possibilities where to stop. From thee the flight connects to New York City, either to La Guardia or to JFK Airport.
1 possible route: Seattle-Boise-La Guardia
<span>2 possible route: Seattle-Omaha-La Guardia
</span><span>3 possible route: Seattle-Chicago-La Guardia
</span><span>4 possible route: Seattle-Boise-NYC
</span><span>5 possible route: Seattle-Omaha-NYC
</span><span>6 possible route: Seattle-Chicago-NYC
</span>
Or in other words: There are two airports where the flight can arrive and for each of them there are three possible routes. So, in total there are 2*3=6 possible routes.
sequences can be expressed in terms of the nth term of the sequence. In this case, the nth term = 2n. To find the 1st term, put n = 1 into the formula, to find the 4th term, replace the n's by 4's: 4th term = 2 × 4 = 8.
Does this help?
