Questions (30179 questions)

Browse by board
AQA AS Paper 1 AS Paper 2 C1 C2 C3 C4 D1 D2 FP1 FP2 FP3 Further AS Paper 1 Further AS Paper 2 Discrete Further AS Paper 2 Mechanics Further AS Paper 2 Statistics Further Paper 1 Further Paper 2 Further Paper 3 Discrete Further Paper 3 Mechanics Further Paper 3 Statistics M1 M2 M3 Paper 1 Paper 2 Paper 3 S1 S2 S3 CAIE FP1 FP2 Further Paper 1 Further Paper 2 Further Paper 3 Further Paper 4 M1 M2 P1 P2 P3 S1 S2 Edexcel AEA AS Paper 1 AS Paper 2 C1 C12 C2 C3 C34 C4 CP AS CP1 CP2 D1 D2 F1 F2 F3 FD1 FD1 AS FD2 FD2 AS FM1 FM1 AS FM2 FM2 AS FP1 FP1 AS FP2 FP2 AS FP3 FS1 FS1 AS FS2 FS2 AS M1 M2 M3 M4 M5 P1 P2 P3 P4 PMT Mocks Paper 1 Paper 2 Paper 3 S1 S2 S3 S4 OCR AS Pure C1 C2 C3 C4 D1 D2 FD1 AS FM1 AS FP1 FP1 AS FP2 FP3 FS1 AS Further Additional Pure Further Additional Pure AS Further Discrete Further Discrete AS Further Mechanics Further Mechanics AS Further Pure Core 1 Further Pure Core 2 Further Pure Core AS Further Statistics Further Statistics AS H240/01 H240/02 H240/03 M1 M2 M3 M4 Mechanics 1 PURE Pure 1 S1 S2 S3 S4 Stats 1 OCR MEI AS Paper 1 AS Paper 2 C1 C2 C3 C4 D1 D2 FP1 FP2 FP3 Further Extra Pure Further Mechanics A AS Further Mechanics B AS Further Mechanics Major Further Mechanics Minor Further Numerical Methods Further Pure Core Further Pure Core AS Further Pure with Technology Further Statistics A AS Further Statistics B AS Further Statistics Major Further Statistics Minor M1 M2 M3 M4 Paper 1 Paper 2 Paper 3 S1 S2 S3 S4 WJEC Further Unit 1 Further Unit 2 Further Unit 3 Further Unit 4 Further Unit 5 Further Unit 6 Unit 1 Unit 2 Unit 3 Unit 4
AQA Further Paper 3 Discrete 2022 June Q1
1 marks Standard +0.3
1 The graph \(G\) has a subgraph isomorphic to \(K _ { 5 }\), the complete graph with 5 vertices. Which of the following statements about \(G\) must be true? Tick ( \(\checkmark\) ) one box. \(G\) is not connected \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-03_104_108_872_973} \(G\) is not Hamiltonian \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-03_108_108_1005_973} G is not planar \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-03_108_108_1142_973} \(G\) is not simple □
AQA Further Paper 3 Discrete 2022 June Q2
1 marks Easy -1.2
2 Graph \(A\) is a connected planar graph with 12 vertices, 18 edges and \(n\) faces.
Find the value of \(n\) Circle your answer. 4
8
28
32 Turn over for the next question
AQA Further Paper 3 Discrete 2022 June Q4
7 marks Standard +0.3
4
8
28
32 Turn over for the next question 3 A company undertakes a project which consists of 12 activities, \(A , B , C , \ldots , L\) Each activity requires one worker.
The resource histogram below shows the duration of each activity.
Each activity begins at its earliest start time.
The path \(A D G J L\) is critical. Number of workers \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-04_504_1145_719_548} The company only has two workers available to work on the project. Which of the following could be a correctly levelled histogram? Tick \(( \checkmark )\) one box. Number of workers \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-05_510_1145_502_459} Number of workers \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-05_515_1145_1059_459} Number of workers \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-05_517_1147_1619_459} Number of workers \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-05_517_1149_2179_458} 4 Ben and Jadzia play a zero-sum game. The game is represented by the following pay-off matrix for Ben.
\multirow{6}{*}{Ben}Jadzia
StrategyXYZ
A-323
B60-4
C7-11
D6-21
4
  1. State, with a reason, which strategy Ben should never play.
    4
  2. Determine whether or not the game has a stable solution.
    Fully justify your answer.
    4
  3. Ben knows that Jadzia will always play her play-safe strategy. Explain how Ben can maximise his expected pay-off.
