STEP Support Programme. Hints and Partial Solutions for Assignment 17

Size: px

Start display at page:

Download "STEP Support Programme. Hints and Partial Solutions for Assignment 17"

Maude Lester
5 years ago
Views:

STEP Support Programme Hints and Partial Solutions for Assignment 7 Warm-up You need to be quite careful with these proofs to ensure that you are not assuming something that should not be assumed.

(i) We have N + N 2 = n + am + n 2 + am 2 = n + n 2 + a(m + m 2 ) for some integers m and m 2 and some integers n and n 2 both in the interval 0 to a, and therefore: (N + N 2 ) mod a = (n + n 2 ) mod

Similarly and N N 2 = (n + am )(n 2 + am 2 ) (n + am )(n 2 + am 2 ) = n n 2 + a(m + m 2 + am m 2 ). Then write n n 2 = aq + (n n 2 ) mod a for some suitable q.

1 STEP Support Programme Hints and Partial Solutions for Assignment 7 Warm-up You need to be quite careful with these proofs to ensure that you are not assuming something that should not be assumed. For example, in general: (x + y) mod a x mod a + y mod a. Take x = 9, y = 3 and a = 5 to see why it doesn t hold ( ). (i) We have N + N 2 = n + am + n 2 + am 2 = n + n 2 + a(m + m 2 ) for some integers m and m 2 and some integers n and n 2 both in the interval 0 to a, and therefore: (N + N 2 ) mod a = (n + n 2 ) mod a If n + n 2 < a then we have (n + n 2 ) mod a = n + n 2, but if n + n 2 > a then we have n + n 2 = a + (n + n 2 ) mod a. Note that as both n and n 2 are less than a, we must have n + n 2 < 2a. Similarly and N N 2 = (n + am )(n 2 + am 2 ) (n + am )(n 2 + am 2 ) = n n 2 + a(m + m 2 + am m 2 ). Then write n n 2 = aq + (n n 2 ) mod a for some suitable q. This gives us: N N 2 = a [q + m + m 2 + am m 2 ] + (n n 2 ) mod a and hence we have: N N 2 mod a = n n 2 mod a. (ii) We have: 0a + b = (0 mod 3) (a mod 3) + b mod 3 [mod 3] = (a mod 3) + b mod 3 [mod 3] = (a + b) [mod 3] If 0a + b is divisible by three then we need 0a + b = 0 (mod 3), which is true if and only if a + b = 0 (mod 3) i.e. a + b is divisible by three. Hints and Partial Solutions for A7

2 As we know 0 mod 3 =, we have 0 n n mod 3. The n-digit number with digits a a 2 a n is equal to 0 n a + 0 n 2 a a n. We then have: 0 n a + 0 n 2 a a n = a + a a n (mod 3) and so any number is divisible by 3 if and only if the digit sum is divisible by 3. We note that 0 n = ( ) n so and 0 n ( ) n (mod ) 0 3 a b + 0c + d a + b c + d (mod ) and so a 4 digit number is divisible by if and only if the negative of the first digit plus the second digit minus the third digit plus the last digit is divisible by (this is a lot nicer written in symbols!). For example, 396 is divisible by as =. A similar calculation works for numbers of any number of digits. Hints and Partial Solutions for A7 2

3 Preparation 2 (i) Easiest way to start here is to subtract the second equation from the first equation, and subtract the fourth equation from the third (it is a very good idea to label the equations!). You will then get two equations in just x and z, which are 2x + 2z = and 6x + 2z = 4. These can be solved to give x = 3 and z = 6. Substituting these values into the first and third equation (for example) gives the equations w + y = 2 and 4w + 2y = 3 2. Solving these gives w = 4 and y = 4. (ii) Note that we don t have to start with i =. (a) = 49 2 (b) = 0. To do the first part, you could use partial fractions on the RHS and use r r + ( Consider r= r r + you will see that lots of bits cancel. = (r + ) r r(r + ) = r(r + )., or you could start on r(r + ) ). If you write the first few terms and the last one or two Answer: n n+ The check with n = 3 gives: = = 9 2 = 3 4 = n n + as required Note that = 200 r= 99, so the sum is equal to 200 r= = The numerator is equal to Re-writing the second term as (200 + )(00 ) means that the numerator can be written as = 0. (iv) If two algebraic expressions are equivalent then they are equal in value for any value of x. Using the given values of x gives the simultaneous equations a + 2 b = 2 and 2 a + 3 b = 6 which you can solve to get a = and b =. Splitting the fraction up like this is known as partial fractions. Another way of doing this is to equate numerators to get a(x + 2) + b(x + ) and then you can substitute x = and x = 2 to find a and b. Hints and Partial Solutions for A7 3

