If the equation system \[\begin{array}{rcl} f(x) + g(x) &=& 0 \\ f(x)-(g(x))^3 &=& 0 \end{array}\] has more than one real roots, where $a,b,c,d$ are reals and $f(x)=x^2 + ax+b$, $g(x)=x^2 + cx + d$, at most how many distinct real roots can the equation $f(x)g(x) = 0$ have? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 4 $

Determine whether there exist an infinite number of positive integers $x,y $ satisfying the condition: $x^2+y \mid x+y^2.$ Please prove it.

Given is a set $A$ of $n$ elements and positive integers $k, m$ such that $4 \leq k <n$ and $m \leq \min \{k-3, \frac {n} {2}\}$. Let $A_1, A_2, \ldots, A_l$ be subsets of $A$, all with size $k$, such that $|A_i \cap A_j| \leq m$ for all $i \neq j$. Prove that there exists a subset $B$ of $A$ with at least $\sqrt[m+1]{n}+m$ elements which doesn't contain entirely any of the subsets $A_1, A_2, \ldots, A_l$.

If $x$ and $y$ are real numbers, compute the minimum possible value of \[\frac{4xy(3x^2+10xy+6y^2)}{x^4+4y^4}.\]

A real number $ to $ is randomly and uniformly chosen from the $ [- 3,4] $ interval. What is the probability that all roots of the polynomial $ x ^ 3 + ax ^ 2 + ax + 1 $ are real?

A sequence of integers $1 = x_1 < x_2 < x_3 <...$ satisfies $x_{n+1} \le 2n$ for all $n$. Show that every positive integer $k$ can be written as $x_j -x_i$ for some $i, j$.

Which of the following fractions has the largest value? $\text{(A)}\ \frac{3}{7} \qquad \text{(B)}\ \frac{4}{9} \qquad \text{(C)}\ \frac{17}{35} \qquad \text{(D)}\ \frac{100}{201} \qquad \text{(E)}\ \frac{151}{301}$

[b]p1.[/b] A matrix is a rectangular array of numbers. For example, $\begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix}$ and $\begin{pmatrix} 1 & 3 \\ 2 & 4 \end{pmatrix}$ are $2 \times 2$ matrices. A [i]saddle [/i] point in a matrix is an entry which is simultaneously the smallest number in its row and the largest number in its column. a. Write down a $2 \times 2$ matrix which has a saddle point, and indicate which entry is the saddle point. b. Write down a $2 \times 2$ matrix which has no saddle point c. Prove that a matrix of any size, all of whose entries are distinct, can have at most one saddle point. [b]p2.[/b] a. Find four different pairs of positive integers satisfying the equation $\frac{7}{m}+\frac{11}{n}=1$. b. Prove that the solutions you have found in part (a) are all possible pairs of positive integers satisfying the equation $\frac{7}{m}+\frac{11}{n}=1$. [b]p3.[/b] Let $ABCD$ be a quadrilateral, and let points $M, N, O, P$ be the respective midpoints of sides $AB$, $BC$, $CD$, $DA$. a. Show, by example, that it is possible that $ABCD$ is not a parallelogram, but $MNOP$ is a square. Be sure to prove that your construction satisfies all given conditions. b. Suppose that $MO$ is perpendicular to $NP$. Prove that $AC = BD$. [b]p4.[/b] A [i]Pythagorean triple[/i] is an ordered collection of three positive integers $(a, b, c)$ satisfying the relation $a^2 + b^2 = c^2$. We say that $(a, b, c)$ is a [i]primitive [/i] Pythagorean triple if $1$ is the only common factor of $a, b$, and $c$. a. Decide, with proof, if there are infinitely many Pythagorean triples. b. Decide, with proof, if there are infinitely many primitive Pythagorean triples of the form $(a, b, c)$ where $c = b + 2$. c. Decide, with proof, if there are infinitely many primitive Pythagorean triples of the form $(a, b, c)$ where $c = b + 3$. [b]p5.[/b] Let $x$ and $y$ be positive real numbers and let $s$ be the smallest among the numbers $\frac{3x}{2}$,$\frac{y}{x}+\frac{1}{x}$ and $\frac{3}{y}$. a. Find an example giving $s > 1$. b. Prove that for any positive $x$ and $y,s <2$. c. Find, with proof, the largest possible value of $s$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a positive integer $A$ written in decimal expansion: $(a_{n},a_{n-1}, \ldots, a_{0})$ and let $f(A)$ denote $\sum^{n}_{k=0} 2^{n-k}\cdot a_k$. Define $A_1=f(A), A_2=f(A_1)$. Prove that: [b]I.[/b] There exists positive integer $k$ for which $A_{k+1}=A_k$. [b]II.[/b] Find such $A_k$ for $19^{86}.$

Evaluate \[\int_0^1 (1-x^2)^n dx\ (n=0,1,2,\cdots)\]

Given $n$ real numbers $a_1$, $a_2$ $\ldots$ $a_n$. ($n\geq 1$). Prove that there exists real numbers $b_1$, $b_2$ $\ldots$ $b_n$ satisfying: (a) For any $1 \leq i \leq n$, $a_i - b_i$ is a positive integer. (b)$\sum_{1 \leq i < j \leq n} (b_i - b_j)^2 \leq \frac{n^2-1}{12}$

Let $ABC$ be a right triangle with $\angle{ACB}=90^{\circ}$. $D$ is a point on $AB$ such that $CD\perp AB$. If the area of triangle $ABC$ is $84$, what is the smallest possible value of $$AC^2+\left(3\cdot CD\right)^2+BC^2?$$ [i]2016 CCA Math Bonanza Lightning #2.3[/i]

In triangle $\triangle ABC$ with median from $B$ not perpendicular to $AB$ nor $BC$, we call $X$ and $Y$ points on $AB$ and $BC$, which lie on the axis of the median from $B$. Find all such triangles, for which $A,C,X,Y$ lie on one circumrefference.

Assume that the numbers from the table $$\begin{matrix}a_{11}&a_{12}&\cdots&a_{1n}\\a_{21}&a_{22}&\cdots&a_{2n}\\\vdots&\vdots&&\vdots\\a_{n1}&a_{n2}&\cdots&a_{nn}\end{matrix}$$satisfy the inequality: $$\sum_{j=1}^n|a_{j1}x_1+a_{j2}x_2+\ldots+a_{jn}x_n|\le M,$$for each choice $x_j=\pm1$. Prove that $$|a_{11}+a_{22}+\ldots+a_{nn}|\le M.$$

Let $f: \mathbb{Z}_{>0} \rightarrow \mathbb{Z}$ be a function with the following properties: (i) $f(1) = 0$ (ii) $f(p) = 1$ for all prime numbers $p$ (iii) $f(xy) = y \cdot f(x) + x \cdot f(y)$ for all $x,y$ in $\mathbb{Z}_{>0}$ Determine the smallest integer $n \ge 2015$ that satisfies $f(n) = n$. (Gerhard J. Woeginger)

Suppose $a_1, a_2, \ldots$ is a sequence of integers, and $d$ is some integer. For all natural numbers $n$, \begin{align*}\text{(i)} |a_n| \text{ is prime;} && \text{(ii)} a_{n+2} = a_{n+1} + a_n + d. \end{align*} Show that the sequence is constant.