IGMO 2020 Round 2
18th February 2021
                                       Question Points
                                          1        7
                                          2        7
                                          3        7
                                          4        7
                                          5        7
                                          6        7
                                        Total     42
Instructions:
  1. This examination contains 2 pages, including this page.
  2. You have twelve (12) hours to submit your solutions starting from when you accessed the paper.
  3. Submit your answers in the form that came with the E-Mail. If your solutions are written, you are asked
     to scan your answers using CamScanner or TapScanner. If your solutions are typed using LaTeX(not
     recommended), then you are asked to send the solutions to each question as a separate PDF (or a
     screenshot of each answer) in the corresponding submission section
  4. You are not allowed to disclose any questions on any online forums until 20:00 GMT 19th December.
     Do not participate or attempt the paper along with someone else, each contestant should be individual.
                                                     1
                               ROUND 2 QUESTIONS
 Problem 1 :
A sphere of radius r can be inscribed in a tetrahedron. The distances between the centroid of the tetrahedron
and its four faces are w, x, y and z. Prove that wxyz ≥ r4 .
 Problem 2 :
Given that f (x) = x + 1 and g(x) = 2x, how many different ways are there of combining f (x) and g(x) (this
means doing any number of compositions like f g(x) or g 3 f 2 g(x) etc) such that the resulting composition is
8x + 8m where m ≥ 0 is an integer?
Find a general formula for the number of possibilities in terms of m
 Problem 3 :
Let’s define a function φ : N → N, where 0 ∈
                                           / N, as follows
                                                            n
                                                            X
                                                  φ(n) =          k!
                                                            k=1
Let V be defined as the set of all triplets (x, y, z) ∈ N such that φ(x) = y z+1 . For a triplet x, y, z (denoted
by v) in V, we define                            h xy i √          zn
                                      fv (n) = 8        b nc +           .
                                                    8           z+x−y
                                          ([x] is fractional part of x and bxc is greatest integer less than x)
Show that for any v ∈ V and m ∈ N the sequence
                                   m, fv (m), fv (fv (m)), fv (fv (fv (m))), ...
contains at least one square of a natural number. Please note that [x] here refers to the fractional part of
x, it can also be denoted as {x} but it is denoted as [x] here.