Let $y = mx + b$ be the image when the line $x - 3y + 11 = 0$ is reflected across the x-axis. The value of $m + b$ is $ \textbf{(A)}\ -6\qquad\textbf{(B)}\ -5\qquad\textbf{(C)}\ -4\qquad\textbf{(D)}\ -3\qquad\textbf{(E)}\ -2 $

Wild Bill goes to Las Vejas and takes part in a special lottery called [i]Reverse Yrettol[/i]. In this lottery, a player may buy a ticket on which he or she may select $5$ distinct numbers from $1-20$ (inclusive). Then, $5$ distinct numbers from $1-20$ are drawn at random. A player wins if his or her ticket contains [i]none[/i] of the numbers which were drawn. If Wild Bill buys a ticket, what is the probability that he will win? [i]2017 CCA Math Bonanza Lightning Round #1.4[/i]

A bag contains two red beads and two green beads. You reach into the bag and pull out a bead, replacing it with a red bead regardless of the color you pulled out. What is the probability that all beads in the bag are red after three such replacements? $ \textbf{(A)}\ \frac{1}{8} \qquad \textbf{(B)}\ \frac{5}{32} \qquad \textbf{(C)}\ \frac{9}{32} \qquad \textbf{(D)}\ \frac{3}{8} \qquad \textbf{(E)}\ \frac{7}{16}$

It is given set with $n^2$ elements $(n \geq 2)$ and family $\mathbb{F}$ of subsets of set $A$, such that every one of them has $n$ elements. Assume that every two sets from $\mathbb{F}$ have at most one common element. Prove that $i)$ Family $\mathbb{F}$ has at most $n^2+n$ elements $ii)$ Upper bound can be reached for $n=3$

For which integers $n \geq 4$ is the following procedure possible? Remove one number of the integers $1,2,3,\dots,n+1$ and arrange them in a sequence $a_1,a_2,\dots,a_n$ such that of the $n$ numbers \[ |a_1-a_2|,|a_2-a_3|,\dots,|a_{n-1}-a_n|,|a_n-a_1| \] no two are equal.

Let \[I_n =\int_{0}^{n\pi} \frac{\sin x}{1+x} \, dx , \ \ \ \ n=1,2,3,4\] Arrange $I_1, I_2, I_3, I_4$ in increasing order of magnitude. Justify your answer.

Two cyclists ride on two intersecting circles. Each of them rides on his own circle at a constant speed. Having left at the same time from one of the points of intersection of the circles and having made one lap each, the cyclists meet again at this point. Prove that there exists a fixed point in the plane, the distances from which to cyclists are the same all the time, regardless of the directions they travel in. [i]Proposed by N. Vasiliev and I. Sharygin[/i]

Given that points $ D,E$ lie on the sidelines $ AB,BC$ of triangle $ ABC$, respectively, point $ P$ is in interior of triangle $ ABC$ such that $ PE \equal{} PC$ and $ \bigtriangleup DEP\sim \bigtriangleup PCA.$ Prove that $ BP$ is tangent of the circumcircle of triangle $ PAD.$

For the real numbers $a_1,...,a_n, b_1,...,b_m$ , the following relations hold: 1) $|a_i|= |b_j|=1$, $i=1,...,n$ ,$j=1,...,m$ 2) $a_1\sqrt{2+a_2\sqrt{2+...+a_n\sqrt2}}=b_1\sqrt{2+b_2\sqrt{2+...+b_m\sqrt2}}$ Prove that $n = m$ and $a_i=b_i$ , $i=1,...,n$

Let $a_0, a_1, a_2, ...$ be a sequence such that: $a_0 = 2$; each $a_n = 2$ or $3; a_n =$the number of $3$s between the $n$th and $n+1$th $2$ in the sequence. So the sequence starts: $233233323332332 ...$ . Show that we can find $\alpha$ such that $a_n = 2$ iff $n = [\alpha m]$ for some integer $m \geq 0$.

Suppose the polynomial $ x^{n} \plus{} a_{n \minus{} 1}x^{n \minus{} 1} \plus{} ... \plus{} a_{1} \plus{} a_{0}$ can be factorized as $ (x \plus{} r_{1})(x \plus{} r_{2})...(x \plus{} r_{n})$, with $ r_{1}, r_{2}, ..., r_{n}$ real numbers. Show that $ (n \minus{} 1)a_{n \minus{} 1}^{2}\geq\ 2na_{n \minus{} 2}$

