The CENTRE for EDUCATION

in MATHEMATICS and COMPUTING

cemc.uwaterloo.ca

2017 Canadian Senior

Mathematics Contest

Wednesday, November 22, 2017

(in North America and South America)

Thursday, November 23, 2017

(outside of North America and South America)

Solutions

©2017 University of Waterloo

2017 Canadian Senior Mathematics Contest Solutions Page 2

Part A
1. Calculating,
6 (6×9×12)×15
3
× 69 × 12
9
× 15
12
= 6×9×12×15
3×6×9×12
= 3×(6×9×12)
= 15
3
=5

Answer: 5

2. Solution 1
Since 4AEF is right-angled at E, its area equals 12 (AE)(EF ).
Since 4AEF is right-angled at E and ABCD is a square, then EF = AD = 8 cm.
We are told that the area of 4AEF is 30% of the area of square ABCD, and so the area of
4AEF equals 0.3(8 cm)2 .
Therefore, 21 (AE)(8 cm) = 0.3(8 cm)2 and so AE = 2(0.3)(8 cm) = 0.6(8 cm) = 4.8 cm.

Solution 2
Since 4AEF is right-angled at E and ABCD is a square, then EF is parallel to AD which
makes AEF D a rectangle.
Since AF is a diagonal of rectangle AEF D, then the area of rectangle AEF D is twice the area
of 4AEF , or 60% of the area of the square.
Since rectangle AEF D and square ABCD share the same height, then it must be that AE
equals 60% of the length of AB.
Therefore, AE = 0.6 · AB = 0.6 · 8 cm = 4.8 cm.

Answer: 4.8 cm

3. Factoring, we obtain the following equivalent equations:

x4 − 3x3 + x2 − 3x = 0
x(x3 − 3x2 + x − 3) = 0
x[x2 (x − 3) + (x − 3)] = 0
x(x − 3)[x2 + 1] = 0
Therefore, x = 0 or x − 3 = 0 (which gives x = 3) or x2 + 1 = 0 (which has no real solutions).
Therefore, x = 0 or x = 3.

Answer: x = 0, 3

4. Solution 1
Since the two 1s are not next to each other, then the two 1s can be placed in the following
pairs of positions, reading from the left: 1st and 3rd, 1st and 4th, 1st and 5th, 2nd and 4th,
2nd and 5th, 3rd and 5th.
There are 6 such pairs of positions.
Choose one of these pairs, say 1st and 3rd. This gives the number 1 1 .
There are 3 digits left to place. We place these from left to right.
There are 3 possible digits that could go in the leftmost empty position.
After this digit is placed, there are 2 possible digits that could go in the next empty position.
Finally, the remaining digit is placed in the remaining empty position.
This process works for each of the pairs of positions for the two 1s.
Therefore, there are 6 × 3 × 2 = 36 such five-digit integers (6 pairs of positions for the 1s, 3
choices for the first empty position, and 2 choices for the second empty position).
2017 Canadian Senior Mathematics Contest Solutions Page 3

Solution 2
5! 120
Since there are 5 digits to arrange and 2 of them are the same, there are = = 60
2! 2
arrangements:

To see this, replace one of the 1s with and X so that the “digits” were 1, 2, 3, 4, X.
There would be 5 choices for the first digit, 4 choices for the second digit, and so on,
giving 5! = 5 × 4 × 3 × 2 × 1 = 120 arrangements of the digits.
If we now replace the X with a 1, each arrangement is now counted 2 times. For
example, 43X21 and 4312X become the same arrangement.
Therefore, we need to divide the total 120 by 2! = 2 since each arrangement is
double-counted.

In some of these arrangements, the 1s will be next to each other and in some they will not be.
We will count the arrangements with the 1s next to each other and subtract this number from
the total.
If the two 1s are together, we can imagine arranging the four objects 11, 2, 3, 4.
There are 4! = 24 such arrangements.
Thus, there are 60 − 24 = 36 arrangements of 1, 1, 2, 3, 4 with the two 1s not next to each other.

Answer: 36

5. We note that the first point (0, 0) attached to the integer 1 lies on the line y = −x.
In the diagram, line segments of lengths 1, 1, 2, 2, 3, 3, 4, 4, . . . are drawn starting at the origin.
We guess that the points on the spiral that lie on the line y = −x are those obtained after an
even number of these segments are drawn. (For example, the number 3 is at the point (1, −1)
after 2 segments, the number 7 is at the point (−1, 1) after 4 segments, the number 13 is at
the point (2, −2) after 6 segments, and so on.)
To see why this is true, we note that, after 2k segments for some positive integer k, the
x-coordinate of the endpoint is

