suppose that $\mathcal F\subseteq X^{(K)}$ and $|X|=n$. we know that for every three distinct elements of $\mathcal F$ like $A,B$ and $C$ we have $A\cap B \not\subset C$. a)(10 points) Prove that : \[|\mathcal F|\le \dbinom{k}{\lfloor\frac{k}{2}\rfloor}+1\] b)(15 points) if elements of $\mathcal F$ do not necessarily have $k$ elements, with the above conditions show that: \[|\mathcal F|\le \dbinom{n}{\lceil\frac{n-2}{3}\rceil}+2\]

When $n$ standard six-sided dice are rolled, the product of the numbers rolled can be any of $936$ possible values. What is $n$? $\textbf{(A)}~6\qquad\textbf{(B)}~8\qquad\textbf{(C)}~9\qquad\textbf{(D)}~10\qquad\textbf{(E)}~11$

Two positive integers are coprime if their greatest common divisor is $1$. Let $C$ be the set of all divisors of the number $8775$ that are greater than $ 1$. A set of $k$ consecutive positive integers satisfies that each of them is coprime with some element of $C$. Determine the largest possible value of $K$.

Let $n,k$ be positive integers such that $n\geq2k>3$ and $A= \{1,2,...,n\}.$ Find all $n$ and $k$ such that the number of $k$-element subsets of $A$ is $2n-k$ times bigger than the number of $2$-element subsets of $A.$

Let $ K$ be a finite field of $ p$ elements, where $ p$ is a prime. For every polynomial $ f(x)\equal{}\sum_{i\equal{}0}^na_ix^i$ ($ \in K[x]$) put $ \overline{f(x)}\equal{}\sum_{i\equal{}0}^n a_ix^{p^i}$. Prove that for any pair of polynomials $ f(x),g(x)\in K[x]$, $ \overline{f(x)}|\overline{g(x)}$ if and only if $ f(x)|g(x)$.

Let $ a_1 <a_2 <... <a_n $ consecutive positive integers (with $ n> 2 $). A grasshopper jumps on the real line, starting at point $ 0 $ and jumping $ n $ to the right with lengths $ a_1 $, $ a_2 $, ..., $ a_n $, in some order (each length occupies exactly once), ending your tour at the $ 2010 $ point. Find all the possible values $ n $ of jumps that the grasshopper could have made.

The sequences of positive integers $1,a_2,a_3,\ldots$ and $1,b_2,b_3,\ldots$ are an increasing arithmetic sequence and an increasing geometric sequence, respectively. Let $c_n=a_n+b_n$. There is an integer $k$ such that $c_{k-1}=100$ and $c_{k+1}=1000$. Find $c_k$.

Makayla attended two meetings during her 9-hour work day. The first meeting took 45 minutes and the second meeting took twice as long. What percent of her work day was spent attending meetings? $ \textbf{(A)}\ 15 \qquad \textbf{(B)}\ 20 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 30 \qquad \textbf{(E)}\ 35$

[b]p1.[/b] Consider this statement: An equilateral polygon circumscribed about a circle is also equiangular. Decide whether this statement is a true or false proposition in euclidean geometry. If it is true, prove it; if false, produce a counterexample. [b]p2.[/b] Show that the fraction $\frac{x^2-3x+1}{x-3}$ has no value between $1$ and $5$, for any real value of $x$. [b]p3.[/b] A man walked a total of $5$ hours, first along a level road and then up a hill, after which he turned around and walked back to his starting point along the same route. He walks $4$ miles per hour on the level, three miles per hour uphill, and $r$ miles per hour downhill. For what values of $r$ will this information uniquely determine his total walking distance? [b]p4.[/b] A point $P$ is so located in the interior of a rectangle that the distance of $P$ from one comer is $5$ yards, from the opposite comer is $14$ yards, and from a third comer is $10$ yards. What is the distance from $P$ to the fourth comer? [b]p5.[/b] Each small square in the $5$ by $5$ checkerboard shown has in it an integer according to the following rules: $\begin{tabular}{|l|l|l|l|l|} \hline & & & & \\ \hline & & & & \\ \hline & & & & \\ \hline & & & & \\ \hline & & & & \\ \hline \end{tabular}$ i. Each row consists of the integers $1, 2, 3, 4, 5$ in some order. ii. Тhе order of the integers down the first column has the same as the order of the integers, from left to right, across the first row and similarly fог any other column and the corresponding row. Prove that the diagonal squares running from the upper left to the lower right contain the numbers $1, 2, 3, 4, 5$ in some order. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a positive integer. Ana and Banana are playing the following game: First, Ana arranges $2n$ cups in a row on a table, each facing upside-down. She then places a ball under a cup and makes a hole in the table under some other cup. Banana then gives a finite sequence of commands to Ana, where each command consists of swapping two adjacent cups in the row. Her goal is to achieve that the ball has fallen into the hole during the game. Assuming Banana has no information about the position of the hole and the position of the ball at any point, what is the smallest number of commands she has to give in order to achieve her goal?

Given positive real numbers $a, b, c, d$ that satisfy equalities \[a^2 + d^2 - ad = b^2 + c^2 + bc \ \ \text{and} \ \ a^2 + b^2 = c^2 + d^2\] find all possible values of the expression $\frac{ab+cd}{ad+bc}.$

Determine the number of integer pairs $(x, y)$ such that $(|x| - 2)^2 + (|y| - 2)^2 < 5$ .

Let $a,b,c,d$ be odd integers such that $0<a<b<c<d$ and $ad=bc$. Prove that if $a+d=2^k$ and $b+c=2^m$ for some integers $k$ and $m$, then $a=1$.

Let $ABC$ be triangle with incenter $I$ . Let $AI$ intersect $BC$ at $D$. Point $P,Q$ lies inside triangle $ABC$ such that $\angle BPA + \angle CQA = 180^\circ$ and $B,Q,I,P,C$ concyclic in order . $BP$ intersect $CQ$ at $X$. Prove that the intersection of $(ABC)$ and $(APQ)$ lies on line $XD$.

In regular hexagon $ABCDEF$, points $W$, $X$, $Y$, and $Z$ are chosen on sides $\overline{BC}$, $\overline{CD}$, $\overline{EF}$, and $\overline{FA}$ respectively, so lines $AB$, $ZW$, $YX$, and $ED$ are parallel and equally spaced. What is the ratio of the area of hexagon $WCXYFZ$ to the area of hexagon $ABCDEF$? $\textbf{(A)}\ \frac{1}{3}\qquad\textbf{(B)}\ \frac{10}{27}\qquad\textbf{(C)}\ \frac{11}{27}\qquad\textbf{(D)}\ \frac{4}{9}\qquad\textbf{(E)}\ \frac{13}{27}$

Let $p$ be a prime number and let $m$ and $n$ be positive integers with $p^2 + m^2 = n^2$. Prove that $m> p$. (Karl Czakler)