• 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
10. 10
10
11. 11
11
12. 12
12
13. 13
13
14. 14
14
• Level: GCSE
• Subject: Maths
• Word count: 1660

# Maths - Baker's Dozen

Extracts from this document...

Introduction

Baker’s Dozen Coursework

A baker had laid out three Chelsea Buns (C) and three Bath Buns. His wife decided that they would look better if all of the Chelsea Buns were moved to the left hand side, and all of the Bath Buns to the right hand side. In order to achieve this she would have to swap a bun with its neighbour in the smallest possible number of moves. This means swapping:

To

Starting by swapping the Chelsea Buns first, bringing them to the left hand side would be illogical as it would mean swapping a Chelsea Bun with a Chelsea Bun. So, in this case we will start with moving the Bath Buns first.

We start with one Bath Bun on the RHS, and a Chelsea bun on the LHS.

Start

We are now bringing the Bath Buns over to the RHS, forcing the Chelsea Buns to the LHS.

Swap 1

We have collected two Baths Buns to the RHS, leaving one isolated.

Swap 2

The final swap has been made leaving all the Baths Buns on the RHS and the Chelsea Buns on the LHS.

Swap 3

After investigating with other possible solutions I have deducted that the smallest number of swaps needed to sort out three Chelsea Buns and three Bath Buns is three, as shown above.

Middle

½+ (-½) +c=0

c=0

We can then deduct that:

Tn=½n2+ (-½) n+0

Tn=½n2-½n

We can simplify this to become

Sn=n (n-1), where S is the number of swaps.

2

If this formula is correct for n then it should be correct for all other numbers/ letters. To prove this I shall replace the n with a K which is a constant. The formula would then become

Sk = k (k–1)

2

Now I must prove that the formula can work where n=k+1

RHS:  = (k+1) (k+1-1)

2

= k (k+1)

2

We have proven the right hand side of the formula. The left hand side must now match.

LHS: = Sk+1

= Sk + (k)

= k (k-1) + k

2        1

= k (k-1) + 2k

2

= k2 –k+2k

2

= k2+ k

2

= k (k+1)

2

The left hand side is now also proven. Both sides are the same as they equal k (k+1). Therefore the formula is correct.

2

I will now check the formula by inserting a number which we know the answer to (4 of each bun, results in 6 swaps).

Sn=n (n-1)       Substitute the numbers in S4= 4x (4-1)

2               2

= 4x 3

2

=12

2

= 6 swaps.

We can see from our table of results that there are six swaps when there are four of each bun meaning that this formula is definitely correct.

In the third question I will add more variations.

Conclusion

Tn = 1.5n2 – 1.5n

Tn = 1.5 x 32 – 1.5 x 3

Tn = 13.5 - 4.5

Tn = 9

Nine swaps are correct for three of each bun, which has been shown above by diagrams and in the table. Therefore this formula is correct and has been proven.

The second variation I will use is that the Chelsea Buns and Bath Buns are arranged in a different order that is:

It will have to be rearranged to form:

One pair of each bun:

No swaps have to be made as this is already in order.

Two pairs of each bun:

Start

Swap 1

Swap 2

Swap 3

Swap 4

Only four moves are needed to sort out eight buns.

3 pairs of each bun:

Start

Swap 1

Swap 2

Swap 3

Swap 4

Swap 5

Swap 6

Swap 7

Swap 8

Swap 9

Swap 10

Swap 11

Swap 12

There are twelve swaps needed when there are three pairs of each bun.

We have enough information to draw up another table.

 Number of Each Pair Number of All Buns Number of Swaps 1 4 0 2 8 4 3 12 12 4 16 24

We must use a linear sequence. The common difference is 4 as we can see below.

0        4        12        24

4        8         12

4         4

To work out the formula we must use the rule Tn = an2 + bn + c.

2a = 4

a = 2

3a+ b= 4

3 x 2 +b = 4

6 + b = 4

b= -2

a + b + c = 0

2 + (-2) + c = 0

1 + c = 0

c = 0

Tn = 2n2 – 2n

Substitution can be used once again.

Tn = 2n2 – 2n                                                 Tn = 2n² - 2n

Tn = 2 x 4 – (2 x 2)                                Tn = 2 x 16 – (2 x 4)

Tn = 8 – 4                                                Tn = 32 - 8

Tn = 4                                                Tn = 24 Four is also right.

This is correct as for 2 pairs of buns there are four swaps.

This student written piece of work is one of many that can be found in our GCSE Consecutive Numbers 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 GCSE Consecutive Numbers essays

1. ## GCSE Maths Coursework - Maxi Product

I have found that 7 and 7 are the two numbers which added together make 14 and when multiplied together make 49 which is the highest possible answer which is retrieved when two numbers added together equal 14 are multiplied.

2. ## Investigate the Maxi Product of numbers

(8.1,7.9)= 16 à 8.1+7.9 à 8.1x7.9 =63.99 (8.2,7.8)= 16 à 8.2+7.8 à 8.2x7.8 =63.93 (2dp) (8.01,7.99)= 16 à 8.01+7.99 à 8.01x7.99=63.999 I still have not yet found a number higher than 64 in decimal numbers. I will try now in fractional numbers if I can get a number higher than 64.

1. ## In this investigation I will explore the relationship between a series of straight, non-parallel, ...

= (42 - 3(4) + 2) 2 CR(4) = 16 - 12+ 2 2 CR(4) = 6 2 CR (4) = 3 CORRECT! CR(6) let n = 6 CR(6) = (62 - 3(6) + 2) 2 CR(6) = 36 - 18+ 2 2 CR(6) = 20 2 CR (6)

2. ## A baker's dozen

I will now test the formula to see if it is correct. I will test the formula with the number 3. The outcome according to my table should be 3. 0.5 * 32 - 0.5 * 3 = 3 I will now prove my formula is correct using induction.

1. ## I am to conduct an investigation involving a number grid.

I am now going to do a formula for a 10 x 10 grid using a rectangle box instead of a square box. � 3 x 2 boxes Box 1 7 8 9 X X+1 X+2 17 18 19 X+10 X+11 X+12 [image015.gif] [image044.gif] 7 x 19 = 133 x (x + 12)

2. ## Investigate calendars, and look for any patterns.

Then I explored what happened to a box with 6 numbers. Ex 5.4 Starting 1st February 1 2 3 1 x 10 = 10 8 9 10 3 x 8 = 24 The difference, significantly is 14 Ex 5.5 Starting June 2nd 2 3 4 2 x 11 = 22

1. ## To investigate consecutive sums. Try to find a pattern, devise a formulae and establish ...

I shall prove this by using the formulae previously worked out as examples. xn-x+n1 2n-2+1 2n-1( 3n-3+3 3n( 4n-4+6 4n+2( 5n-5+10 5n+5( I shall also attempt to back up my theory formula 6n-6+15 6n+9( From this it would appear that my formula is accurate and correct, however it is limited

2. ## About Triangular Square Numbers

55420693056, that it is the square of 235416, and that it is the 332928th triangular number. Also, which is closer to = 1.41421356237... My conjecture is that this algorithm generates a countable infinity of triangular squares, and that any and all triangular squares which exist will be generated by this algorithm.

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