For each pair $(a,b)$ of positive integers, determine all non-negative integers $n$ such that \[b+\left\lfloor{\frac{n}{a}}\right\rfloor=\left\lceil{\frac{n+b}{a}}\right\rceil.\]

Let $n$ be a positive integer and $A=\{ 1,2,\ldots ,n\}$. A subset of $A$ is said to be connected if it consists of one element or several consecutive elements. Determine the maximum $k$ for which there exist $k$ distinct subsets of $A$ such that the intersection of any two of them is connected.

$77$ stones weighing $1,2,\dots, 77$ grams are divided into $k$ groups such that total weights of each group are different from each other and each group contains less stones than groups with smaller total weights. For how many $k\in \{9,10,11,12\}$, is such a division possible? $ \textbf{(A)}\ 4 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 1 \qquad\textbf{(E)}\ \text{None of above} $

Determine the natural numbers that cannot be written as $\lfloor n + \sqrt{n} + \frac{1}{2} \rfloor$ for any $n \in \mathbb{N}$.

Let $ \alpha$ be the positive root of the equation $ x^{2} \equal{} 1991x \plus{} 1$. For natural numbers $ m$ and $ n$ define \[ m*n \equal{} mn \plus{} \lfloor\alpha m \rfloor \lfloor \alpha n\rfloor. \] Prove that for all natural numbers $ p$, $ q$, and $ r$, \[ (p*q)*r \equal{} p*(q*r). \]

suppose that $\mathcal F\subseteq p(X)$ and $|X|=n$. we know that for every $A_i,A_j\in \mathcal F$ that $A_i\supseteq A_j$ we have $3\le |A_i|-|A_j|$. prove that: $|\mathcal F|\le \lfloor\frac{2^n}{3}+\frac{1}{2}\dbinom{n}{\lfloor\frac{n}{2}\rfloor}\rfloor$ (20 points)

Let $X$ be an $n$-element set and let $A_1,\ldots ,A_m$ be subsets of $X$ such that i) $|A_i|=3$ for each $i=1,\ldots ,m$. ii) $|A_i\cap A_j|\le 1$ for any two distinct indices $i,j$. Show that there exists a subset of $X$ with at least $\lfloor\sqrt{2n}\rfloor$ elements which does not contain any of the $A_i$’s.

For a given positive integer $n >2$, let $C_{1},C_{2},C_{3}$ be the boundaries of three convex $n-$ gons in the plane , such that $C_{1}\cap C_{2}, C_{2}\cap C_{3},C_{1}\cap C_{3}$ are finite. Find the maximum number of points of the sets $C_{1}\cap C_{2}\cap C_{3}$.

Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?

Define $\lfloor x \rfloor$ as the largest integer less than or equal to $x$. Define $\{x \} = x - \lfloor x \rfloor$. For example, $\{ 3 \} = 3-3 = 0$, $\{ \pi \} = \pi - 3$, and $\{ - \pi \} = 4-\pi$. If $\{n\} + \{ 3n\} = 1.4$, then find the sum of all possible values of $100\{n\}$. [i]Proposed by Isabella Grabski [/i]

Find the greatest positive integer $x$ such that $23^{6+x}$ divides $2000!$

Hexagon $ABCDEF$ is divided into four rhombuses, $\mathcal{P, Q, R, S,}$ and $\mathcal{T,}$ as shown. Rhombuses $\mathcal{P, Q, R,}$ and $\mathcal{S}$ are congruent, and each has area $\sqrt{2006}$. Let $K$ be the area of rhombus $\mathcal{T}$. Given that $K$ is a positive integer, find the number of possible values for $K$. [asy] size(150);defaultpen(linewidth(0.7)+fontsize(10)); draw(rotate(45)*polygon(4)); pair F=(1+sqrt(2))*dir(180), C=(1+sqrt(2))*dir(0), A=F+sqrt(2)*dir(45), E=F+sqrt(2)*dir(-45), B=C+sqrt(2)*dir(180-45), D=C+sqrt(2)*dir(45-180); draw(F--(-1,0)^^C--(1,0)^^A--B--C--D--E--F--cycle); pair point=origin; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F)); label("$\mathcal{P}$", intersectionpoint( A--(-1,0), F--(0,1) )); label("$\mathcal{S}$", intersectionpoint( E--(-1,0), F--(0,-1) )); label("$\mathcal{R}$", intersectionpoint( D--(1,0), C--(0,-1) )); label("$\mathcal{Q}$", intersectionpoint( B--(1,0), C--(0,1) )); label("$\mathcal{T}$", point); dot(A^^B^^C^^D^^E^^F);[/asy]

Find all polynomials $P(x)$ with real coefficients having the following property: There exists a positive integer n such that the equality $$\sum_{k=1}^{2n+1}(-1)^k \left[\frac{k}{2}\right] P(x + k)=0$$ holds for infinitely many real numbers $x$.

A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula \[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0; \]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large. [i]Proposed by Harmel Nestra, Estionia[/i]

How many positive integer multiples of 1001 can be expressed in the form $10^{j}-10^{i}$, where $i$ and $j$ are integers and $0\leq i < j \leq 99$?