AQA Further Paper 3 Discrete 2022 June Q5
6 marks Standard +0.3
5 A council wants to convert all of the street lighting in a village to use LED lighting. The network below shows each street in the village. Each node represents a junction and the weight of each arc represents the length, in metres, of the street. The street lights are only positioned on one side of each street in the village. \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-08_1036_1514_616_264} The total length of all of the streets in the village is 2250 metres.
In order to determine the total number of street lights in the village, a council worker is required to walk along every street in the village at least once, starting and finishing at the same junction. The shortest possible distance the council worker can walk in order to determine the total number of street lights in the village is \(x\) metres. 5
  1. Find the value of \(x\) Fully justify your answer.
    [0pt] [4 marks] 5
  2. A new council regulation requires that the mean distance along a street between adjacent LED street lights in a village be less than 25 metres. The council worker counted 91 different street lights on their journey around the village. Determine whether or not the village will meet the new council regulation.
AQA Further Paper 3 Discrete 2022 June Q6
6 marks Moderate -0.5
6
    1. Find the earliest start time and the latest finish time for each activity and show these values on the activity network above. 6
  1. (ii) Identify all of the critical activities. 6
  2. The manager of Bill Durrh Ltd recruits some additional temporary workers in order to reduce the duration of one activity by 2 weeks. The manager wants to reduce the minimum completion time of the project by the largest amount. State, with a reason, which activity the manager should choose.
AQA Further Paper 3 Discrete 2022 June Q8
10 marks Moderate -0.5
8
28
32 Turn over for the next question 3 A company undertakes a project which consists of 12 activities, \(A , B , C , \ldots , L\) Each activity requires one worker.
The resource histogram below shows the duration of each activity.
Each activity begins at its earliest start time.
The path \(A D G J L\) is critical. Number of workers \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-04_504_1145_719_548} The company only has two workers available to work on the project. Which of the following could be a correctly levelled histogram? Tick \(( \checkmark )\) one box. Number of workers \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-05_510_1145_502_459} Number of workers \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-05_515_1145_1059_459} Number of workers \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-05_517_1147_1619_459} Number of workers \includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-05_517_1149_2179_458} 4 Ben and Jadzia play a zero-sum game. The game is represented by the following pay-off matrix for Ben.
\multirow{6}{*}{Ben}Jadzia
StrategyXYZ
A-323
B60-4
C7-11
D6-21
4
  1. State, with a reason, which strategy Ben should never play.
    4
  2. Determine whether or not the game has a stable solution.
    Fully justify your answer.
    4
  3. Ben knows that Jadzia will always play her play-safe strategy. Explain how Ben can maximise his expected pay-off.
AQA Further Paper 3 Discrete 2022 June Q9
6 marks Challenging +1.8
9 The binary operation ⊕ acts on the positive integers \(x\) and \(y\) such that $$x \oplus y = x + y + 8 \quad \left( \bmod k ^ { 2 } - 16 k + 74 \right)$$ where \(k\) is a positive integer.
9
    1. Show that ⊕ is commutative.
      9
  1. (ii) Determine whether or not ⊕ is associative.
    Fully justify your answer.
    9
  2. Find the values of \(k\) for which 3 is an identity element for the set of positive integers under