x = 1 − 2 + 3 − . . . + (−1)k−1 k

and the y-coordinate is

y = −1 + 2 − 3 + . . . + (−1)k k
This is because the horizontal segments have lengths 1, 2, 3, . . . , k and go right, left, right, left,
etc., and the vertical segments have lengths 1, 2, 3, . . . , k and go down, up, down, up, etc.
Note that −1 + 2 − 3 + . . . + (−1)k k = −(1 − 2 + 3 − . . . + (−1)k−1 k) and so these points lie
on the line y = −x.
We note further that no more points on the spiral can lie on the line y = −x since every second
point at the end of a line segment lies on the line and the segment starting at a point on the
line must move to a point off of the line.
At the point after 2k segments, the integer written is

1 + (1 + 1 + 2 + 2 + 3 + 3 + . . . + k + k) = 1 + 2(1 + 2 + 3 + . . . + k) = 1 + 2 12 k(k + 1) = 1 + k + k 2

We want to determine the sum of the values of this expression starting with k = 1 and contin-
uing until the final one that is less than or equal to 1000.
We note that the expression is increasing as k increases (as k 2 and k are both increasing), that
when k = 31, 1 + k + k 2 = 993, and when k = 32, 1 + k + k 2 = 1057.
2017 Canadian Senior Mathematics Contest Solutions Page 4

Therefore, we want to calculate the sum of the values of 1 + k + k 2 from k = 0 to k = 31. (We
start at k = 0 to include the initial integer 1 = 1 + 0 + 02 .)
We obtain
31
X
(1 + k + k 2 ) = (1 + 0 + 02 ) + (1 + 1 + 12 ) + (1 + 2 + 22 ) + (1 + 3 + 32 ) + · · · + (1 + 31 + 312 )
k=0
= 32 · 1 + (1 + 2 + 3 + · · · + 31) + (12 + 22 + 32 + · · · + 312 )
= 32 + 21 (31)(32) + 61 (31)(32)(63)
(using the formulae given on the contest)
= 32 + 496 + 10 416
= 10 944

(The notation on the left side in the first equation is called sigma notation and represents the
sum on the right side of the first equation.)
Therefore, the sum of the positive integers from 1 to 1000 written at points on the line y = −x
is 10 944.
Answer: 10 944

6. Since 62 + 82 = 36 + 64 = 100 = 102 , then the given triangle is right-angled.

We label the triangle as 4ABC with AB = 8, BC = 6 and AC = 10.
We put the diagram in the xy-plane with B at the origin (0, 0), A on the positive y-axis at
(0, 8), and C on the positive x-axis at (6, 0).
Let X, Y and Z be the midpoints of sides AB, BC and AC, respectively.
Since AB, BC and AC are the diameters of the semi-circles, then X, Y and Z are the centres
of the semi-circles.
Note also that since AB = 8, then AX = XB = 4, which means that the radius of the corre-
sponding semi-circle is 4.
This also means that the coordinates of X are (0, 4).
Since BC = 6, then BY = Y C = 3, which means that the radius of the corresponding semi-
circle is 3.
This also means that the coordinates of Y are (3, 0).
Since AC = 10, then AZ = ZC = 5, which means that the radius of the corresponding semi-
circle is 5.
The coordinates of Z, the midpoint of A(0, 8) and C(6, 0), are 21 (0 + 6), 12 (8 + 0) or (3, 4).

Let M (s, t) be the centre of the large circle and r its radius.
Let the points U, V, W be the points where the semi-circles y
with centres X, Y and Z, respectively, touch the larger circle.
Join M to U , V and W .
A W

U
X Z

x
B Y C

V
2017 Canadian Senior Mathematics Contest Solutions Page 5

It turns out that M U , M V and M W pass through X, Y and Z, respectively.

Imagine drawing a line tangent to the large circle at U .

Since the large circle and semi-circle touch at U , then this line is also tangent to the
semi-circle.
Since radii are perpendicular to tangents, then XU and M U (both radii) are perpen-
dicular to this tangent line.
Since both XU and M U are perpendicular to the tangent line, then they must lie on
top of each other, and so M U passes through X.
Using a similar argument, we can see that M V and M W pass through Y and Z,
respectively.

