Easy -1.8 This is a direct recall question requiring only knowledge of Euler's formula (V - E + F = 2) and the ability to count vertices and edges in a given graph to find the number of faces. It's a single-step, low-cognitive-demand multiple-choice question with no problem-solving required, making it significantly easier than average A-level questions.
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
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
\hfill \mbox{\textit{AQA Further Paper 3 Discrete 2023 Q1 [1]}}