# A Primer: Generating Functions: Part I : RMO/INMO 2019

GENERATING FUNCTIONS and RECURRENCE RELATIONS:

The concept of a generating function is one of the most useful and basic concepts in the theory of combinatorial enumeration. If we want to count a collection of objects that depend in some way on n objects and if the desired value is say, $\phi (n)$, then a series in powers of t such as $\sum \phi (n) t^{n}$ is called a generating function for $\phi (n)$. The generating functions arise in two different ways. One is from the investigation of recurrence relations and another is more straightforward: the generating functions arise as counting devices, different terms being specifically included to account for specific situations which we wished to count or ignore. This is a very fundamental, though difficult, technique in combinatorics. It requires considerable ingenuity for its success. We will have a look at the bare basics of such stuff.

We start here with the common knowledge:

$(1+\alpha_{1}t)(1+\alpha_{2}t)\ldots (1+\alpha_{n}t)=1+a_{1}t+a_{2}t^{2}+ \ldots + a_{n}t^{n}$….(2i) where $a_{r}=$sum of the products of the $\alpha$‘s taken r at a time. …(2ii)

Incidentally, the $a$‘s thus defined in (2ii) are called the elementary symmetric functions associated with the $a$‘s. We will re-visit these functions later.

Let us consider the algebraic identity (2i) from a combinatorial viewpoint. The explicit expansion in powers of t of the RHS of (2i) is symbolically a listing of the various combinations of the $\alpha$‘s in the following sense:

$a_{1}=\sum \alpha_{1}$ represents all the 1-combinations of the $\alpha$‘s
$a_{2}=\sum \alpha_{1}\alpha_{2}$ represents all the 2-combinations of the $\alpha$‘s
and so on.

In other words, if we want the r-combinations of the $\alpha$‘s, we have to look only at the coefficients of $t^{r}$. Since the LHS of (2i) is an expression which is easily constructed and its expansion generates the combinations in the said manner,we say that the LHS of (2i) is a Generating Function (GF) for the combinations of the $\alpha$‘s. It may happen that we are interested only in the number of combinations and not in a listing or inventory of them. Then, we need to look for only the number of terms in each coefficient above and this number will be easily obtained if we set each $\alpha$ as 1. Thus, the GF for the number of combinations is $(1+t)(1+t)(1+t)\ldots (1+t)$ n times;

and this is nothing but $(1+t)^{n}$. We already know that the expansion of this gives $n \choose r$ as the coefficient of $t^{r}$ and this tallies with the fact that the number of r-combinations of the $\alpha$‘s is $n \choose r$. Abstracting these ideas, we make the following definition:

Definition I:
The Ordinary Generating Function (OGF) for a sequence of symbolic expressions $\phi(n)$ is the series

$f(t)=\sum_{n}\phi (n)t^{n}$ …(2iii)

If $\phi (n)$ is a number which counts a certain type of combinations or permutations, the series $f(t)$ is called the Ordinary Enumeration (OE) or counting series for $\phi (n)$ for $n=1,2,\ldots$

Example 2:
The OGF for the combinations of five symbols a, b, c, d, e is $(1+at)(1+bt)(1+ct)(1+dt)(1+et)$

The OE for the same is $(1+t)^{5}$. The coefficient of $t^{4}$ in the first expression is

(*) abcd+abce+ abde+acde+bcde.

The coefficient of $t^{4}$ in the second expression is $5 \choose 4$, that is, 5 and this is the number of terms in (*).

Example 3:

The OGF for the elementary symmetric functions $a_{1}, a_{2}, \ldots$ in the symbols $\alpha_{1},\alpha_{2}, \alpha_{3}, \ldots$ is $(1+\alpha_{1}t)(1+\alpha_{2}t)(1+\alpha_{3}t)\ldots$ ….(2iv)

This is exactly the algebraic result with which we started this section.

Remark:

The fact that the series on the HRS of (2iii) is an infinite series should not bother us with questions of convergence and the like. For, throughout (combinatorics) we shall be working only in the framework of “formal power series” which we now elaborate.

*THE ALGEBRA OF FORMAL POWER SERIES*

The vector space of infinite sequences of real numbers is well-known. If $(\alpha_{k})$ and $\beta_{k}$ are two sequences, their sum is the sequence $(\alpha_{k}+\beta_{k})$, and a scalar multiple of the sequence $(\alpha_{k})$ is $(c\alpha_{k})$. We now identify the sequence $(\alpha_{k})$ with $k=0,1,2, \ldots$ with the “formal” series

