• Join over 1.2 million students every month
• Accelerate your learning by 29%
• Unlimited access from just £6.99 per month
Page
1. 1
1
2. 2
2
3. 3
3
4. 4
4
5. 5
5
6. 6
6
7. 7
7
8. 8
8
9. 9
9

# Lines, Regions and Crossovers

Extracts from this document...

Introduction

Coursework Title:Lines

Candidate number: 5115

Centre name: Geoffrey Chaucer Technology College

Centre number:10818

Plan

Firstly In this coursework I will draw six or more lines which will cross each other and while doing this I hope to get as much crossover points as I can, as well as I will try to get the maximum regions. I will try to avoid any sort of double intersecting i.e. intersecting over a ready made crossover point.

I will try and keep all my lines as consistent (placement). To make sure I do this I will draw 1 line and then copy past it and then add another line this will help me keep my lines the same i.e. consistent. But I will vary the number of lines I use. I will draw six line models (each having one more line than the previous one) the first model that I will create will have only one line the second will have two lines the third will have three lines etc.

Secondly I will try to figure out the formulas that will find the nth term for the crossover points, open regions, closed regions and the total regions. I also plan to find the relationships / sequence between any two of these characteristics of the line(s). I will accomplish this by using the following formula:  A+B (n+1) +0.5(n-1) (n-2) C.

A = 1st term of the sequence.

Middle

7

11

16

22

Difference

0

0

-1

-3

-6

-10

Table shows relationship between closed total regions

 No. ofLines 1 2 3 4 5 6 Closed Regions 0 0 1 3 6 10 Total Regions 2 4 7 11 16 22 Difference -2 -4 -6 -8 -10 -12

The nth term

The nth term is useful in order to predict the next number in any particular sequence without actually going through the trouble of working it out, which in this case means drawing the lines and counting the number of open regions for example. It can be worked out by using the formula below:

A+B (n-1) +0.5(n-1) (n-2) C

Where,

A = 1st term in the sequences below.

B = The 1st difference between the two different terms in the sequences below.

C = the 2nd difference in the sequences below which is always constant.

Working out the nth term for closed regions

Sequence                                 0  0  1  3  6  10

1st Difference                      0  1  2  3  4

2nd Difference                        1  1  1  1

Consequently,

A = 0

B = 0

C = 1

The equation for closed regions is = 0+0(n+1) +0.5(n-1) (n-2)1

Simplified = (0.5n2)-(1.5n) +1

Formula for nth term = 0.5n2-1.5n+1

Working out the nth term for crossover points

Sequence0  1  3  6  10  15

1st Difference       1  2  3  4    5

2

Conclusion

Evaluation

In my opinion my investigation went quite well. I was able to prove my hypothesis correct and was able to fulfil my aim of working out the nth term for many regions.

It took me a while to draw the diagrams as I wanted each crossover to give me the maximum number of open and closed regions. But once I had the diagrams, I simply put the results in a table and then looked for any obvious or underlying sequence.

Problems and hurdles I faced while undergoing the investigation:

• I had a bit of a problem trying to make sure that I didn’t double intersect the lines  because if I did that would have ruined all my investigation as it wouldn’t have been a fair examination  to make sure I didn’t do this I double checked all my lines before I went ahead in the investigation.
• I also had a bit of a problem trying to find a complex pattern but after a while I managed to find it.

How would I improve my investigation next time:

• I would give my self a longer time span in order to complete my investigation which will help me enhance the quality of my work.
• I would try to find more complex patterns in order for me to do this I will have analyze all my work more carefully.

Bibliography

1. www.bbcbitesize.com
2. Class work
1. CGP intermediate-GCSE maths revision guide / book

This student written piece of work is one of many that can be found in our University Degree Mathematics 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

# Related University Degree Mathematics essays

1. ## Edgar Allan Poe's The Raven is 108 lines long, and is written introchaic octameter, ...

and that the narrator is sitting alone next to a fire, attempting, vainly, to dull the pain of his lost Lenore by reading a book. Poe uses auditory imagery- "gently rapping, rapping." The rhythm produced with the repetition of "rapping" produces an imagined sound of a knock at the chamber door with each syllable.

2. ## The Fibonacci Sequence and Generalizations

the system of equations (15) can be written in matrix form as uk+1 = Auk (17) The vector uk could be written in terms of u0 by noting that uk = Auk-1 = AAuk-2=.....=Aku0 (18) As in the case for the Fibonacci sequence, the main goal is to find a general formula for Ak by possibly diagonalizing A.

1. ## Mathematics Coursework - Beyond Pythagoras

Length of shortest side Length of middle side Length of longest side Perimeter Area 6 8 10 24 24 10 24 26 60 120 14 48 50 112 336 18 80 82 180 720 22 120 122 264 1320 26 168 170 364 2184 30 224 226 480 3360 34

2. ## Greek Maths

Archimedes then proceeds to rule out both of these possibilities. Firstly if Y is less than Z then triangles can be drawn in the segment, with total area T, giving Z - T < Z - Y. But this would imply that T > Y which is impossible because the summation formula shows that T < (4/3)X = Y.

1. ## OPTIMAL PATH PLANNING USING AN IMPROVED A* ALGORITHM FOR HOMELAND SECURITY APPLICATIONS

Table 6 shows the Maximum paths and Maximum nodes to compute optimal paths for different Manhattan distance values after adding the additional heuristic to the general search algorithm. Manhattan Distance Maximum paths Maximum nodes 30 80 7 35 201 8 40 452 9 45 1020 10 50 2198 11 55

2. ## This paper intends to examine the words starting with given in the Oxford ...

snootiness snooty, a. snoove, v. snooze, n. snooze, v. snoozer snooziness snoozing, vbl. n. snoozing, ppl. a. snoozle, v. snoozy, n. snoozy, a. snop, n. snop, v. Snopes snore, n. snore, v. snore- snoreless, a. snorer snoring, vbl. n. snoring, ppl. a. snork, n. snork, v. snorkel, schnorkel snorkle snorl, v.

1. ## Analysis of a Sequence from Birth of a Nation

Lincoln looks off screen to the right in another example of continuity editing and acknowledges a group of the audience clapping and waving. We then see a different angled shot that allows us to see both the audience and the president's box at the same time with the use of

2. ## History and Social Context of Mathematics.

For example (from row 1): 1692 - 1192 = 1202. Although there are a couple of scribal transcription errors in the original (marked with *), the middle two columns show a list of Pythagorean Triples. An achievement in itself, until we look at the first column.

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