AQA Further Paper 3 Discrete 2022 June Q10
5 marks Standard +0.3
10 Kira and Julian play a zero-sum game that does not have a stable solution. Kira has three strategies to choose from: \(\mathbf { K } _ { 1 } , \mathbf { K } _ { 2 }\) and \(\mathbf { K } _ { 3 }\) To determine her optimal mixed strategy, Kira begins by defining the following variables: \(v =\) value of the game for Kira \(p _ { 1 } =\) probability of Kira playing strategy \(\mathbf { K } _ { 1 }\) \(p _ { 2 } =\) probability of Kira playing strategy \(\mathbf { K } _ { 2 }\) \(p _ { 3 } =\) probability of Kira playing strategy \(\mathbf { K } _ { 3 }\) Kira then formulates the following linear programming problem. $$\begin{array} { l l } \text { Maximise } & v \\ \text { subject to } & 7 p _ { 1 } + p _ { 2 } + 8 p _ { 3 } \geq v \\ & 3 p _ { 1 } + 7 p _ { 2 } + 2 p _ { 3 } \geq v \\ & 9 p _ { 1 } + 2 p _ { 2 } + 4 p _ { 3 } \geq v \end{array}$$ and $$\begin{array} { r } p _ { 1 } + p _ { 2 } + p _ { 3 } \leq 1 \\ p _ { 1 } , p _ { 2 } , p _ { 3 } \geq 0 \end{array}$$ 10
    1. Explain why the condition \(p _ { 1 } + p _ { 2 } + p _ { 3 } \leq 1\) is necessary in Kira's linear programming problem. 10
  1. (ii) Explain why the condition \(p _ { 1 } , p _ { 2 } , p _ { 3 } \geq 0\) is necessary in Kira's linear programming problem. 10
  2. Julian has three strategies to choose from: \(\mathbf { J } _ { 1 } , \mathbf { J } _ { 2 }\) and \(\mathbf { J } _ { 3 }\) Complete the following pay-off matrix which represents the game for Kira.
    Julian
    \cline { 2 - 5 }Strategy\(\mathbf { J } _ { 1 }\)\(\mathbf { J } _ { 2 }\)\(\mathbf { J } _ { 3 }\)
    \multirow{3}{*}{Kira}\(\mathbf { K } _ { 1 }\)7
    \cline { 2 - 5 }\(\mathbf { K } _ { 2 }\)
    \cline { 2 - 5 }\(\mathbf { K } _ { 3 }\)
AQA Further Paper 3 Discrete 2023 June Q1
1 marks Easy -1.8
1 The simple-connected graph \(G\) is shown below. \includegraphics[max width=\textwidth, alt={}, center]{5ff6e3bb-6392-49cf-b64d-23bc595cd92e-02_271_515_632_762} The graph \(G\) has \(n\) faces. State the value of \(n\) Circle your answer. 2345
AQA Further Paper 3 Discrete 2023 June Q2
1 marks Moderate -0.5
2 Jonathan and Hoshi play a zero-sum game.
The game is represented by the following pay-off matrix for Jonathan.
\multirow{6}{*}{Jonathan}Hoshi
Strategy\(\mathbf { H } _ { \mathbf { 1 } }\)\(\mathbf { H } _ { \mathbf { 2 } }\)\(\mathbf { H } _ { \mathbf { 3 } }\)
\(\mathbf { J } _ { \mathbf { 1 } }\)-232
\(\mathbf { J } _ { \mathbf { 2 } }\)320
\(\mathbf { J } _ { \mathbf { 3 } }\)4-13
\(\mathbf { J } _ { \mathbf { 4 } }\)310
The game does not have a stable solution.
Which strategy should Jonathan never play?
Circle your answer.
[0pt] [1 mark] \(\mathbf { J } _ { \mathbf { 1 } }\) \(\mathbf { J } _ { \mathbf { 2 } }\) \(\mathbf { J } _ { \mathbf { 3 } }\) \(\mathbf { J } _ { \mathbf { 4 } }\)
AQA Further Paper 3 Discrete 2023 June Q3
1 marks Easy -1.8
3 A student is solving a maximising linear programming problem. The graph below shows the constraints, feasible region and objective line for the student's linear programming problem. \includegraphics[max width=\textwidth, alt={}, center]{5ff6e3bb-6392-49cf-b64d-23bc595cd92e-03_1248_1184_502_427} Which vertex is the optimal vertex? Circle your answer. \(A\) B
C
D
AQA Further Paper 3 Discrete 2023 June Q4
5 marks Standard +0.3
4 The network below represents a system of water pipes in a geothermal power station. The numbers on each arc represent the lower and upper capacity for each pipe in gallons per second. \includegraphics[max width=\textwidth, alt={}, center]{5ff6e3bb-6392-49cf-b64d-23bc595cd92e-04_837_1413_493_312} The water is taken from a nearby river at node \(A\) The water is then pumped through the system of pipes and passes through one of three treatment facilities at nodes \(H , I\) and \(J\) before returning to the river. 4
  1. The senior management at the power station want all of the water to undergo a final quality control check at a new facility before it returns to the river. Using the language of networks, explain how the network above could be modified to include the new facility. 4
  2. Find the value of the cut \(\{ A , B , C , D , E \} \{ F , G , H , I , J \}\) 4
  3. Tim, a trainee engineer at the power station, correctly calculates the value of the cut \(\{ A , B , C , D , E , F \} \{ G , H , I , J \}\) to be 106 gallons per second. Tim then claims that the maximum flow through the network of pipes is 106 gallons per second. Comment on the validity of Tim's claim.