$f = \sum_{k=0}^{\infty}\alpha_{k}t^{k}$….(2v)

where $t^{k}$ only means the following:

$t^{0}=1$, $t^{k}t^{l}=t^{k+l}$.

In the same way, $(\beta_{k})$, where $k=0,1,2,\ldots$ corresponds to the formal series:

$g=\sum_{k=0}^{\infty}\beta_{k}t^{k}$ and

we define: $f+g = \sum (\alpha_{k}+\beta_{k})t^{k}$, and $cf= \sum (c\alpha_{k})t^{k}$.

The set of all power series f now becomes a vector space isomorphic to the space of infinite sequences of real numbers. The zero element of this space is the series with every coefficient zero.

Now, let us define a product of two formal power series. Given f and g as above, we write $fg=\sum_{k=0}^{\infty}\gamma_{k} t^{k}$ where

$\gamma_{k}=\alpha_{0}\beta_{k}+\alpha_{1}\beta_{k-1}+\ldots + \alpha_{k}\beta_{0} = \sum (\alpha_{i}\beta_{j})$, where $i+j=k$.

The multiplication is associative, commutative, and also distributive wrt addition. (the students/readers can take up this as an appetizer exercise !!) In fact, the set of all formal power series becomes an algebra. It is called the algebra of formal power series over the real s. It is denoted by $\bf\Re[t]$, where $\bf\Re$ means the algebra of reals. We further postulate that $f=g$ in $\bf\Re[t]$ iff $\alpha_{k}=\beta_{k}$ for all $k=0,1,2,\ldots$. As we do in polynomials, we shall agree that the terms not present indicate that the coefficients are understood to be zero. The elements of $\bf\Re$ may be considered as elements of $\bf\Re[t]$. In particular, the unity 1 of $\bf\Re$ is also the unity of $\bf\Re[t]$. Also, the element $t^{n}$ with $n>0$ belongs to $\bf\Re$, it being the formal power series $\sum \alpha_{k}t^{k}$ with $\alpha_{n}=1$ and all other $\alpha$‘s zero. We now have the following important proposition which is the only tool necessary for working with formal power series as far as combinatorics is concerned:

Proposition : 2_4:
The element f of $\bf\Re[t]$ given by (2v) has an inverse in $\bf\Re[t]$ iff $\alpha_{0}$ has an inverse in $\bf\Re$.

Proof:
If $g=\sum \beta_{k}t^{k}$ is such that $fg=1$, the multiplication rule in $\bf\Re[t]$ tells us that $\alpha_{0}\beta_{0}=1$ so that $\beta_{0}$ is the inverse of $\alpha_{0}$. Hence, the “only if” part is proved.

To prove the “if” part, let $\alpha_{0}$ have an inverse $\alpha_{0}^{-1}$ in $\bf\Re$. We will show that it is possible to find $g=\sum \beta_{k}t^{k}$ in $\bf\Re[t]$ such that $fg=1$. If such a g were to exist, then the following equations should hold in order that $fg=1$, that is,

$\alpha_{0}\beta_{0}=1$
$\alpha_{0}\beta_{1}+\alpha_{1}\beta_{0}=0$
$\alpha_{0}\beta_{2}+\alpha_{1}\beta_{1}+\alpha_{2}\beta_{0}=0$
$\vdots$

So we have $\beta_{0}=\alpha_{0}^{-1}$ from the first equation. Substituting this value of $\beta_{0}$ in the second equation, we get $\beta_{1}$ in terms of the $\alpha$‘s. And, so on, by the principle of mathematical induction, all the $\beta$‘s are uniquely determined. Thus, f is invertible in $\bf\Re$. QED.

Note that it is the above proposition which justifies the notation in $\bf\Re[t]$, equalities such as

$\frac{1}{1-t}=1+t+t^{2}+t^{3}+\ldots$

The above is true because the RHS has an inverse and $(1-t)(1+t+t^{2}+t^{3}+\ldots)=1$

So, the unique inverse of $1+t+t^{2}+t^{3}+\ldots$ is $(1-t)$ and vice versa. Hence, the expansion of $\frac{1}{1-t}$ as above. Similarly, we have

$\frac{1}{1+t}=1-t+t^{2}-\ldots$
$\frac{1}{1-t^{2}}=1+t^{2}+t^{4}+\ldots$ and many other such familiar expansions.