Sunny wants to send some secret message to usjl. The secret message is a three digit number, where each digit is one digit from $0$ to $9$ (so $000$ is also possibly the secret message). However, when Sunny sends the message to usjl, at most one digit might be altered. Therefore, Sunny decides to send usjl a longer message so that usjl can decipher the message to get the original secret message Sunny wants to send. Sunny and usjl can communicate the strategy beforehand. Show that sending a $4$-digit message does not suffice. Also show that sending a $6$-digit message suffices. If it is deduced that sending a $c$-digit message suffices for some $c>6$, then partial credits may be awarded.

Given the graph $G$ and cycle $C$ in it, we can perform the following operation: add another vertex $v$ to the graph, connect it to all vertices in $C$ and erase all the edges from $C$. Prove that we cannot perform the operation indefinitely on a given graph.

Let $ \gamma$ be circumcircle of $ \triangle ABC$.Let $ R_a$ be radius of circle touching $ AB,AC$&$ \gamma$ internally.Define $ R_b,R_c$ similarly. Prove That $ \frac {1}{aR_a} \plus{} \frac {1}{bR_b} \plus{} \frac {1}{cR_c} \equal{} \frac {s^2}{rabc}$.

Inside a circle, point $K$ is taken such that the ray drawn from $K$ through the centre $O$ of the circle and the chord perpendicular to this ray passing through $K$ divide the circle into three pieces with equal area. Let $L$ be one of the endpoints of the chord mentioned. Does the inequality $\angle KOL < 75^o$ hold?

Show that there exist infinitely many mutually non- congruent triangles $T$, satisfying (i) The side lengths of $T $ are consecutive integers. (ii) The area of $T$ is an integer.

Construct the midpoint of a segment using an unmarked ruler and a [i]trisector[/i] that marks in a segment the two points that divide the segment in three equal parts.

Let $I$ be the incenter of a right-angled triangle $ABC$, and $M$ be the midpoint of hypothenuse $AB$. The tangent to the circumcircle of $ABC$ at $C$ meets the line passing through $I$ and parallel to $AB$ at point $P$. Let $H$ be the orthocenter of triangle $PAB$. Prove that lines $CH$ and $PM$ meet at the incircle of triangle $ABC$.

A natural number $N$ is written in its decimal representation . It is known that for each digit in this representation , this digit divides exactly into the number $N$ (the digit $0$ is not encountered). What is the maximum number of different digits which there can be in such a representation of $N$? (S . Fomin, Leningrad)

For which positive integers $n$ do there exist two polynomials $f$ and $g$ with integer coefficients of $n$ variables $x_1, x_2, \ldots , x_n$ such that the following equality is satisfied: \[\sum_{i=1}^n x_i f(x_1, x_2, \ldots , x_n) = g(x_1^2, x_2^2, \ldots , x_n^2) \ ? \]

In a simple graph $G$, we call $t$ pairwise adjacent vertices a $t$[i]-clique[/i]. If a vertex is connected with all other vertices in the graph, we call it a [i]central[/i] vertex. Given are two integers $n,k$ such that $\dfrac {3}{2} \leq \dfrac{1}{2} n < k < n$. Let $G$ be a graph on $n$ vertices such that [b](1)[/b] $G$ does not contain a $(k+1)$-[i]clique[/i]; [b](2)[/b] if we add an arbitrary edge to $G$, that creates a $(k+1)$-[i]clique[/i]. Find the least possible number of [i]central[/i] vertices in $G$.

The first quadrant of the Cartesian $0-x-y$ plane can be considered to be divided into an infinite set of squares of unit side length, arranged in rows and columns , formed by the axes and lines $x = i$ and $y = j$ , where $i$ and $j$ are non-negative integers. Is it possible to write a natural number $(1,2, 3,...)$ in each square , so that each row and column contains each natural number exactly once? (V . S . Shevelev)

Given a circle $C$ and a diameter $AB$ in it, mark a point $P$ on $AB$ different from the ends. In one of the two arcs determined by $AB$ choose the points $M$ and $N$ such that $\angle APM = 60 ^ \circ = \angle BPN$. The segments $MP$ and $NP$ are drawn to obtain three curvilinear triangles; $APM $, $MPN$ and $NPB$ (the sides of the curvilinear triangle $APM$ are the segments $AP$ and $PM$ and the arc $AM$). In each curvilinear triangle a circle is inscribed, that is, a circle is built tangent to the three sides. Show that the sum of the radii of the three inscribed circles is less than or equal to the radius of $C$.

$M$ is infinite set of natural numbers. If $a,b, a\neq b$ are in $M$, then $a^b+2$ or $a^b-2$ ( or both) are in $M$. Prove that there is composite number in $M$

Let $n$ be a positive integer. Suppose that $A$ and $B$ are invertible $n \times n$ matrices with complex entries such that $A+B=I$ (where $I$ is the identity matrix) and \[(A^2+B^2)(A^4+B^4)=A^5+B^5.\] Find all possible values of $\det(AB)$ for the given $n$.