AQA Further Paper 3 Discrete 2023 June Q5
8 marks Standard +0.3
5 A student is solving the following linear programming problem. $$\begin{array} { l r } \text { Minimise } & Q = - 4 x - 3 y \\ \text { subject to } & x + y \leq 520 \\ & 2 x - 3 y \leq 570 \\ \text { and } & x \geq 0 , y \geq 0 \end{array}$$ 5
  1. The student wants to use the simplex algorithm to solve the linear programming problem. They modify the linear programming problem by introducing the objective function $$P = 4 x + 3 y$$ and the slack variables \(r\) and \(s\) State one further modification that must be made to the linear programming problem so that it can be solved using the simplex algorithm. 5
    1. Complete the initial simplex tableau for the modified linear programming problem.
      [0pt] [2 marks]
      \(P\)\(x\)\(y\)\(r\)\(S\)value
      5
  2. (ii) Hence, perform one iteration of the simplex algorithm.
    \(P\)\(x\)\(y\)\(r\)\(s\)value
    5
  3. The student performs one further iteration of the simplex algorithm, which results in the following correct simplex tableau.
    \(P\)\(x\)\(y\)\(r\)\(s\)value
    100\(\frac { 18 } { 5 }\)\(\frac { 1 } { 5 }\)1986
    001\(\frac { 2 } { 5 }\)\(- \frac { 1 } { 5 }\)94
    010\(\frac { 3 } { 5 }\)\(\frac { 1 } { 5 }\)426
    5
    1. Explain how the student can tell that the optimal solution to the modified linear programming problem can be determined from the above simplex tableau.
      5
  4. (ii) Find the optimal solution of the original linear programming problem.
AQA Further Paper 3 Discrete 2023 June Q6
8 marks Standard +0.3
6 A council wants to grit all of the roads on a housing estate. The network shows the roads on a housing estate. Each node represents a junction between two or more roads and the weight of each arc represents the length, in metres, of the road. \includegraphics[max width=\textwidth, alt={}, center]{5ff6e3bb-6392-49cf-b64d-23bc595cd92e-08_1145_1458_539_292} The total length of all of the roads on the housing estate is 9175 metres.
In order to grit all of the roads, the council requires a gritter truck to travel along each road at least once. The gritter truck starts and finishes at the same junction. 6
  1. The gritter truck starts gritting the roads at 7:00 pm and moves with an average speed of 5 metres per second during its journey. Find the earliest time for the gritter truck to have gritted each road at least once and arrived back at the junction it started from, giving your answer to the nearest minute. Fully justify your answer.
    [0pt] [6 marks]
    6
  2. Explain how a refinement to the council's requirement, that the gritter truck must start and finish at the same junction, could reduce the time taken to grit all of the roads at least once.
    [2 marks] \(\_\_\_\_\) \(\_\_\_\_\) \(\_\_\_\_\) \(\_\_\_\_\) \(\_\_\_\_\)
    The planning involves producing an activity network for the project, which is shown in Figure 1 below. The duration of each activity is given in weeks. \begin{figure}[h]
    \captionsetup{labelformat=empty} \caption{Figure 1} \includegraphics[alt={},max width=\textwidth]{5ff6e3bb-6392-49cf-b64d-23bc595cd92e-10_965_1600_559_221}
    \end{figure}
AQA Further Paper 3 Discrete 2023 June Q7
6 marks Moderate -0.8
7
    1. Find the earliest start time and the latest finish time for each activity and write these values on the activity network in Figure 1 7
  1. (ii) Write down the critical path. 7
  2. On Figure 2 below, draw a cascade diagram (Gantt chart) for the planned building project, assuming that each activity starts as early as possible. \begin{figure}[h]
    \captionsetup{labelformat=empty} \caption{Figure 2} \includegraphics[alt={},max width=\textwidth]{5ff6e3bb-6392-49cf-b64d-23bc595cd92e-11_1127_1641_539_201}
    \end{figure} 7
  3. During further planning of the building project, Nova Merit Construction find that activity \(F\) is not necessary and they remove it from the project. Explain the effect removing activity \(F\) has on the minimum completion time of the project.
