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

Browse by
Word count:
fewer than 1000 (2)
1000-1999 (3)
2000-2999 (1)
3000+ (3)

Meet our team of inspirational teachers

Get help from 80+ teachers and hundreds of thousands of student written documents

1. ## GCSE Maths questions

• Develop your confidence and skills in GCSE Maths using our free interactive questions with teacher feedback to guide you at every stage.
• Level: GCSE
• Questions: 75

Hour Total number of bad tomatoes 0 1 1 3 2 6 3 10 4 15 5 21 By looking at this table of results, I can now produce a sequence. 1 2 3 4 5 3 6 10 15 21 +3 +4 +5 +6 +1 +1 +1 Natalie Hayes 10E group 3 Page 2 The first thing I noticed when looking at my sequence was that the difference between each number increased by 1 each time e.g. +1, +2, +3, +4, +5, +6.

• Word count: 2289

Part 1 There are 3 different positions for the tomatoes to start going bad. The first position is anywhere in the middle of any side: As you can see, the first tomato to go bad is the one coloured black. And then the tomatoes it touches go bad until all the tomatoes in the tray have gone bad. Also it doesn't matter which side the tomato starts going bad as long as it's in the middle and on the side. A table can be drawn from this for analysis and to generate a formula: Number of hours ( )

• Word count: 679
4. ## In this project I am going to examine the time taken for a whole tray of tomatoes to go bad when a single bad tomato is put in a particular position.

2 3 4 5 1 2 3 4 2 3 4 5 3 4 5 6 Hours (n) Total No. Of Bad Tomatoes 1st Difference 2nd Difference 1 1 3 2 4 1 4 3 8 0 4 4 12 -1 3 5 15 -2 1 6 16 The table on the previous page tells me what is involved in the nth term. The column labelled '1st Difference' tells us the difference between the number of bad tomatoes in the first hour to the second hour and so on.

• Word count: 1658

The problem of calculation the total time required for all tomatoes to go bad is the same as the problem of calculating the time needed for bad tomatoes to reach the corner which is most remote from the starting position. If we can calculate the time required for the bad tomatoes to reach the most distant corner from the starting position, we can safely say that the rest of the tray has gone bad as well. Stage one of the analysis We will first consider the easiest case, when the initial bad tomato is at equal distance from both sides of the tray extract, spaced by 'n' rows and 'n' columns from corresponding walls.

• Word count: 1675
6. ## GCSE Maths Bad Tomato Investigation

5 15 1, 2, 5, 3, 6, 9, 4, 7, 10, 13, 8, 11, 14, 12, 15. 6 16 1, 2, 5, 3, 6, 9, 4, 7, 10, 13, 8, 11, 14, 12, 15, 16. A clear pattern can be seen when looking at square trays with a tomato going bad in the corner. Here is a table showing some different sized squares and how long they take to go bad with the bad tomato starting off in the corner: Size (LxL) Amount of time for whole tray to go bad [T(in hours)] 2x2 2 3x3 4 4x4 6 5x5 8 6x6 10 7x7 12 The obvious pattern is that as length - l increases by one, the time for the tray to go bad - t increases by 2.

• Word count: 3047
7. ## GCSE Mathematics - Bad tomatoes

Another hour later tomato 16 is bad. Hours No of bad tomatoes Bad tomato no. 1 st hour 2 1, 6, 9 2nd hour 4 2, 7, 10, 13 3rd hour 4 3, 8, 11, 14 4th hour 3 4, 12, 15 5th hour 1 16 What would happen if tomato no.1 was the bad tomato? 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Hours No of bad tomatoes Bad tomato no. 1st hour 2 2, 5 2nd hour 3 3, 6, 9 3rd hour 4 4, 7, 10, 13 4th hour 3 8, 11, 14 5th hour 2 12, 15 6th hour 1 16 What would happen if tomato no.6 was the first bad tomato?

• Word count: 1724
8. ## GCSE Maths Bad Tomato Investigation

7 8 9 10 11 12 13 14 15 16 8 9 10 11 12 13 14 15 16 17 9 10 11 12 13 14 15 16 17 18 (Numbers indicate the hour at which the tomato went bad, the colours identify the different sized boxes) In each size box the tomato that goes bad first starts in the same position Size (LxL) Time taken for whole tray to go bad (T) No. that go bad each hour 2x2 3 1,2,1 3x3 4 1,3,3,2 4x4 6 1,3,4,4,3,1 5x5 8 1,3,4,5,5,4,2,1 6x6 10 1,3,4,5,6,6,5,3,2,1 7x7 12 1,3,4,5,6,7,7,6,4,3,2,1 8x8 14 1,3,4,5,6,7,8,8,7,5,4,3,2,1

• Word count: 3081