Skip to main content
HL AI ยท Practice Paper 1 ยท Interactive

IB Maths Applications & Interpretation HL โ€” Interactive Practice Paper 1

HL AI Paper 1 is GDC-allowed short-response โ€” matrices, chi-squared testing, graph theory, coupled & differential equations, financial maths. Two modes: per-part feedback, or a full timed exam.

30 marks ยท 5 questions ยท GDC required ยท 3 s.f. answers
Choose your mode
Time remaining
75:00
Progress: 0 / 19 correct

Question 1

6 marks
Matrices โ€” determinant, inverse, linear systems

Let A=(312โˆ’1).

(a) Find det(A). [1]

(b) Write down the entries of Aโˆ’1 as decimals. Reading left-to-right, top-to-bottom, type each entry. [2]

(c) Use Aโˆ’1 to solve the system 3x+y=5,2xโˆ’y=0. [3]

(a) det(A)=3(โˆ’1)โˆ’(1)(2)=โˆ’5.
(b) Aโˆ’1=1โˆ’5(โˆ’1โˆ’1โˆ’23)=(0.20.20.4โˆ’0.6).
(c) x=Aโˆ’1b=(0.20.20.4โˆ’0.6)(50)=(12). Check: 3(1)+2=5 โœ“, 2(1)โˆ’2=0 โœ“.

Question 2

7 marks
Chi-squared goodness-of-fit test

A researcher surveys 200 IB students about their favourite Maths paper. She hypothesises that preferences are equally split between Paper 1, Paper 2 and Paper 3. The observed counts are:

P1P2P3
Observed557867

(a) State the expected count for each paper under the null hypothesis. Give your answer to 3 s.f. [1]

(b) Calculate the chi-squared test statistic ฯ‡calc2. Give to 3 s.f. [3]

(c) State the number of degrees of freedom. [1]

(d) Given the critical value at the 5% level with 2 d.o.f. is ฯ‡crit2=5.991, state whether the null hypothesis should be rejected. Type reject or accept. [2]

(a) Under H0 (uniform), expected =200/3โ‰ˆ66.7.
(b) ฯ‡calc2=(55โˆ’66.67)266.67+(78โˆ’66.67)266.67+(67โˆ’66.67)266.67โ‰ˆ2.04+1.93+0.00=3.97.
(c) d.o.f.=3โˆ’1=2.
(d) 3.97<5.991, so accept (fail to reject) H0 โ€” no significant evidence against uniform preference.

Question 3

6 marks
Graph theory โ€” minimum spanning tree & shortest path

Four cities A,B,C,D have the following direct road lengths (km):

edgeABACBCBDCD
km12851015

(a) Using Kruskal's algorithm, find the total length of the minimum spanning tree. [3]

km

(b) Find the length of the shortest path from A to D. [2]

km

(c) Type the vertex sequence of that shortest path (e.g. ABD). [1]

(a) Sorted edges: BC(5),AC(8),BD(10),AB(12),CD(15). Add BC (5), AC (8), BD (10) โ€” all four vertices connected. Total =5+8+10=23 km.
(b) Possible Aโ†’D routes: Aโ†’Bโ†’D=22; Aโ†’Cโ†’D=23; Aโ†’Bโ†’Cโ†’D=32; Aโ†’Cโ†’Bโ†’D=23. Shortest =22 km.
(c) Path: Aโ†’Bโ†’D.

Question 4

5 marks
Differential equations โ€” Euler's method

The differential equation dydx=x+y has initial condition y(0)=1. Use Euler's method with step h=0.2 to estimate the following:

(a) y(0.2). Give your answer to 3 d.p. [2]

(b) y(0.4). Give your answer to 3 d.p. [3]

Euler recursion: yn+1=yn+hโ‹…f(xn,yn) with f(x,y)=x+y.
(a) y(0.2)=1+0.2(0+1)=1.200.
(b) y(0.4)=1.2+0.2(0.2+1.2)=1.2+0.28=1.480.

Question 5

6 marks
Financial mathematics โ€” compound & continuous

Alex invests โ‚ฌ5000 in a savings account paying 4% per year, compounded quarterly.

(a) Find the value of the investment after 3 years, to the nearest cent (2 d.p.). [3]

(b) Find the interest earned. [1]

(c) Suppose instead the โ‚ฌ5000 earns 4% p.a. compounded continuously. Find the value after 3 years, to the nearest cent. [2]

(a) Math input error (GDC TVM: N=12,I=4,P/Y=C/Y=4).
(b) Interest Math input error.
(c) Math input error.

๐Ÿ“Š Paper submitted โ€” here's your score

0 / 19 parts correct 0%
โ† Back to all papers ยท Try HL AI Paper 3 โ†’