Here $G_{n}$ denotes a simple undirected graph with $n$ vertices, $K_{n}$ denotes the complete graph with $n$ vertices, $K_{n,m}$ the complete bipartite graph whose components have $m$ and $n$ vertices, and $C_{n}$ a circuit with $n$ vertices. The number of edges in the graph $G_{n}$ is denoted $e(G_{n})$. (a) Let $p$ be a prime. Consider the graph whose vertices are the ordered pairs $(x, y)$ with $x, y \in\{0, 1, . . . , p-1\}$ and whose edges join vertices $(x, y)$ and $(x' , y')$ if and only if $xx'+yy'\equiv 1 \pmod{p}$ . Prove that this graph does not contain $C_{4}$ . (b) Prove that for infinitely many values $n$ there is a graph $G_{n}$ with $e(G_{n}) \geq \frac{n\sqrt{n}}{2}-n$ that does not contain $C_{4}$.

The graph of $ x^2 \plus{} y \equal{} 10$ and the graph of $ x \plus{} y \equal{} 10$ meet in two points. The distance between these two points is: $ \textbf{(A)}\ \text{less than 1} \qquad \textbf{(B)}\ 1\qquad \textbf{(C)}\ \sqrt{2}\qquad \textbf{(D)}\ 2\qquad \textbf{(E)}\ \text{more than 2}$

Given real numbers $(a_i)$ and $(b_i)$ (for $i=1,2,3,4$) such that $a_1 b _2 \ne a_2 b_1 .$ Consider the set of all solutions $(x_1 ,x_2 ,x_3 , x_4)$ of the simultaneous equations $$ a_1 x_1 +a _2 x_2 +a_3 x_3 +a_4 x_4 =0 \;\; \text{and}\;\; b_1 x_1 +b_2 x_2 +b_3 x_3 +b_4 x_4 =0 $$ for which no $x_i$ is zero. Each such solution generates a $4$-tuple of plus and minus signs (by considering the sign of $x_i$). [list=a] [*] Determine, with proof, the maximum number of distinct $4$-tuples possible. [*] Investigate necessary and sufficient conditions on $(a_i)$ and $(b_i)$ such that the above maximum of distinct $4$-tuples is attained.

Let $ n$ be the number of number-pairs $ (x,y)$ which satisfy $ 5y \minus{} 3x \equal{} 15$ and $ x^2 \plus{} y^2 \le 16$. Then $ n$ is: $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ \text{more than two, but finite} \qquad \textbf{(E)}\ \text{greater than any finite number}$

Let $ a_1 \geq a_2 \geq a_3 \in \mathbb{Z}^\plus{}$ be given and let N$ (a_1, a_2, a_3)$ be the number of solutions $ (x_1, x_2, x_3)$ of the equation \[ \sum^3_{k\equal{}1} \frac{a_k}{x_k} \equal{} 1.\] where $ x_1, x_2,$ and $ x_3$ are positive integers. Prove that \[ N(a_1, a_2, a_3) \leq 6 a_1 a_2 (3 \plus{} ln(2 a_1)).\]

An urn contains $4$ green balls and $6$ blue balls. A second urn contains $16$ green balls and $N$ blue balls. A single ball is drawn at random from each urn. The probability that both balls are of the same color is $0.58$. Find $N$.

An urn contains $4$ green balls and $6$ blue balls. A second urn contains $16$ green balls and $N$ blue balls. A single ball is drawn at random from each urn. The probability that both balls are of the same color is $0.58$. Find $N$.

Let $ a_1 \geq a_2 \geq a_3 \in \mathbb{Z}^\plus{}$ be given and let N$ (a_1, a_2, a_3)$ be the number of solutions $ (x_1, x_2, x_3)$ of the equation \[ \sum^3_{k\equal{}1} \frac{a_k}{x_k} \equal{} 1.\] where $ x_1, x_2,$ and $ x_3$ are positive integers. Prove that \[ N(a_1, a_2, a_3) \leq 6 a_1 a_2 (3 \plus{} ln(2 a_1)).\]

Let $\triangle ABC$ be an equilateral triangle and let $P$ be a point on $\left[AB\right]$. $Q$ is the point on $BC$ such that $PQ$ is perpendicular to $AB$. $R$ is the point on $AC$ such that $QR$ is perpendicular to $BC$. And $S$ is the point on $AB$ such that $RS$ is perpendicular to $AC$. $Q'$ is the point on $BC$ such that $PQ'$ is perpendicular to $BC$. $R'$ is the point on $AC$ such that $Q'R'$ is perpendicular to $AC$. And $S'$ is the point on $AB$ such that $R'S'$ is perpendicular to $AB$. Determine $\frac{|PB|}{|AB|}$ if $S=S'$.

