• Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month

Investigating Divisibility

Extracts from this document...

Introduction

1. Factorise the expression P(n) = nx - n for x ? {2, 3, 4, 5}. Determine if the expression is always divisible by the corresponding x. If divisible use mathematical induction to prove your results by showing whether P(k+1) - P(k) is always divisible by x. Using appropriate technology, explore more cases, summarize your results and make a conjecture for when nx - n is divisible by x. 1.1 Factorise the expression P(n) = nx - n for x ? {2, 3, 4, 5}. When n is real numbers; x = 2 P(n) = n2 - n = n (n - 1) x = 3 P(n) = n3 - n = n (n2 - 1) = n (n + 1) (n - 1) x = 4 P(n) = n4 - n = n (n3 - 1) = n (n - 1) (n2 + n + 1) x = 5 P(n) = n5 - n = n (n4 - 1) = n (n2 + 1) (n2 - 1) = n (n2 + 1) (n - 1) (n + 1) 1.2 Determine if the expression is always divisible by the corresponding x. 1.2.1 x = 2 P(n) = n2 - n = n (n - 1) divisible by 2? When n = 1 n (n - 1) = 1 (1 - 1) = 1 (0) As 0�2 = 0, P(n) is divisible by 2 when x = 2 and n = 1 Assume n = k is correct k (k - 1) = k2 - k = 2M (where M is any natural number) Then considering n = k + 1 (k + 1) (k) = k2 + k = (k2 - k) +2k = 2M + 2k = 2(M + k) Therefore, P(n) = n2 - n is divisible by 2 when x = 2 and n = any natural numbers. 1.2.2 x=3 P(n) = n (n + 1) (n - 1) divisible by 3? When n = 1 n (n + 1) ...read more.

Middle

495k4 + 220k3 + 66k2 + 12k + 1 - k - 1 - k12 + k = 12k11 + 66k10 + 220k9 + 495k8 + 792k7 + 924k6 + 792k5 + 495k4 + 220k3 + 66k2 + 12k Therefore, as P(n) = nx - n and x = 12, P(k+1) - P(k) is not divisible by x. x = 13; P(k+1) - P(k) = (k + 1)x - (k + 1) - kx + k = (k + 1)13 - (k + 1) - k13 + k = k13 + 13k12 + 78k11 + 286k10 + 715k9 + 1287k8 + 1716k7 + 1716k6 + 1287k5 + 715k4 + 286k3 + 78k2 + 13k + 1 - k - 1 - k13 + k = 13k12 + 78k11 + 286k10 + 715k9 + 1287k8 + 1716k7 + 1716k6 + 1287k5 + 715k4 + 286k3 + 78k2 + 13k = 13(k12 + 6k11 + 22k10 + 55k9 + 99k8 + 132k7 + 132k6 + 99k5 + 55k4 + 22k3 + 6k2 + k) Therefore, as P(n) = nx - n and x = 13, P(k+1) - P(k) is divisible by x. x = 14; P(k+1) - P(k) = (k + 1)x - (k + 1) - kx + k = (k + 1)14 - (k + 1) - k14 + k = k14 + 14k13 + 91k12 + 364k11 + 1001k10 + 2002k9 + 3003k8 + 3432k7 + 3003k6 + 2002k5 + 10014 + 364k3 + 91k2 + 14k + 1 - k - 1 - k14 + k = 14k13 + 91k12 + 364k11 + 1001k10 + 2002k9 + 3003k8 + 3432k7 + 3003k6 + 2002k5 + 10014 + 364k3 + 91k2 + 14k Therefore, as P(n) = nx - n and x = 14, P(k+1) - P(k) is not divisible by x. 1.5 Summarize your results and make a conjecture for when nx - n is divisible by x. ...read more.

Conclusion

