[b]10.[/b] Prove that if a graph with $2n+1$ vertices has at least $3n+1$ edges, then the graph contains a circuit having an even number of edges. Prove further that this statemente does not hold for $3n$ edges. (By a circuit, we mean a closed line which does not intersect itself.) [b](C. 5)[/b]

Let \( x \), \( y \), \( p \) be positive integers that satisfy the equation \( x^4 = p + 9y^4 \), where \( p \) is a prime number. Show that \( \frac{p^2 - 1}{3} \) is a perfect square and a multiple of 16.

Let $N =\{1, 2, 3, ...\}$ be the set of all natural numbers and $f : N\to N$ be a function. Suppose $f(1) = 1$, $f(2n) = f(n)$ and $f(2n + 1) = f(2n) + 1$ for all natural numbers $n$. (i) Calculate the maximum value $M$ of $f(n)$ for $n \in N$ with $1 \le n \le 1994$. (ii) Find all $n \in N$, with 1 \le n \le 1994, such that $f(n) = M$.

A convex $n$-gon and its $n-3$ diagonals which have no common point inside the polygon form a [i]subdivision graph[/i]. Show that if and only if $3|n$, there exists a [i]subdivision graph [/i]that can be drawn in one closed stroke. (i.e. start from a certain vertex, get through every edges and diagonals exactly one time, finally back to the starting vertex.)

Determine all functions $f:\mathbb{R}^{+} \to \mathbb{R}^{+}$ such that for any positive reals $x,y$, $$f(xy+f(xy)) = xf(y) + yf(x)$$

On blackboard there are $10$ different positive integers which sum is equal to $62$. Prove that product of those numbers is divisible with $60$

Let $ ABC$ be an obtuse inscribed in a circle of radius $ 1$. Prove that $ \triangle ABC$ can be covered by an isosceles right-angled triangle with hypotenuse of length $ \sqrt {2} \plus{} 1$.

If $\sqrt{2 + \sqrt{x}} = 3$, then $x =$ $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ \sqrt{7} \qquad \textbf{(C)}\ 7 \qquad \textbf{(D)}\ 49 \qquad \textbf{(E)}\ 121$

Given the endless arithmetic progression with the positive integer members. One of those is an exact square. Prove that the progression contain the infinite number of the exact squares.

Given two monic polynomials $P(x)$ and $Q(x)$ with degrees 2016. $P(x)=Q(x)$ has no real root. [b]Prove that P(x)=Q(x+1) has at least one real root.[/b]

Prove that there exists an integer $n$, $n\geq 2002$, and $n$ distinct positive integers $a_1,a_2,\ldots,a_n$ such that the number $N= a_1^2a_2^2\cdots a_n^2 - 4(a_1^2+a_2^2+\cdots + a_n^2) $ is a perfect square.

Find $x+y+z$ when $$a_1x+a_2y+a_3z= a$$$$b_1x+b_2y+b_3z=b$$$$c_1x+c_2y+c_3z=c$$ Given that $$a_1\left(b_2c_3-b_3c_2\right)-a_2\left(b_1c_3-b_3c_1\right)+a_3\left(b_1c_2-b_2c_1\right)=9$$$$a\left(b_2c_3-b_3c_2\right)-a_2\left(bc_3-b_3c\right)+a_3\left(bc_2-b_2c\right)=17$$$$a_1\left(bc_3-b_3c\right)-a\left(b_1c_3-b_3c_1\right)+a_3\left(b_1c-bc_1\right)=-8$$$$a_1\left(b_2c-bc_2\right)-a_2\left(b_1c-bc_1\right)+a\left(b_1c_2-b_2c_1\right)=7.$$ [i]2017 CCA Math Bonanza Lightning Round #5.1[/i]

Find all real values $x$ that satisfy the following equation: $$\frac{\sin 3x cos \left(\frac{\pi}{3}-4x \right)+ 1}{\sin \left(\frac{\pi}{3}-7x \right) - cos\left(\frac{\pi}{6}+x \right)+m}= 0$$ where $m$ is a given real number.