Express $\int_0^2 f(x)dx$ for any quadratic functions $f(x)$ in terms of $f(0),\ f(1)$ and $f(2).$

Let $r$ be a given positive integer. Is is true that for every $r$-colouring of the natural numbers there exists a monochromatic solution of the equation $x+y=3z$? (proposed by B. Batbaysgalan, folklore)

Paula the painter and her two helpers each paint at constant, but different, rates. They always start at $\text{8:00 AM}$, and all three always take the same amount of time to eat lunch. On Monday the three of them painted $50\%$ of a house, quitting at $\text{4:00 PM}$. On Tuesday, when Paula wasn't there, the two helpers painted only $24\%$ of the house and quit at $\text{2:12 PM}$. On Wednesday Paula worked by herself and finished the house by working until $\text{7:12 PM}$. How long, in minutes, was each day's lunch break? $ \textbf{(A)}\ 30 \qquad\textbf{(B)}\ 36 \qquad\textbf{(C)}\ 42 \qquad\textbf{(D)}\ 48 \qquad\textbf{(E)}\ 60 $

Given the sets $R_{mn} = \{ (x,y) \mid x=0,1,\dots,m; y=0,1,\dots,n \}$, consider functions $f:R_{mn}\to \{-1,0,1\}$ with the following property: for each quadruple of points $A_1,A_2,A_3,A_4\in R_{mn}$ which form a square with side length $0<s<3$, we have $$f(A_1)+f(A_2)+f(A_3)+f(A_4)=0.$$ For each pair $(m,n)$ of positive integers, determine $F(m,n)$, the number of such functions $f$ on $R_{mn}$.

Let $\{a_k\}^{2011}_{k=1}$ be the sequence of real numbers defined by $$a_1=0.201, \quad a_2=(0.2011)^{a_1},\quad a_3=(0.20101)^{a_2},\quad a_4=(0.201011)^{a_3},$$ and more generally \[ a_k = \begin{cases}(0.\underbrace{20101\cdots0101}_{k+2 \ \text{digits}})^{a_{k-1}}, &\text {if } k \text { is odd,} \\ (0.\underbrace{20101\cdots01011}_{k+2 \ \text{digits}})^{a_{k-1}}, &\text {if } k \text { is even.}\end{cases} \] Rearranging the numbers in the sequence $\{a_k\}^{2011}_{k=1}$ in decreasing order produces a new sequence $\{b_k\}^{2011}_{k=1}$. What is the sum of all the integers $k$, $1\le k \le 2011$, such that $a_k = b_k$? $ \textbf{(A)}\ 671\qquad\textbf{(B)}\ 1006\qquad\textbf{(C)}\ 1341\qquad\textbf{(D)}\ 2011\qquad\textbf{(E)}\ 2012 $

For certain ordered pairs $(a,b)$ of real numbers, the system of equations \begin{eqnarray*} && ax+by =1\\ &&x^2+y^2=50\end{eqnarray*} has at least one solution, and each solution is an ordered pair $(x,y)$ of integers. How many such ordered pairs $(a,b)$ are there?

A pen costs $\mathrm{Rs.}\, 13$ and a note book costs $\mathrm{Rs.}\, 17$. A school spends exactly $\mathrm{Rs.}\, 10000$ in the year $2017-18$ to buy $x$ pens and $y$ note books such that $x$ and $y$ are as close as possible (i.e., $|x-y|$ is minimum). Next year, in $2018-19$, the school spends a little more than $\mathrm{Rs.}\, 10000$ and buys $y$ pens and $x$ note books. How much [b]more[/b] did the school pay?

Given positive integers $k,n$ and a real number $\ell$, where $k,n \geq 1$. Given are also pairwise different positive real numbers $a_1,a_2,\ldots, a_k$. Let $S = \{a_1,a_2,\ldots,a_k, -a_1, -a_2,\ldots, -a_k\}$. Let $A$ be the number of solutions of the equation $$x_1 + x_2 + \ldots + x_{2n} = 0,$$ where $x_1,x_2,\ldots, x_{2n} \in S$. Let $B$ be the number of solutions of the equation $$x_1 + x_2 + \ldots + x_{2n} = \ell,$$ where $x_1,x_2,\ldots,x_{2n} \in S$. Prove that $A \geq B$. Solutions of an equation with only difference in the permutation are different.

