A.
(2x + 3)2 = | 1×(2x)2×30 + 2×(2x)1×31 + 1×(2x)0×32 |
= | 4x2 + 12x + 9 |
(2x + 3)3 = | 1×(2x)3×30 + 3× (2x)2×31 + 3×(2x)1×32 + 1×(2x)0×33 |
= | 8x3 + 36x2 + 54x + 27 |
(2x + 3)6 = | 1×(2x)6×30 + 6×(2x)5×31 + 15×(2x)4×32 + 20×(2x)3×33 + 15×(2x)2×34 + 6×(2x)×35 + 1×(2x)0×36 |
= | 64x6 + 576x5 + 2160x4 + 4320x3 + 4860x2 + 2916x + 729 |
Simplify completely problems 2-6 using a common denominator.
SHOW WORK!
1 | + | 1 | = | 13 + 7 | = | 20 |
7 | 13 | 91 | 91 |
1 | + | 1 | + | 1 | = | 143 + 91 +77 | = | 311 |
7 | 11 | 13 | 1001 | 1001 |
2/3 + 1/2 | = | 4/6 + 3/6 | = | 7/6 | = | 7/6 × 6/1 | = | 7 | = 7 |
5/12 - 1/4 | 5/12 - 3/12 | 2/12 | 1/6 × 6/1 | 1 |
35 | ÷ | 15 | × | 6 | = | 35 | × | 34 | × | 6 | = | 1 |
× | 2 |
× | 2 |
= 4 |
17 | 34 | 7 | 17 | 15 | 7 | 1 |
1 | 1 |
For problems 16-18:
Egyption fraction is another name for unit fraction. In ancient Egypt,
these were the only fractions allowed. Other fractions between
zero and one were always expressed as a sum of distinct Egyption
fractions. The greedy algorithm was commonly used to render
fractions, such as 3/5, into unit fractions.
The algorithm begins by finding two consecutive unit fractions that the
given fraction is between ( 1/2 < 3/5 < 1/1). Using the smallest
fraction, subtract it from the given fraction. This new number plus the
smaller fraction is the result. The greedy Egyption number for 3/5 is
1/2 + 1/10 (3/5 - 1/2 = 6/10 - 5/10 = 1/10). Of course, there is no
guaranty the result is a unit fraction, so more than 2 fractions may
well be required. (See MMPC 1996, part II, problem 1.)
BACK to the LESSON | HOMEWORK | ACTIVITY | NEXT LESSON |