Let $f(t) = \displaystyle\sum_{j=1}^{N} a_j \sin (2\pi jt)$, where each $a_j$ is areal and $a_N$ is not equal to $0$. Let $N_k$ denote the number of zeroes (including multiplicites) of $\dfrac{d^k f}{dt^k}$. Prove that \[ N_0 \le N_1 \le N_2 \le \cdots \text { and } \lim_{k \rightarrow \infty} N_k = 2N. \] [color=green][Only zeroes in [0, 1) should be counted.][/color]

In an acute-angled triangle $\triangle ABC$, D is the point on BC such that AD bisects ∠BAC, E and F are the feet of the perpendiculars from D onto AB and AC respectively. The segments BF and CE intersect at K. Prove that AK is perpendicular to BC.

Is it possible to cover an $n \times n$ chessboard which has its center square cut out with tiles shown in the picture (each tile covers exactly $4$ squares, tiles can be rotated and turned around) if a) $n = 5$, b) $n = 2003$? [img]https://cdn.artofproblemsolving.com/attachments/6/5/8fddeefc226ee0c02353a1fc11e48ce42d8436.png[/img]

How many distinct cubes have two red faces, two white faces, and two blue faces? (Two cubes are considered distinct if they cannot be rotated to look the same.) $\text{(A) }5\qquad\text{(B) }6\qquad\text{(C) }7\qquad\text{(D) }8\qquad\text{(E) }9$

On the same side of a straight line three circles are drawn as follows: a circle with a radius of $4$ inches is tangent to the line, the other two circles are equal, and each is tangent to the line and to the other two circles. The radius of the equal circles is: $ \textbf{(A)}\ 24 \qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 18\qquad\textbf{(D)}\ 16\qquad\textbf{(E)}\ 12 $

1. The transformation $ n \to 2n \minus{} 1$ or $ n \to 3n \minus{} 1$, where $ n$ is a positive integer, is called the 'change' of $ n$. Numbers $ a$ and $ b$ are called 'similar', if there exists such positive integer, that can be got by finite number of 'changes' from both $ a$ and $ b$. Find all positive integers 'similar' to $ 2005$ and less than $ 2005$.

For $n > 1$, let $a_n$ be the number of zeroes that $n!$ ends with when written in base $n$. Find the maximum value of $\frac{a_n}{n}$.

Let $n$ be an integer $> 1$. In a circular arrangement of $n$ lamps $L_0, \cdots, L_{n-1}$, each one of which can be either ON or OFF, we start with the situation that all lamps are ON, and then carry out a sequence of steps, $Step_0, Step_1, \cdots$. If $L_{j-1}$ ($j$ is taken mod n) is ON, then $Step_j$ changes the status of $L_j$ (it goes from ON to OFF or from OFF to ON) but does not change the status of any of the other lamps. If $L_{j-1}$ is OFF, then $Step_j$ does not change anything at all. Show that: [i](a)[/i] There is a positive integer $M(n)$ such that after $M(n)$ steps all lamps are ON again. [i](b)[/i] If $n$ has the form $2^k$, then all lamps are ON after $n^2 - 1$ steps. [i](c) [/i]If $n$ has the form $2^k +1$, then all lamps are ON after $n^2 -n+1$ steps.

Let $n \geqslant 3$ be an integer, and let $x_1,x_2,\ldots,x_n$ be real numbers in the interval $[0,1]$. Let $s=x_1+x_2+\ldots+x_n$, and assume that $s \geqslant 3$. Prove that there exist integers $i$ and $j$ with $1 \leqslant i<j \leqslant n$ such that \[2^{j-i}x_ix_j>2^{s-3}.\]

Circles $w_1$ and $w_2$ intersect at points $P$ and $Q$ and touch a circle $w$ with center at point $O$ internally at points $A$ and $B$, respectively. It is known that the points $A,B$ and $Q$ lie on one line. Prove that the point $O$ lies on the external bisector $\angle APB$. (Nazar Serdyuk)

Find all polynomials $P(x)$ with integer coefficients such that for all real numbers $s$ and $t$, if $P(s)$ and $P(t)$ are both integers, then $P(st)$ is also an integer.

$ABCDE$ is a cyclic pentagon, with circumcentre $O$. $AB=AE=CD$. $I$ midpoint of $BC$. $J$ midpoint of $DE$. $F$ is the orthocentre of $\triangle ABE$, and $G$ the centroid of $\triangle AIJ$.$CE$ intersects $BD$ at $H$, $OG$ intersects $FH$ at $M$. Show that $AM\perp CD$.