Since M U = M V = M W = r (the radius of the large circle), and XU = 4, Y V = 3, and

ZW = 5 (the radii of the semi-circles), then

M X = M U − XU = r − 4
MY = MV − Y V = r − 3
M Z = M W − ZW = r − 5

The coordinates of M , X, Y , Z are M (s, t), X(0, 4), Y (3, 0), Z(3, 4).
Using the formula for the length of a line segment, we obtain the equations

(s − 0)2 + (t − 4)2 = (r − 4)2

(s − 3)2 + (t − 0)2 = (r − 3)2
(s − 3)2 + (t − 4)2 = (r − 5)2

Subtracting the third equation from the first, we obtain s2 − (s − 3)2 = (r − 4)2 − (r − 5)2 or
s2 − s2 + 6s − 9 = r2 − 8r + 16 − r2 + 10r − 25 and so 6s − 9 = 2r − 9 or r = 3s.
Subtracting the third equation from the second, we obtain t2 − (t − 4)2 = (r − 3)2 − (r − 5)2
or t2 − t2 + 8t − 16 = r2 − 6r + 9 − r2 + 10r − 25 and so 8t − 16 = 4r − 16 or r = 2t.
Substituting s = 31 r and t = 12 r into the first equation, we obtain the following equivalent
equations:

2
2
1
3
r + 12 r − 4 = (r − 4)2
1 2
9
r + 14 r2 − 4r + 16 = r2 − 8r + 16
1 2
9
r + 14 r2 + 4r = r2
4r2 + 9r2 + 144r = 36r2 (multiplying through by 36)
2
144r = 23r
0 = r(23r − 144)
144
Therefore, r = 0 (which is impossible) or r = 23
, which is the desired answer.

144
Answer: 23
2017 Canadian Senior Mathematics Contest Solutions Page 6

Part B

1. (a) Factoring the left side of x2 + 2x − 8 = 0, we obtain (x + 4)(x − 2) = 0.

Therefore, the roots of x2 + 2x − 8 = 0 are x = −4 and x = 2.
(b) Since the parabola with equation y = x2 + bx + c passes through the points (1, 2) and
(2, 0), then the coordinates of these points satisfy the equation of the parabola.
Therefore, 2 = 12 + b · 1 + c (which simplifies to b + c = 1) and 0 = 22 + 2b + c (which
simplifies to 2b + c = −4).
Subtracting the first of these equations from the second, we obtain (2b+c)−(b+c) = −4−1
or b = −5.
Since b = −5 and b + c = 1, then c = 1 − b = 1 − (−5) = 6.
Therefore, b = −5 and c = 6.
(We can check that the points (1, 2) and (2, 0) lie on the parabola with equation
y = x2 − 5x + 6.)
(c) Since the point (0, 2) lies on the parabola with equation y = a(x − 1)2 + 38 , then
2 = a(−1)2 + 83 or 2 = a + 83 and so a = 2 − 83 = − 23 .
Thus, the parabola has equation y = − 32 (x − 1)2 + 38 .
We want to determine the value of d > 0 for which the point (d, 0) lies on this parabola.
Substituting, we obtain the following equivalent equations:

0 = − 32 (d − 1)2 + 8
3
2
3
(d − 1)2 = 83
(d − 1)2 = 4
d − 1 = ±2

Therefore, d = −2 + 1 = −1 or d = 2 + 1 = 3.
Since d > 0, then d = 3.

2. (a) The following table shows how Joe can win the game in three turns:
R R R R R R Start
G G G G R R After 1 turn
G R R R G R After 2 turns
G G G G G G After 3 turns
On Joe’s first turn, he turns over the first 4 cards.
On Joe’s second turn, he turns over cards 2 through 5.
On Joe’s third turn, he turns over the four red cards.
2017 Canadian Senior Mathematics Contest Solutions Page 7

