IYMC Answers
IYMC Answers
1
Firstly, let’s solve both inequalities,
1
1. ℎ(𝑥 ) < 𝑓 (𝑥 ) → 5 − 𝑥 < 3 + 3𝑥 → 5 − 3 < 3𝑥 + 𝑥 → 2 < 4𝑥 → 4𝑥 > 2 → 𝑥 >
2
2. ℎ(𝑥 ) > 𝑔 (𝑥 ) → 5 − 𝑥 > 2 + 2𝑥 → 5 − 2 > 2𝑥 + 𝑥 → 3 > 3𝑥 → 3𝑥 < 3 → 𝑥 < 1
Thus, we get,
1
<𝑥<1→𝑎<𝑥<𝑏
2
𝟏
∴ 𝒂 = ,𝒃= 𝟏
𝟐
Proof/Double Check:
Inputting the lowest and highest bound, 0.6 and 0.9 (1 d.p.). Firstly lowest bound value,
𝑔 (𝑥 ) < ℎ(𝑥 ) < 𝑓(𝑥 ) → 2 + 2(0.6) < 5 − (0.6) < 3 + 3(0.6) → 3.2 < 4.4 < 4.8
(b) (i)
To find a recursive function for a sequence of numbers, we can look for a pattern in the
differences between consecutive terms. The first differences are calculated by subtracting each
term from the term that follows it. The second differences are calculated by subtracting each
term in the first differences from the term that follows it. We continue this process until we
reach a constant difference.
First differences:
504 − 60 = 444; 2160 − 504 = 1656; 18144 − 2160 = 15984; 77760 − 18144 =
59616; 653184 − 77760 = 575424; 2799360 − 653184 = 2146176
Second differences:
444 − 1656 = −1212; 1656 − 15984 = −14328; 15984 − 59616 = −43632; 59616 −
575424 = −515808; 575424 − 2146176 = −1570752
Third differences:
−1212 − (−14328) = 13116; −14328 − (−43632) = 29304; −43632 − (−515808) =
472176; −515808 − (−1570752) = 1054944
Fourth differences:
13116 − 29304 = −16188; 29304 − 472176 = −442872; 472176 − 1054944 =
−582768
In the case of the sequence 60, 504, 2160, 18144, 77760, 653184, 2799360, the fourth
differences are constant, which suggests that the recursive function for the original sequence is
a polynomial of degree 4. Using the method of finite differences, we can find the coefficients of
this polynomial.
The recursive function for the given numbers is,
𝒇(𝒏) = −𝟔𝟕𝒏𝟒 − 𝟔𝟕𝒏𝟑 + 𝟐𝟐𝟐𝒏𝟐 + 𝟔𝟎𝒏 + 𝟔𝟎, where 𝑓(0) = 60 is the first term of the
sequence (n starts from 0)
(b) (ii)
To find a non-recursive function we can find the relation between each number,
504 2160 18144 77760 653184 2799360
= 8.4; = 4.2857; = 8.4; 18144 = 4.2857; = 8.4; = 4.2857
60 504 2160 77760 653184
(c)
We can find the 9th and 15th numbers using the non-recursive function we derived above in
(b)(ii):
𝑓 (𝑛) = 𝑓 (1) × (8.4)𝑛−1
9th number:
𝑓 (9) = 60 × (8.4)9−1 = 8.48 × 60 ≈ 𝟏, 𝟎𝟐𝟖, 𝟕𝟖𝟕, 𝟒𝟓𝟔
15th number:
𝑓 (15) = 60 × (8.4) 15−1 = 8.414 × 60 ≈ 𝟏, 𝟔𝟎𝟎, 𝟎𝟎𝟎, 𝟎𝟎𝟎, 𝟎𝟎𝟎
𝝅𝟐
𝜻(𝟐) = 𝟔
𝜁2 (𝑠) is defined as the second derivative of the Riemann zeta function. Therefore 𝜁2 (𝑠) =
𝑑2
𝜁(𝑠). Plugging in 𝑠 = 2, we have,
𝑑𝑠2