Hence, it forms = c x n. Therefore, n divides when n is prime. 4. State the converse of your conjecture. Describe how you would prove whether or not the converse holds. Converse means words so related that one reverses the relation denoted by the other. Hence, stating the converse of my conjecture simply means to rewrite my conjecture backwards. My original conjecture was in Pascals' triangle, when x is a prime number in and r is any number between 1 and x - 1, any term in that row is a multiple of designated prime number x. Converse of this would be, if every term in a row in Pascal's triangle, excluding first term and last term, are able to be divisible by a certain number, then that certain number is 1 or a prime number. To investigate whether this converse of my conjecture holds, firstly I would examine each term of each row whether it has a common factors. Then, by listing out all the common factors, it then could be determined whether the common factors are 1 or a prime number or not. If all the common factors are 1 or prime number, then the converse holds. However, if the common factors are not 1 or prime number, the converse of my original conjecture is false. For example, row 6 contains; 6, 15, 20, 15, 6 (excluding 1st and last term). The common factors of these terms would be 1. Hence, the converse holds. Examine row 4 which contains; 4, 6, 4 (excluding 1st and last term). The common factors of these terms would be 1 and 2. Hence, as 2 is a prime number, the converse holds. Another example would be row 9. Row 9 contains; 9, 36, 84, 126, 126, 84, 36, 9 (excluding 1st and last term). The common factors of these terms would be 1, 2 and 3. All of these three common factors are prime number, hence the conjecture holds. By considering these examples, it could be stated that the converse of my original conjecture is proved that it holds. ?? ?? ?? ?? 1 ...read more.

The above preview is unformatted text

This student written piece of work is one of many that can be found in our International Baccalaureate Maths section.

Found what you're looking for?

  • Start learning 29% faster today
  • 150,000+ documents available
  • Just £6.99 a month

Not the one? Search for your essay title...
  • Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month

See related essaysSee related essays

Related International Baccalaureate Maths essays

  1. Stellar Numbers. In this task geometric shapes which lead to special numbers ...

    =337 + 84 =433 6S8 With this formula proven I can reach a statement for stage 7: 6S7 = 6S7-1 + 12(7) 5. Find a general statement for the 6-stellar at stage Sn in terms of n Finding a general statement: Now that I have more terms and now that

  2. Maths Investigation: Pascals Triangles

    I observed that the sum of every row is the double that of the previous number 3. A general formula is that the Sum of the nth row = 2n Maths formula per row would therefore be: Row 0:(x+1)^0 = 1 Row 1:(x+1)^1 = 1 + x Row 2:(x+1)^2 =

  1. There are n cards in a pile. The cards are numbered 1 to n ...

    the formula 2(n-1), n being the number of cards from 1 to n. 3) Usage of formula for 3 piles. Using Excel, the predicted results for n=6 to n=15 are as follows. Table 2 The number of moves was calculated using the fill down option.

  2. Investigating Divisibility

    x=5, is P(n) = n(n2+1) (n +1) (n -1) divisible by 5? Yes. iii) If divisible, use mathematical induction to prove your results by showing whether P(k+1) - P(k) is always divisible by x. P(n) = nx - n Difference = P(k+1) - P(k) = (k + 1) x - (k +1)

  1. Series and Induction

    (b). Sn = (1 x 2) + (2 x 3) + (3 x 4) + ...... + n(n+1) Sn = ? n(n+1) = ? (n2 + n) = ? n2 + ? n We know that n2 - (n-1)2 = n2 - n2 + 2n - 1 = 2n - 1 Thus, 12 - 02 =

  2. MATH IB SL INT ASS1 - Pascal's Triangle

    r Y5(r) Y6(r) Y7(r) Y8(r) Y8(9) 0 15 21 28 36 45 1 11 16 22 29 37 2 9 13 18 24 31 3 9 12 16 21 27 4 11 13 16 20 25 5 15 16 18 21 25 6 - 21 22 24 27 7

  1. Lacsap triangle investigation.

    order to find out which equation best fits the data, the coefficient of determination will be used. Coefficient of determination (R2) is used to deduce how well future outcomes can be predicted using the model which represents the data set.

  2. The purpose of this investigation is to explore the various properties and concepts of ...

    In this case, the first half of the alphabet is allocated even numbers, while the remaining half is allocated odd numbers. This renders the code tougher to break without the alphanumeric system being provided to the intended reader. Now, a message, written in English, was created.

  • Over 160,000 pieces
    of student written work
  • Annotated by
    experienced teachers
  • Ideas and feedback to
    improve your own work