All lines with equation $ax+by=c$ such that $a$, $b$, $c$ form an arithmetic progression pass through a common point. What are the coordinates of that point? $\textbf{(A) } (-1,2) \qquad\textbf{(B) } (0,1) \qquad\textbf{(C) } (1,-2) \qquad\textbf{(D) } (1,0) \qquad\textbf{(E) } (1,2)$

Let $s_1$ be the sum of the first $n$ terms of the arithmetic sequence $8,12,\cdots$ and let $s_2$ be the sum of the first $n$ terms of the arithmetic sequence $17,19\cdots$. Assume $n\ne 0$. Then $s_1=s_2$ for: $\text{(A)} \ \text{no value of n} \qquad \text{(B)} \ \text{one value of n} \qquad \text{(C)} \ \text{two values of n}$ $\text{(D)} \ \text{four values of n} \qquad \text{(E)} \ \text{more than four values of n}$

If $y=a+\frac{b}{x}$, where $a$ and $b$ are constants, and if $y=1$ when $x=-1$, and $y=5$ when $x=-5$, then $a+b$ equals: $ \textbf{(A)}\ -1 \qquad\textbf{(B)}\ 0\qquad\textbf{(C)}\ 1\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11 $

Let $A$ denote the set of real numbers $x$ such that $0\le x<1$. A function $f:A\to \mathbb{R}$ has the properties: (i) $f(x)=2f(\frac{x}{2})$ for all $x\in A$; (ii) $f(x)=1-f(x-\frac{1}{2})$ if $\frac{1}{2}\le x<1$. Prove that (a) $f(x)+f(1-x)\ge \frac{2}{3}$ if $x$ is rational and $0<x<1$. (b) There are infinitely many odd positive integers $q$ such that equality holds in (a) when $x=\frac{1}{q}$.

Suppose that $n$ is a natural number. we call the sequence $(x_1,y_1,z_1,t_1),(x_2,y_2,z_2,t_2),.....,(x_s,y_s,z_s,t_s)$ of $\mathbb Z^4$ [b]good[/b] if it satisfies these three conditions: [b]i)[/b] $x_1=y_1=z_1=t_1=0$. [b]ii)[/b] the sequences $x_i,y_i,z_i,t_i$ be strictly increasing. [b]iii)[/b] $x_s+y_s+z_s+t_s=n$. (note that $s$ may vary). Find the number of good sequences. [i]proposed by Mohammad Ghiasi[/i]

Goldfish are sold at $ 15$ cents each. The rectangular coordinate graph showing the cost of $ 1$ to $ 12$ goldfish is: $ \textbf{(A)}\ \text{a straight line segment} \qquad \\ \textbf{(B)}\ \text{a set of horizontal parallel line segments}\qquad \\ \textbf{(C)}\ \text{a set of vertical parallel line segments}\qquad \\ \textbf{(D)}\ \text{a finite set of distinct points}\qquad \textbf{(E)}\ \text{a straight line}$

Paula the painter and her two helpers each paint at constant, but different, rates. They always start at $\text{8:00 AM}$, and all three always take the same amount of time to eat lunch. On Monday the three of them painted $50\%$ of a house, quitting at $\text{4:00 PM}$. On Tuesday, when Paula wasn't there, the two helpers painted only $24\%$ of the house and quit at $\text{2:12 PM}$. On Wednesday Paula worked by herself and finished the house by working until $\text{7:12 PM}$. How long, in minutes, was each day's lunch break? $ \textbf{(A)}\ 30 \qquad\textbf{(B)}\ 36 \qquad\textbf{(C)}\ 42 \qquad\textbf{(D)}\ 48 \qquad\textbf{(E)}\ 60 $

Consider systems of three linear equations with unknowns $x,$ $y,$ and $z,$ \begin{align*} a_1 x + b_1 y + c_1 z = 0 \\ a_2 x + b_2 y + c_2 z = 0 \\ a_3 x + b_3 y + c_3 z = 0 \end{align*} where each of the coefficients is either $0$ or $1$ and the system has a solution other than $x = y = z = 0.$ For example, one such system is $\{1x + 1y + 0z = 0, 0x + 1y + 1z = 0, 0x + 0y + 0z = 0\}$ with a nonzero solution of $\{x, y, z\} = \{1, -1, 1\}.$ How many such systems are there? (The equations in a system need not be distinct, and two systems containing the same equations in a different order are considered different.) $\textbf{(A) } 302 \qquad \textbf{(B) } 338 \qquad \textbf{(C) } 340 \qquad \textbf{(D) } 343 \qquad \textbf{(E) } 344$