(b) There are many sequences of moves in which Joe can win.
Suppose that Joe takes 9 turns. On turn 1, he turns over cards 1, 2, 3, 4, 5. On turn 2,
he turns over cards 2, 3, 4, 5, 6.
He continues in this way so that, on each turn, he turns over five consecutive cards starting
with the tth card on turn t, with the understanding that card 1 comes after card 9. This
means, for example, that on turn 7, Joe turns over cards 7, 8, 9, 1, 2.
In this way, each of the 9 cards is turned over 5 times (once as each of the 1st, 2nd, 3rd,
4th, 5th card in the sequence).
Since each card is turned over an odd number of times, its final colour is the opposite of
the starting colour, and so it is green.
We demonstrate this in the following chart:
R R R R R R R R R Start
G G G G G R R R R After 1 turn
G R R R R G R R R After 2 turns
G R G G G R G R R After 3 turns
G R G R R G R G R After 4 turns
G R G R G R G R G After 5 turns
R R G R G G R G R After 6 turns
G G G R G G G R G After 7 turns
R R R R G G G G R After 8 turns
G G G G G G G G G After 9 turns
Joe can actually finish in as few as three turns:
R R R R R R R R R Start
G G G G G R R R R After 1 turn
G G R R R G G R R After 2 turns
G G G G G G G G G After 3 turns
(c) Suppose that n = 2017. This means that Joe has 2017 cards.
We show that Joe can win the game when k is odd and cannot win the game when k is
even.
Suppose that k is odd.
Suppose that Joe takes 2017 turns.
For each t = 1, 2, 3, . . . , 2016, 2017, Joe turns over the k cards starting at card t, and with
the understanding that card 1 comes after card 2017.
In this way, each of the 2017 cards is turned over k times, once for each “position” in a
sequence of k consecutive cards.
Since k is odd, then the colour of each of the 2017 cards is reversed at the end, and so
each is green.
In this way, Joe wins the game when k is odd.
Suppose that k is even.
For Joe to win the game, each of the 2017 cards must be turned over an odd number of
times in order to reverse its colour.
This means that the total number of card flips is odd, since this total is the sum of 2017
odd integers (the number of flips for each of the 2017 cards).
For any positive integer t, after t turns, Joe has flipped a total of tk cards (k on each of
t turns).
Since k is even, then tk is even.
2017 Canadian Senior Mathematics Contest Solutions Page 8

Therefore, after any number of turns, the total number of card flips is always even and so
cannot be the odd number of flips necessary to reverse the colour of all of the cards.
Therefore, when k is even, Joe cannot win the game.
In summary, when n = 2017, Joe can win the game for all odd k with 1 ≤ k < 2017 and
cannot win the game for all even k with 1 ≤ k < 2017.

3. (a) Continuing to substitute values of n back into f (n), we obtain:

n=2: f (f (2)) = f (2) + 3 · 2

f (5) = 5 + 6 = 11

n=5: f (f (5)) = f (5) + 3 · 5

f (11) = 11 + 15 = 26

n = 11 : f (f (11)) = f (11) + 3 · 11
f (26) = 26 + 33 = 59

Therefore, f (26) = 59.

(b) We show that there is no such function g by using the given information to derive two
different outputs for a single input, which will give a contradiction of the important prop-
erty of a function that there is only one output for a given input.
At each step, we use values of m and n for which we already know the values of g(m) and
g(n), which limits our options at each step.
Assume that there exists a function g with g(1) = 2 and g(g(n) + m) = n + g(m).
• If n = 1 and m = 1, then g(g(1) + 1) = 1 + g(1) or g(2 + 1) = 1 + 2 and so g(3) = 3.
• If n = 1 and m = 3, then g(g(1) + 3) = 1 + g(3) or g(2 + 3) = 1 + 3 and so g(5) = 4.
• If n = 3 and m = 1, then g(g(3) + 1) = 3 + g(1) or g(3 + 1) = 3 + 2 and so g(4) = 5.
• If n = 3 and m = 2, then g(g(3) + 2) = 3 + g(2) or g(3 + 2) = 3 + g(2).
Since g(5) = 4, then 4 = 3 + g(2) or g(2) = 1.
• If n = 2 and m = 4, then g(g(2) + 4) = 2 + g(4) or g(1 + 4) = 2 + 5 and so g(5) = 7.
Since g(5) = 4 and g(5) = 7, we have a contradiction.
Therefore, there does not exist such a function g.
2017 Canadian Senior Mathematics Contest Solutions Page 9

(c) Solution 1
First, we show that the function h(n) = n + 1 for each positive integer n satisfies the
conditions.
We note that this function satisfies the first two conditions.
Thus, if h(n) = n + 1 for each positive integer n,

h(h(n) + m) = h(n + 1 + m) = (n + 1 + m) + 1 = n + m + 2