AQA Further Paper 3 Discrete 2023 June Q8
6 marks Moderate -0.3
8 The graph \(G\) is shown below. \includegraphics[max width=\textwidth, alt={}, center]{5ff6e3bb-6392-49cf-b64d-23bc595cd92e-12_301_688_351_676} 8
    1. State, with a reason, whether or not \(G\) is simple. 8
  1. (ii) A student states that \(G\) is Eulerian.
    Explain why the student is correct. 8
  2. The graph \(H\) has 8 vertices with degrees 2, 2, 4, 4, 4, 4, 4 and 4 Comment on whether \(H\) is isomorphic to \(G\) 8
  3. The formula \(v - e + f = 2\), where \(v =\) number of vertices \(e =\) number of edges \(f =\) number of faces
    can be used with graphs which satisfy certain conditions. Prove that \(G\) does not satisfy the conditions for the above formula to apply.
AQA Further Paper 3 Discrete 2023 June Q9
14 marks Standard +0.3
9 The group \(\left( C , + _ { 4 } \right)\) contains the elements \(0,1,2\) and 3 9
    1. Show that \(C\) is a cyclic group.
      9
  1. (ii) State the group of symmetries of a regular polygon that is isomorphic to \(C\) 9
  2. The group ( \(V , \otimes\) ) contains the elements (1, 1), (1, -1), (-1, 1) and (-1, -1) The binary operation \(\otimes\) between elements of \(V\) is defined by $$( a , b ) \otimes ( c , d ) = ( a \times c , b \times d )$$ 9
    1. Find the element in \(V\) that is the inverse of \(( - 1,1 )\) Fully justify your answer.
      [0pt] [2 marks]
      9
  3. (ii) Determine, with a reason, whether or not \(C \cong V\) \(\mathbf { 9 }\) (c) The group \(G\) has order 16
    Rachel claims that as \(1,2,4,8\) and 16 are the only factors of 16 then, by Lagrange's theorem, the group \(G\) will have exactly 5 distinct subgroups, including the trivial subgroup and \(G\) itself. Comment on the validity of Rachel's claim. \includegraphics[max width=\textwidth, alt={}, center]{5ff6e3bb-6392-49cf-b64d-23bc595cd92e-16_2493_1721_214_150}
AQA Further Paper 3 Discrete 2024 June Q1
1 marks Moderate -0.8
1 Which one of the following sets forms a group under the given binary operation?
Tick ( ✓ ) one box.
SetBinary Operation
\{1, 2, 3\}Addition modulo 4
\{1, 2, 3\}Multiplication modulo 4
\{0, 1, 2, 3\}Addition modulo 4
\{0, 1, 2, 3\}Multiplication modulo 4
AQA Further Paper 3 Discrete 2024 June Q2
1 marks Easy -1.8
2 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.
Best Lower BoundBest Upper Bound
1548
1551
1948
1951
The simple-connected graph \(G\) has the adjacency matrix
\cline { 2 - 5 } \multicolumn{1}{c|}{}\(A\)\(B\)\(C\)\(D\)
\(A\)0111
\(B\)1010
\(C\)1101
\(D\)1010
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 □
AQA Further Paper 3 Discrete 2024 June Q4
4 marks Standard +0.3
4 Daniel and Jackson play a zero-sum game. The game is represented by the following pay-off matrix for Daniel.
\multirow{6}{*}{Daniel}Jackson
StrategyWXYZ
A3-214
B51-41
C2-112
D-302-1
Neither player has any strategies which can be ignored due to dominance. 4
  1. Prove that the game does not have a stable solution.
    Fully justify your answer.
    4
  2. Determine the play-safe strategy for each player. Play-safe strategy for Daniel \(\_\_\_\_\) Play-safe strategy for Jackson \(\_\_\_\_\)
AQA Further Paper 3 Discrete 2024 June Q5
4 marks Moderate -0.5
5
    1. Determine the electrical connections that should be installed.
      5
  1. (ii) Find the minimum possible total time needed to install the required electrical connections.
    5
  2. 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.
AQA Further Paper 3 Discrete 2024 June Q6
6 marks Standard +0.8
6
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. \includegraphics[max width=\textwidth, alt={}, center]{8d4db82a-0daf-487a-a6eb-be3ce8e59141-08_1208_1193_502_407} 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. \includegraphics[max width=\textwidth, alt={}, center]{8d4db82a-0daf-487a-a6eb-be3ce8e59141-09_2489_1778_175_107}
AQA Further Paper 3 Discrete 2024 June Q7
14 marks Standard +0.8
7
  1. By considering associativity, show that the set of integers does not form a group under the binary operation of subtraction. Fully justify your answer.
    7
  2. The group G is formed by the set $$\{ 1,7,8,11,12,18 \}$$ under the operation of multiplication modulo 19 7
    1. Complete the Cayley table for \(G\)
      \({ } ^ { \times } 19\)178111218
      1178111218
      7711
      887
      11117
      121211
      18181
      7
  3. (ii) State the inverse of 11 in \(G\) 7
    1. State, with a reason, the possible orders of the proper subgroups of \(G\) 7
  4. (ii) Find all the proper subgroups of \(G\) Give your answers in the form \(\left( \langle g \rangle , \mathrm { x } _ { 19 } \right)\) where \(g \in G\) 7
  5. (iii) The group \(H\) is such that \(G \cong H\) State a possible name for \(H\)