There is a differential operator in $D$ in $\bf\Re[t]$, which behaves exactly like the differential operator of calculus.

Define: $(Df)(\alpha)=\sum_{k=0}^{\infty}(k+1)\alpha_{k+1}t^{k}$

Then, one can easily prove that $D: f \rightarrow Df$ is linear on $\bf\Re[t]$, and further
$D^{r}f(t)=\sum_{k=0}^{\infty}(k+r)(k+r-1)\ldots(k+1)\alpha_{k+r}t^{k}$ from which we get the term “Taylor-MacLaurin” expansion

$f(t)=f(0)+Df(0)+\frac{D^{2}f(0)}{2!}+ \ldots$…(2vi)

In the same manner, one can obtain, from $f(t)=\frac{1}{1-\alpha t}$, which in turn is equal to
$1+ \alpha t + \alpha^{2} t^{2}+ \alpha^{3} t^{3} + \ldots$

the result which mimics the logarithmic differentiation of calculus, viz.,

$\frac{(Df)(t)}{f(t)} = \alpha + \alpha^{2} t+ \alpha^{3}t^{2}+ \alpha^{4}t^{3}+\ldots$…(2vii)

The truth of this in $\bf\Re[t]$ is seen by multiplying the series on the RHS of (2vii) by the series for $f(t)$, and thus obtaining the series for $(Df)(t)$.

Let us re-consider generating functions now. We saw that the GF for combinations of $\alpha_{1}, \alpha_{2}, \ldots, \alpha_{n}$ is $(1+\alpha_{1}t)(1+\alpha_{2}t)\ldots(1+\alpha_{n}t)$.

Let us analyze this and find out why it works. After all, what is a combination of the symbols : $\alpha_{1}, \alpha_{2}, \ldots, \alpha_{n}$? It is the result of a decision process involving a sequence of independent decisions as we move down the list of the $\alpha$‘s. The decisions are to be made on the following questions: Do we choose $\alpha_{1}$ or not? Do we choose $\alpha_{2}$ or not? $\ldots$ Do we choose $\alpha_{n}$ or not? And, if it is an r-combination that we want, we say “yes” to r of the questions above and say “no” to the remaining. The factor $(1+\alpha_{1}t)$ in the expression (2ii) is an algebraic indication of the combinatorial fact that there are only two mutually exclusive alternatives available for us as far as the symbol $\alpha_{1}$ is concerned. Either we choose $\alpha_{1}$ or not. Choosing “$\alpha_{1}$” corresponds to picking the term $\alpha_{1}t$ and choosing “not $-\alpha_{1}$” corresponds to picking the term 1. This correspondence is justified by the fact that in the formation of products in the expression of (2iv), each term in the expansion has only one contribution from $1+\alpha_{1}t$ and that is either $1$ or $\alpha_{t}$.

The product $(1+\alpha_{1}t)(1+\alpha_{2}t)$ gives us terms corresponding to all possible choices of combinations of the symbols $\alpha_{1}$ and $\alpha_{2}$ — these are:

$1.1$ standing for the choice “not-$\alpha_{1}$” and “not-$\alpha_{2}$

$\alpha_{1}t . 1$ standing for the choice of $\alpha_{1}$ and “not-$\alpha_{2}$

$1.\alpha_{2}t$ standing for the choice of “not-$\alpha_{1}$” and $\alpha_{2}$.

$\alpha_{1}t . \alpha_{2}t$ standing for the choice of $\alpha_{1}$ and $\alpha_{2}$.

This is, in some sense, the rationale for (2iv) being the OGF for the several r-combinations of $\alpha_{1}, \alpha_{2}, \ldots, \alpha_{n}$.

We shall now complicate the situation a little bit. Let us ask for the combinations of the symbols $\alpha_{1}, \alpha_{2}, \ldots, \alpha_{n}$ with repetitions of each symbol allowed once more in the combinations.

To be discussed in the following article,

Regards,
Nalin Pithwa.

Reference:
Combinatorics, Theory and Applications, V. Krishnamurthy, East-West Press.
https://www.amazon.in/Combinatorics-Theory-Applications-Krishnamurthy-V/dp/8185336024/ref=sr_1_5?keywords=V+Krishnamurthy&qid=1553718848&s=books&sr=1-5

# Tutorial problems for RMO 2019 : combinatorics continued

1) In how many ways can 5 men and 5 women be seated in a round table if no two women may be seated side by side?

