AQA A Level Further Maths Paper 3D June 2024 question paper 7367/3D

Which one of the following sets forms a group under the given binary operation? Tick (✓) one box.

A student is trying to find the solution to the travelling salesperson problem for a network.

They correctly find two lower bounds for the solution: 15 and 19

They also correctly find two upper bounds for the solution: 48 and 51

Based on the above information only, which of the following pairs give the best lower bound and best upper bound for the solution of this problem? Tick (✓) one box.

The simple-connected graph G has the adjacency matrix

Which one of the following statements about G is true? Tick (✓) one box.

_ G is a tree

G is complete

G is Eulerian

G is planar

Prove that the game does not have a stable solution.

Fully justify your answer.

Determine the play-safe strategy for each player.

The owners of a sports stadium want to install electric car charging points in each of the stadium’s nine car parks.

An engineer creates a plan which requires installing electrical connections so that each car park is connected, directly or indirectly, to the stadium’s main electricity power supply.

The engineer produces the network shown below, where the nodes represent the stadium’s main electricity power supply X and the nine car parks A, B, …, I

Each arc represents a possible electrical connection which could be installed. The weight on each arc represents the time, in hours, it would take to install the electrical connection. The electrical connections can only be installed one at a time.

To reduce disruption, the owners of the sports stadium want the required electrical connections to be installed in the minimum possible total time.

Determine the electrical connections that should be installed.

Find the minimum possible total time needed to install the required electrical connections.

Following the installation of the electrical connections, some of the car parks have an indirect connection to the stadium’s main electricity power supply.

Give one limitation of this installation.

A company delivers parcels to houses in a village, using a van.

The network below shows the roads in the village. Each node represents a road junction and the weight of each arc represents the length, in miles, of the road between the junctions.

The total length of all of the roads in the village is 31.4 miles.

On one particular day, the driver is due to make deliveries to at least one house on each road, so the van must travel along each road at least once. However, the driver has forgotten to add fuel to the van and it only has 4.5 litres of fuel to use to make its deliveries.

The van uses, on average, 1 litre of fuel to travel 7.8 miles along the roads of this village. Whilst making each delivery, the driver turns off the van’s engine so it does not use any fuel.

Determine whether the van has enough fuel for the driver to make all of the deliveries to houses on each road of the village, starting and finishing at the same junction.

Fully justify your answer.

By considering associativity, show that the set of integers does not form a group under the binary operation of subtraction.

Fully justify your answer.

The group G is formed by the set

{1, 7, 8, 11, 12, 18}

under the operation of multiplication modulo 19

Complete the Cayley table for G

State the inverse of 11 in G

State, with a reason, the possible orders of the proper subgroups of G

The group H is such that G H

State a possible name for H

Figure 1 shows a network of water pipes. The number on each arc represents the upper capacity for each pipe in litres per second. The numbers in the circles represent an initial feasible flow of 103 litres per second.

On Figure 1 above, add a supersource S and a supersink T to the network.

Using flow augmentation, find the maximum flow through the network. You must indicate any flow augmenting paths clearly in the table below. You may use Figure 2, on the opposite page, in your solution.

Maximum Flow _________________ litres per second

While the flow through the network is at its maximum value, the pipe EG develops a leak.

To repair the leak, an engineer turns off the flow of water through EG

The engineer claims that the maximum flow of water through the network will reduce by 31 litres per second.

Comment on the validity of the engineer’s claim.

Explain why Janet should never play strategy J₄

Janet wants to maximise her winnings from the game.

She defines the following variables. p₁ = the probability of Janet playing strategy J₁ p₂ = the probability of Janet playing strategy J₂ p₃ = the probability of Janet playing strategy J₃ v = the value of the game for Janet

Janet then formulates her situation as the following linear programming problem.

Maximise P = v

Complete the initial Simplex tableau for Janet’s situation in the grid below.

Hence, perform one iteration of the Simplex algorithm, showing your answer on the grid below.

A project is undertaken by Higton Engineering Ltd.

The project is broken down into 11 separate activities A, B,..., K

Figure 3 below shows a completed activity network for the project, along with the earliest start time, duration, latest finish time and the number of workers required for each activity. All times and durations are given in days.

Write down the critical path.

Using Figure 4 below, draw a resource histogram for the project to show how the project can be completed in the minimum possible time. Assume that each activity is to start as early as possible.

Higton Engineering Ltd only has four workers available to work on the project. Find the minimum completion time for the project. Use Figure 5 below in your answer.