and
1 + n + h(m) = 1 + n + m + 1 = n + m + 2
and so the third condition is satisfied.
Next, we show that there is no other such function.
Suppose that the function h satisfies the three conditions and that h(1) = k.
Step 1: Show that h(a + rk) = h(a) + 2r for each integer r ≥ 1
Using the functional equation with n = 1 and m = a, we obtain h(h(1) + a) = 1 + 1 + h(a)
or h(a + k) = h(a) + 2.
Using the functional equation with n = 1 and m = a + k, we obtain

h(h(1) + a + k) = 1 + 1 + h(a + k)

or h(a + 2k) = 2 + h(a) + 2 = h(a) + 4.

Using the functional equation with n = 1 and m = a + 2k, we obtain

h(h(1) + a + 2k) = 1 + 1 + h(a + 2k)

or h(a + 3k) = 2 + h(a) + 4 = h(a) + 6.

Assume that h(a + (r − 1)k) = h(a) + 2(r − 1) for some integer r ≥ 2.
Using the functional equation with n = 1 and m = a + (r − 1)k, we obtain

h(h(1) + a + (r − 1)k) = 1 + 1 + h(a + (r − 1)k)

or h(a + rk) = 2 + h(a) + 2(r − 1) = h(a) + 2r.

Step 2: Show that if h(b) = h(c), then b = c
In other words, we show that the function h is one-to-one.
Suppose that h(b) = h(c).
Then for each positive integer d, h(h(b) + d) = 1 + b + h(d) and h(h(c) + d) = 1 + c + h(d).
Since h(b) = h(c), then h(h(b) + d) = h(h(c) + d) and so 1 + b + h(d) = 1 + c + h(d) or
b = c.
Step 3: Show that k ≤ 2
From Step 1, h(a + rk) = h(a) + 2r for all positive integers a and r.
Suppose that k ≥ 3.
When a = 1, we obtain h(1 + rk) = h(1) + 2r for each positive integer r.
The values of h here form an infinite set of positive integers starting with h(1) + 2 which
are spaced 2 apart.
When a = 2, we obtain h(2 + rk) = h(2) + 2r for each positive integer r.
The values of h here form an infinite set of positive integers starting with h(2) + 2 which
are spaced 2 apart.
When a = 3, we obtain h(3 + rk) = h(3) + 2r for each positive integer r.
2017 Canadian Senior Mathematics Contest Solutions Page 10

The values of h here form an infinite set of positive integers starting with h(3) + 2 which
are spaced 2 apart.
Since k ≥ 3, then the inputs in these three sets are all distinct, since those in the first
family give remainder 1 when divided by k, those in the second family give remainder 2
when divided by k, and those in the third family give remainder 3 (or possibly 0 if k = 3).
But the three sets of outputs h(1) + 2r, h(2) + 2r, h(3) + 2r must overlap eventually, as
there can be only two disjoint infinite sets with common difference 2.
This is a contradiction, so we cannot have k ≥ 3, which means that k ≤ 2.
Step 4: Show that k = 2
We know that k = 1 or k = 2.
If h(1) = k = 1, the equation h(1 + rk) = h(1) + 2r becomes h(1 + r) = 1 + 2r.
Substituting n = 1 + r (or r = n − 1) gives h(n) = 1 + 2(n − 1) = 2n − 1.
In this case,

h(h(n) + m) = h(2n − 1 + m) = 2(2n − 1 + m) − 1 = 4n + 2m − 3

and
1 + n + h(m) = 1 + n + 2m − 1 = n + 2m
These two expressions are not always equal for all n and m (for example, when n = m = 2).
Therefore, we cannot have k = 1. Thus, k = 2.
Step 5: h(n) = n + 1 when n is odd
From h(1 + rk) = h(1) + 2r and k = 2, we obtain h(1 + 2r) = 2 + 2r = (2r + 1) + 1 and
so h(n) = n + 1 when n is odd.
Step 6: h(n) = n + 1 when n is even
From h(2 + rk) = h(2) + 2r, we obtain h(2 + 2r) = h(2) + 2r.
If we can show that h(2) = 3, then we will obtain h(2 + 2r) = 3 + 2r as required.
Since h(x) is even when x is odd and since h is one-to-one, then h(x) must be odd when
x is even.
In particular, h(2) is odd.
From h(h(n) + m) = 1 + n + h(m) with n = 2 and m = 1, we get h(h(2) + 1) = 1 + 2 + h(1)
and so h(h(2) + 1) = 5.
When n is even, the values of h(n) form an increasing sequence of odd positive integers.
This is because h(2) is odd and so h(2) + 2r is odd and increasing as r increases, and so
h(2 + 2r) = h(2) + 2r is odd and increasing as r increases.
Therefore, h(h(2) + 1) = 5 has to be the third smallest, or second smallest, or smallest
value of h(n) when n is even.
Since h(2 + 2r) = h(2) + 2r, then the values of h(x) when x is even increase when x
increases by 2.
This means that we must have h(6) = 5 or h(4) = 5 or h(2) = 5.
If h(6) = 5, then h(h(2) + 1) = 5 gives h(2) + 1 = 6 or h(2) = 5, which cannot be the case,
since h is one-to-one.
If h(2) = 5, then h(h(2) + 1) = 5 gives h(2) + 1 = h(2) which cannot be the case.
Therefore, h(4) = 5 and so h(2 + 2) = h(2) + 2 which gives h(2) = 5 − 2 = 3.
We have shown that the function h(n) = n + 1 satisfies the given condition and that no
other function does, as required.
2017 Canadian Senior Mathematics Contest Solutions Page 11

Solution 2
Let h be a function that satisfies the given properties, and consider the infinite set of
lattice points of the form (m, h(m)), for m = 1, 2, 3, . . ..
Let a be a positive integer.
When n = a and m = h(a), the functional equation is h(h(a) + h(a)) = 1 + a + h(h(a)) or
h(2h(a)) = 1 + a + h(h(a)).
Thus, the point (2h(a), 1 + a + h(h(a))) is on the graph of y = h(x).
When n = a and m = 2h(a), the functional equation becomes

h(h(a) + 2h(a)) = 1 + a + h(2h(a))

or h(3h(a)) = 1 + a + 1 + a + h(h(a)) = 2 + 2a + h(h(a)).

Thus, the point (3h(a), 2 + 2a + h(h(a))) is on the graph of y = h(x).
Suppose that r is a positive integer and assume that h(rh(a)) = (r −1)+(r −1)a+h(h(a)).
When n = a and m = rh(a), the functional equation becomes

h(h(a) + rh(a)) = 1 + a + h(rh(a)) = 1 + a + (r − 1) + (r − 1)a + h(h(a)) = r + ra + h(h(a))

or h((r + 1)h(a)) = r + ra + h(h(a)).

Thus, if the point (rh(a), (r − 1) + (r − 1)a + h(h(a))) is on the graph of y = h(x), then
the point ((r + 1)h(a), r + ra + h(h(a))) is on the graph of y = h(x).
This shows that the infinite set of points of the form (sh(a), (s − 1) + (s − 1)a + h(h(a)))
for integers s ≥ 2 all lie on this graph.
Note that to get from one point in this set to the next, we move h(a) units to the right
and a + 1 units up.
a+1
In other words, this infinite set of points on the graph forms a line with slope .
h(a)
Call this line La .
Suppose that b is a positive integer with b 6= a.
A similar argument shows that the set of points (th(b), (t − 1) + (t − 1)b + h(h(b))) for
b+1
integers t ≥ 2 all lie on this graph, which thus form a line Lb with slope .
h(b)
Now consider the points (n, h(n)) on the graph of y = h(x) where n is a positive integer
that is a multiple of h(a) and is also a multiple of h(b).
There are infinitely many such points (for example, n = wh(a)h(b) for positive integers w).
These points lie on both La and Lb , and so the slopes of these two lines must be equal.
But this is true for every possible pair of distinct positive integers a and b.
a+1
Therefore, the quantity must be constant for all positive integers a. (Another way
h(a)
to see this is to let a = 1 and let b range through all positive integers greater than 1.)
a+1 1
In other words, = for some constant c or h(a) = ca + c for all positive integers a.
h(a) c
If a = 1, then h(1) = c + c = 2c.
Setting n = m = 1 in the equation h(h(n) + m) = 1 + n + h(m), we obtain
h(h(1) + 1) = 1 + 1 + h(1) which gives h(2c + 1) = 2 + 2c.
Since h(a) = ca + c, then setting a = 2c + 1 gives c(2c + 1) + c = 2 + 2c or 2c2 + 2c = 2 + 2c
and so c2 = 1.
Since c > 0, then c = 1 and so h(n) = n + 1.
(Solution 1 shows us that the function h(n) = n + 1 does satisfy the requirements.)