2) Six generals propose locking a safe containing top secret with a number of different locks. Each general will be given keys to certain of these locks. How many locks are required and how many keys must each general have so that, unless at least four generals are present, the safe cannot be opened?

3) How many integers between 1000 and 9999 inclusive have distinct digits? Of these, how many are even numbers? How many consist entirely of odd digits?

4) In how many ways can 9 distinct objects be placed in 5 distinct boxes in such a way that 3 of these boxes would be occupied and 2 would be empty?

5) In how many permutations of the word AUROBIND do the vowels appear in the alphabetical order?

6) There is an unlimited supply of weights of integral numbers of grams. Using n or fewer weights, find the number of ways in which a weight of m grams can be obtained. Prove that there is a bijection of the set of all such ways on the set of increasing words of length $(n-1)$ or $(m+1)$ ordered letters.

7) How many distinct solutions are there of $x+y+z+w=10$ (a) in positive integers and (b) in non-negative integers?

8) A train with n passengers aboard makes m stops. In how many ways can the passengers distribute themselves among these m stops as alighting passengers? if we are concerned only with the number of alighting passengers at each stop, how would the answer be modified?

9) There are 16 books on a bookshelf. In how many ways can 6 of these books be selected if a selection must not include two neighbouring books?

10) Show that there are ${(n=5)} \choose 5$ distinct throws of a throw with n non-distinct dice.

11) Given n indistinguishable objects and n additional distinct objects —- also distinct from the earlier n objects — in how many ways can we choose n out of the 2n objects?

12) Establish the following relations:
12a) $B_{n+1}=\sum_{k=0}^{n}(B_{k}){n \choose k}$
12b) $\sum_{k}{p \choose k}{q \choose {n-k}}={{p+q} \choose n}$
12c) $S_{n+1}^{m} = \sum_{k=0}^{n}{n \choose k}S_{k}^{m-1}$
12d) $n^{p}=\sum_{k=0}^{n}{n \choose k}k! (S_{p}^{k})$

13) Prove the following identity for all real numbers x:
$x^{n}= \sum_{k=1}^{n}S_{n}^{k}[x]_{k}$

14) Express $x^{4}$ in terms of ${x \choose 4}$, ${x \choose 3}$, …by using the $S_{n}^{k}$‘s. Express ${x \choose 4}$ in terms of $x^{4}$, $x^{3}$, …by using the $s_{n}^{k}$‘s.

15) A circular loop is divided into p parts, p prime. In how many ways can we paint the loop with n colours if we do not distinguish between patterns which differ only by a rotation of the loop? Deduce Fermat’s Little theorem: $n^{p}-n$ is divisible by p if p is prime.

16) In problem 15, prove that $n^{p}-n$ is also divisible by 2p if $p \neq 2$. Where is the hypothesis that p is prime used in Problem 15 or in this problem?

17) How many equivalence relations are possible on an n-set?

18) The complete homogeneous symmetric function of n variables $\alpha_{1}$, $\alpha_{2}$, $\ldots$, $\alpha_{n}$ of degree r is defined as $h_{r}(\alpha_{1},\alpha_{2}, \alpha_{3}, \ldots, \alpha_{n})=\sum \alpha_{1}^{i_{1}}\alpha_{2}^{i_{2}}\ldots \alpha_{n}^{i_{n}}$ the summation being taken over all ordered partitions of r, where the parts are also allowed to be zero. How many terms are there in $h_{r}$?

Test yourself ! Improve your mettle in math !
Regards,
Nalin Pithwa.

# RMO and Pre RMO Geometry Tutorial Worksheet 1: Based on Geometric Refresher

1) Show that quadrilateral ABCD can be inscribed in a circle iff $\angle B$ and $\angle D$ are supplementary.

2) Prove that a parallelogram having perpendicular diagonals is a rhombus.

3) Prove that a parallelogram with equal diagonals is a rectangle.

4) Show that the diagonals of an isosceles trapezoid are equal.

5) A straight line cuts two concentric circles in points A, B, C and D in that order. AE and BF are parallel chords, one in each circle. If CG is perpendicular to BF and DH is perpendicular to AE, prove that $GF = HE$.

6) Construct triangle ABC, given angle A, side AC and the radius r of the inscribed circle. Justify your construction.

7) Let a triangle ABC be right angled at C. The internal bisectors of angle A and angle B meet BC and CA at P and Q respectively. M and N are the feet of the perpendiculars from P and Q to AB. Find angle MCN.