4 The STEP question (2003 STEP I Q) 3 For the first part, using n = 0 gives s =. Then using n = and n = gives the equations = p + q r + s and 2 = p + q + r + s which means that we can cancel p and r easily to give 2q + 2s = 3 = q = 2. Using n = and n = 2 gives p + r = 2 and 8p + 2r = 3 which can be solved to give p = 3 and r = 6. Then use: which gives: r= r 2 = r 2 + ( ) 2 r 2 = 3 n3 + 2 n2 + 6 n +. You can then take out a factor of 6 n to give 6 n ( 2n 2 + 3n + ) = 6n(2n + )(n + ). For the second part, the easiest thing is to take n = 2,, 0,, 2 note that we need 5 equations as there are 5 unknowns. Other values of n are possible but not as easy, For example, adding together the equations obtained by using x = 2 and x = 2 will result in b and d cancelling. Using n = 0 gives ( 2) 3 + ( ) = e = e = 9. Using n = and n = gives the two equations a b+c d+e = 9 and a+b+c+d+e = 8. These can be added and subtracted to give: 2a + 2c + 2e = 7 () 2b + 2d = (2) Using n = 2 and n = 2 gives 6a 8b + 4c 2d + e = 8 and 6a + 8b + 4c + 2d + e = 0. These can be combined to give: 32a + 8c + 2e = 8 (3) 6b + 4d = 8 (4) Solving the simultaneous equations given by (2) and (4) gives b = 2 and (3) (remembering that e = 9) gives a = 4 and c = 4. We also need: r 3 = r 3 + ( ) 3 + ( 2) 3 r= 2 and d = 0. Solving () which gives: r 3 = 4 n4 + 2 n3 + 4 n = 4 n2 (n 2 + 2n + ) = 4 n2 (n + ) 2 Hints and Partial Solutions for A7 4

5 Warm down 4 (i) If you use 3 2 (mod 5) then you get: 3 2 2n n 2 2 2n + 2 ( 2) 2n (mod 5) and as 2n is even, ( 2) 2n = 2 2n, hence 3 2 2n n 2 2 2n n 0(mod 5). (ii) We have 2 5 (mod 3) and 56 2 (mod 3). Hence 2 n + 5 n + 56 ( ) n + ( ) n + 2 (mod 3). We also have 2 n + 5 n n + ( 2) n + 0 (mod 7). So if n is odd, 2 n + 5 n for both mod 3 and mod 7, so it is divisible by both 3 and 7, as as these have no common factors must be divisible by 2. And for the last part: 2 3m +5 3m +56 = 8 m +25 m +56 ( ) m +( ) m +2 (mod 9), which is equivalent to 0 if m is odd. Hence 2 n + 5 n + 56 is divisible by 9 and 7 and so is divisible by 63. In the general case for n odd, we have three cases, n = 3m (where m must be odd - this is the case you were asked to consider) or n = 3m + (here m must be even) or n = 3m + 2 (m must be odd). You then consider each case separately, so for example the second case gives: 2 n + 5 n + 56 = 2 3m m m even 2 (2 3 ) m + 5 (5 3 ) m + 2 [mod 9] 2 ( ) m + 5 ( ) m + 2 [mod 9] 9 0 [mod 9] Lots of ways of doing this. For example, you could start by showing that: 2 3n n+ = 2 8 n n and then consider this modulo 7 (using 25 8 [mod 7]) to give: 2 3n n+ = 2 8 n n 2 8 n n [mod 7] = 7 8 n 0 [mod 7] Hints and Partial Solutions for A7 5

Chapter 1 Review of Equations and Inequalities

Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve