H3 Mathematics is the pinnacle of the Junior College Mathematics syllabus in Singapore. It contains a glimpse of actual Math that Mathematicians do, and it requires true mathematical understanding and technique to do well. (H1/H2 math requires a lot of practice, but not true understanding. It is quite common for students to “apply the method” and get the correct answer without having any idea of what they are actually doing.)

Topics in H3 Mathematics include Functions, Sequence and Series, Combinatorics, and even Number Theory. Certain schools also include topics like Linear Algebra and Differential Equations. Certainly, the H3 Math questions have a Math Olympiad style to them.

Here are some practice questions for H3 Math (more will be added in the future), with some hints. Questions are adapted from actual H3 prelim papers.

## Functions

Q1) The function is such that , for all real and some constant .

(i) In the case that is a linear function, find all possibilities for and .

(ii) In the case that and , use mathematical induction to prove that for all positive integers .

(iii) In the case that , sketch one possibility for which is not linear.

Hint:

(i) Write and substitute it into the question. You should reach two cases, or . For the case , there is no other restriction. For the case , either or .

(iii) Try a step function.

## Sequence and Series

## Combinatorics

Q1) Mr H uses a software to generate **distinct** codes of the form , where . What is the least number of codes Mr H should generate such that there are at least two distinct codes that satisfy: . [3 marks]

Hint: No, the answer is not 12. Draw a possibility diagram for , essentially a table with 6×6=36 entries detailing what combinations are there for . Then list cases (a popular technique for combinatorics), based on each value of . For example, the case only has 1 option namely . Then can have 35 other options such that is different from . The last digit has no restrictions so there are 6 options. Hence the total number of ways for this case is 1x35x6=210. Finally, after adding up all the cases, use pigeonhole principle (add one) to conclude the answer, which is **6901**.

Q2) See The Hardest H3 Math Question (Combinatorics)

## Number Theory

Q1) Let m, n, M and N be positive integers. Given that gcd(M,N)=1 and , use Mathematical Induction to show that and . [5 marks]

Hint: First prove for the trivial case M=1 or N=1. Then write and , where , are primes. Use Euclid’s Lemma twice to prove that . By induction, show that . I think the key point is that Generalized Euclid’s Lemma is probably not allowed otherwise it is very easy.

Reblogged this on Math Online Tom Circle.

LikeLike

Reblogged this on Project ENGAGE.

LikeLike