8) Three circles $C_{1}, C_{2}, C_{3}$ with radii $r_{1}, r_{2}, r_{3}$, with $r_{1}. They are placed such that $C_{2}$ lies to the right of $C_{1}$ and touches it externally; $C_{3}$ lies to the right of $C_{2}$ and touches it externally. Further, there exist two straight lines each of which is a direct common tangent simultaneously to all the three circles. Find $r_{2}$ in terms of $r_{1}$ and $r_{3}$.

Cheers,

Nalin Pithwa

# Basic Geometry: Refresher for pre-RMO, RMO and IITJEE foundation maths

1) Assume that in a $\bigtriangleup$ ABC and $\bigtriangleup RST$, we know that $AB=RS$, $AC=RT$, $BC=ST$. Prove that $\bigtriangleup ABC \cong \bigtriangleup RST$ without using the SSS congruence criterion.

2) Let $\bigtriangleup ABC$ be isosceles with base BC. Then, $\angle B = \angle C$. Also, the median from vertex A, the bisector of $\angle A$, and the altitude from vertex A are all the same line. Prove this.

3) If two triangles have equal hypotenuses and an arm of one of the triangles equals an arm of the other, then the triangles are congruent. Prove.

4) An exterior angle of a triangle equals the sum of the two remote interior angles. Also, the sum of all three interior angles of a triangle is 180 degrees.

5) Find a formula for the interior angles of an n-gon.

6) Prove that the opposite sides of a parallelogram are equal.

7) In a quadrilateral ABCD, suppose that AB=CD and AD=BC. Then, prove that ABCD is a parallelogram.

8) In a quadrilateral ABCD, suppose that AB=CD and AB is parallel to CD. Then, prove that ABCD is a parallelogram.

9) Prove that a quadrilateral is a parallelogram iff its diagonals bisect each other.

10) Given a line segment BC, the locus of all points equidistant from B and C is the perpendicular bisector of the segment. Prove.

11) Corollary to problem 10 above: The diagonals of a rhombus are perpendicular. Prove.

12) Let AX be the bisector of $\angle A$ in $\triangle ABC$. Then, prove $\frac{BX}{XC} = \frac{AB}{AC}$. In other words, X divides BC into pieces proportional to the lengths of the nearer sides of the triangle. Prove.

13) Suppose that in $\triangle ABC$, the median from vertex A and the bisector of $\angle A$ are the same line. Show that $AB=AC$.

14) Prove that there is exactly one circle through any three given non collinear points.

15) An inscribed angle in a circle is equal in degrees to one half its subtended arc. Equivalently, the arc subtended by an inscribed angle is measured by twice the angle. Prove.

16) Corollary to above problem 15: Opposite angles of an inscribed quadrilateral are supplementary. Prove this.

17) Another corollary to above problem 15: The angle between two secants drawn to a circle from an exterior point is equal in degrees to half the difference of the two subtended arcs. Prove this.

18) A third corollary to above problem 15: The angle between two chords that intersect in the interior of a circle is equal in degrees to half the sum of the two subtended arcs. Prove this.

19) Theorem (Pythagoras): If a right triangle has arms of lengths a and b and its hypotenuse has length c, then $a^{2}+b^{2}=c^{2}$. Prove this.

20) Corollary to above theorem: Given a triangle ABC, the angle at vertex C is a right angle iff side AB is a diameter of the circumcircle. Prove this.

21) Theorem: The angle between a chord and the tangent at one of its endpoints is equal in degrees to half the subtended arc. Prove.

22) Corollary to problem 21: The angle between a secant and a tangent meeting at a point outside a circle is equal in degrees to half the difference of the subtended arcs.

23) Fix an integer, $n \geq 3$. Given a circle, how should n points on this circle be chosen so as to maximize the area of the corresponding n-gon?

24) Theorem: Given $\bigtriangleup ABC$ and $\bigtriangleup XYZ$, suppose that $\angle A = \angle X$ and $\angle B= \angle Y$. Then, prove that $\angle C = \angle Z$ and so $\bigtriangleup ABC \sim \bigtriangleup XYZ$. Prove this theorem.

25) Theorem: If $\bigtriangleup ABC \sim \bigtriangleup XYZ$, then the lengths of the corresponding sides of these two triangles are proportional. Prove.

26) The following lemma is important to prove the above theorem: Let U and V be points on sides AB and AC of $\bigtriangleup ABC$. Then, UV is parallel to BC if and only if $\frac{AU}{AB} = \frac{AV}{AC}$. You will have to prove this lemma as a part of the above proof.

