Rwanda Math Competition 2020 Guide
Rwanda Math Competition 2020 Guide
A number is divisible by 36 if it is divisible by both 4 and 9. For a four-digit number to be divisible by 4, the last two digits must form a number that is divisible by 4. For "6∗4∗", this imposes that the digit ∗ is 0, 2, 4, 6, or 8. Similarly, to be divisible by 9, the sum of the digits 6 + 4 + the sum of the remaining digits must be divisible by 9. By testing each possibility, it turns out there is a valid solution, corresponding to one case. Therefore, the answer is 1 .
For circumscribed quadrilaterals, the sum of lengths of opposite sides are equal. Given the side ratio AB : BC : CD = 2:3:5, let AB = 2x, BC = 3x, and CD = 5x, then AD = x because 2x + x = 3x + 5x - 2x + 5x = total perimeter constant. Solving 11x = 42 cm gives x = 3.818, thus AD = 3.818 cm, equating to one of the given options .
The given inequality \( \frac{1}{2}(\frac{a}{b} + \frac{b}{a}) \geq a + b - ab \) indicates an algebraic balance, achievable through manipulation involving AM-GM inequality principles. Equality occurs when the terms on both sides satisfy the condition of geometric and arithmetic mean equality, specifically when a = b = 1, manipulating symmetric outcomes to be exactly equal en route to studied cycling .
Given square ABCD and chosen points E on AD, F on BC, G on EF, the problem explores circumscribed circles of triangles EGD and BGF intersecting at point H. The strategy involves confirming H aligns on diagonal BD by geometric locus properties and symmetry principles so that internal diagonals are respected under possible intersections such that H redistributes studied distances uniformly along BD .
To eliminate any axes of symmetry in coloring a regular pentagon, the configuration must ensure that no line can divide the pentagon into two mirror images. Using two colors, one strategy is to alternate colors such that no vertex and its opposite are the same color. There are two distinct ways to achieve this: by starting with either color on vertex A. Therefore, the number of possible ways Alice can color the vertices is 2 .
Nana's sequence alternately increases or decreases the counts of balls, conditional upon having sufficient quantities to enact the change. By analyzing initial conditions and transformations—'aaa' reduces black balls by 1 net, 'eee' alters by differing counts—a sequence is achievable where 3 'aaa' spells followed by 2 'eee' spells makes it possible to end with 4 white and 14 black balls by manipulating initial distribution through allowable transformations .