AQA Further Paper 3 Discrete 2024 June Q8
8 marks Standard +0.3
8
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. \begin{figure}[h]
\captionsetup{labelformat=empty} \caption{Figure 1} \includegraphics[alt={},max width=\textwidth]{8d4db82a-0daf-487a-a6eb-be3ce8e59141-12_979_1074_589_466}
\end{figure} 8
  1. On Figure 1 above, add a supersource \(S\) and a supersink \(T\) to the network. 8
  2. 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.
    Augmenting PathExtra Flow
    Maximum Flow \(\_\_\_\_\) litres per second \begin{figure}[h]
    \captionsetup{labelformat=empty} \caption{Figure 2} \includegraphics[alt={},max width=\textwidth]{8d4db82a-0daf-487a-a6eb-be3ce8e59141-13_960_1074_315_466}
    \end{figure} 8
  3. 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.
AQA Further Paper 3 Discrete 2024 June Q9
6 marks Challenging +1.8
9 Janet and Samantha play a zero-sum game. The game is represented by the following pay-off matrix for Janet. \begin{table}[h]
\captionsetup{labelformat=empty} \caption{Samantha}
\multirow{5}{*}{Janet}Strategy\(\mathbf { S } _ { \mathbf { 1 } }\)\(\mathbf { S } _ { \mathbf { 2 } }\)\(\mathbf { S } _ { \mathbf { 3 } }\)
\(\mathbf { J } _ { \mathbf { 1 } }\)276
\(\mathbf { J } _ { \mathbf { 2 } }\)551
\(\mathbf { J } _ { \mathbf { 3 } }\)438
\(\mathbf { J } _ { \mathbf { 4 } }\)164
\end{table} \(\mathbf { 9 }\) (a) Explain why Janet should never play strategy \(\mathbf { J } _ { \mathbf { 4 } }\) 9 (b) Janet wants to maximise her winnings from the game.
She defines the following variables. \(p _ { 1 } =\) the probability of Janet playing strategy \(\mathbf { J } _ { \mathbf { 1 } }\) \(p _ { 2 } =\) the probability of Janet playing strategy \(\mathbf { J } _ { 2 }\) \(p _ { 3 } =\) the probability of Janet playing strategy \(\mathbf { J } _ { \mathbf { 3 } }\) \(v =\) the value of the game for Janet
Janet then formulates her situation as the following linear programming problem. $$\begin{array} { l l } \text { Maximise } & P = v \\ \text { subject to } & 2 p _ { 1 } + 5 p _ { 2 } + 4 p _ { 3 } \geq v \\ & 7 p _ { 1 } + 5 p _ { 2 } + 3 p _ { 3 } \geq v \\ & 6 p _ { 1 } + p _ { 2 } + 8 p _ { 3 } \geq v \\ \text { and } & p _ { 1 } + p _ { 2 } + p _ { 3 } \leq 1 \\ & p _ { 1 } , p _ { 2 } , p _ { 3 } \geq 0 \end{array}$$ 9 (b) (i) Complete the initial Simplex tableau for Janet's situation in the grid below. Find the probability of Janet playing strategy \(\mathbf { J } _ { \mathbf { 3 } }\) when she is playing to maximise her winnings from the game. \includegraphics[max width=\textwidth, alt={}, center]{8d4db82a-0daf-487a-a6eb-be3ce8e59141-17_2491_1755_173_123} A project is undertaken by Higton Engineering Ltd. The project is broken down into 11 separate activities \(A , B , \ldots , 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. \begin{figure}[h]
\captionsetup{labelformat=empty} \caption{Figure 3} \includegraphics[alt={},max width=\textwidth]{8d4db82a-0daf-487a-a6eb-be3ce8e59141-18_930_1714_724_148}
\end{figure}