27) Special case of above lemma: Let U and V be the midpoints of sides AB and AC, respectively in $\bigtriangleup ABC$. Then, UV is parallel to BC and $UV = \frac{1}{2}BC$.

28) Suppose that the sides of $\bigtriangleup ABC$ are proportional to the corresponding sides of $\bigtriangleup XYZ$. Then, $\bigtriangleup ABC \sim \bigtriangleup XYZ$.

29) Given $\bigtriangleup ABC$ and $\bigtriangleup XYZ$, assume that $\angle X = \angle A$ and that $\frac{XY}{AB} = \frac{XZ}{AC}$. Then, $\bigtriangleup ABC \sim \bigtriangleup XYZ$.

30) Consider a non-trivial plane geometry question now: Let P be a point outside of parallelogram ABCD and $\angle PAB = \angle PCB$. Prove that $\angle APD = \angle CPB$.

31) Given a circle and a point P not on the circle, choose an arbitrary line through P, meeting the circle at points X and Y. Then, the quantity $PX.PY$ depends only on the point P and is independent of the choice of the line through P.

32) You can given an alternative proof of Pythagoras’s theorem based on the following lemma: Suppose $\bigtriangleup ABC$ is a right triangle with hypotenuse AB and let CP be the altitude drawn to the hypotenuse. Then, $\bigtriangleup ACP \sim \bigtriangleup ABC \sim \bigtriangleup CBP$. Prove both the lemma and based on it produce an alternative proof of Pythagorean theorem.

33) Prove the following: The three perpendicular bisectors of the sides of a triangle are concurrent at the circumcenter of the triangle.

34) Prove the law of sines.

35) Let R and K denote the circumradius and area of $\bigtriangleup ABC$, respectively and let a, b and c denote the side lengths, as usual. Then, $4KR = abc$.

36) Theorem: The three medians of an arbitrary triangle are concurrent at a point that lies two thirds of the way along each median from the vertex of the triangle toward the midpoint of the opposite side.

37) Time to ponder: Prove: Suppose that in $\bigtriangleup ABC$, medians BY and CZ have equal lengths. Prove that $AB=AC$.

38) If the circumcenter and the centroid of a triangle coincide, then the triangle must be equilateral. Prove this fact.

39) Assume that $\bigtriangleup ABC$ is not equilateral and let G and O be its centroid and circumcentre respectively. Let H be the point on the Euler line GO that lies on the opposite side of G from O and such that $HG = 2GO$. Then, prove that all the three altitudes of $\bigtriangleup ABC$ pass through H.

40) Prove the following basic fact about pedal triangles: The pedal triangles of each of the four triangles determined by an orthic quadruple are all the same.

41) Prove the following theorem: Given any triangle, all of the following points lie on a common circle: the three feet of the altitudes, the three midpoints of the sides, and the three Euler points. Furthermore, each of the line segments joining an Euler point to the midpoint of the opposite side is a diameter of this circle.

42) Prove the following theorem and its corollary: Let R be the circumradius of triangle ABC. Then, the distance from each Euler point of $\bigtriangleup ABC$ to the midpoint of the opposite side is R, and the radius of the nine-point circle of $\bigtriangleup ABC$ is $R/2$. The corollary says: Suppose $\bigtriangleup ABC$ is not a right angled triangle and let H be its orthocentre. Then, $\bigtriangleup ABC$, $\bigtriangleup HBC$, $\bigtriangleup AHC$, and $\bigtriangleup ABH$ have equal circumradii.

43) Prove the law of cosines.

44) Prove Heron’s formula.

45) Express the circumradius R of $\bigtriangleup ABC$ in terms of the lengths of the sides.

46) Prove that the three angle bisectors of a triangle are concurrent at a point I, equidistant from the sides of the triangle. If we denote the by r the distance from I to each of the sides, then the circle of radius r centered at I is the unique circle inscribed in the given triangle. Note that in order to prove this, the following elementary lemma is required to be proved: The bisector of angle ABC is the locus of points P in the interior of the angle that are equidistant from the sides of the triangle.

47) Given a triangle with area K, semiperimeter s, and inradius r, prove that $rs=K$. Use this to express r in terms of the lengths of the sides of the triangle.

Please be aware that the above set of questions is almost like almost like a necessary set of pre-requisites for RMO geometry. You have to master the basics first.

Regards,

Nalin Pithwa.