Find the number of triples of sets $(A, B, C)$ such that: (a) $A, B, C \subseteq \{1, 2, 3, \dots , 8 \}$. (b) $|A \cap B| = |B \cap C| = |C \cap A| = 2$. (c) $|A| = |B| = |C| = 4$. Here, $|S|$ denotes the number of elements in the set $S$.

Let $a_1,a_2,\ldots$ be a sequence of integers with infinitely many positive and negative terms. Suppose that for every positive integer $n$ the numbers $a_1,a_2,\ldots,a_n$ leave $n$ different remainders upon division by $n$. Prove that every integer occurs exactly once in the sequence $a_1,a_2,\ldots$.

A particle moves from $(0, 0)$ to $(n, n)$ directed by a fair coin. For each head it moves one step east and for each tail it moves one step north. At $(n, y), y < n$, it stays there if a head comes up and at $(x, n), x < n$, it stays there if a tail comes up. Let$ k$ be a fixed positive integer. Find the probability that the particle needs exactly $2n+k$ tosses to reach $(n, n).$

The numbers 1, 2, 3, 4, 5 are to be arranged in a circle. An arrangement is [i]bad[/i] if it is not true that for every $n$ from $1$ to $15$ one can find a subset of the numbers that appear consecutively on the circle that sum to $n$. Arrangements that differ only by a rotation or a reflection are considered the same. How many different bad arrangements are there? $ \textbf {(A) } 1 \qquad \textbf {(B) } 2 \qquad \textbf {(C) } 3 \qquad \textbf {(D) } 4 \qquad \textbf {(E) } 5 $

Find the number of 4 digit positive integers '$n$' that follow these. 1) the number of digit $ \le $ 6 2) $ 3 \mid n$, but $ 6 \nmid n $

Let $a_1,a_2,\ldots$ be a sequence of integers with infinitely many positive and negative terms. Suppose that for every positive integer $n$ the numbers $a_1,a_2,\ldots,a_n$ leave $n$ different remainders upon division by $n$. Prove that every integer occurs exactly once in the sequence $a_1,a_2,\ldots$.

I have an $n \times n$ sheet of stamps, from which I've been asked to tear out blocks of three adjacent stamps in a single row or column. (I can only tear along the perforations separating adjacent stamps, and each block must come out of the sheet in one piece.) Let $b(n)$ be the smallest number of blocks I can tear out and make it impossible to tear out any more blocks. Prove that there are real constants $c$ and $d$ such that \[ \dfrac{1}{7} n^2 - cn \leq b(n) \leq \dfrac{1}{5} n^2 + dn \] for all $n > 0$.

Let $n\ge 3$ be an integer. Let $s(n)$ be the number of (ordered) pairs $(a;b)$ consisting of positive integers $a,b$ from the set $\{1,2,\dots ,n\}$ which satisfy $\gcd (a,b,n)=1$. Prove that $s(n)$ is divisible by $4$ for all $n\ge 3$. [i] (Vlad Robu) [/i]

Steve is piling $m\geq 1$ indistinguishable stones on the squares of an $n\times n$ grid. Each square can have an arbitrarily high pile of stones. After he finished piling his stones in some manner, he can then perform [i]stone moves[/i], defined as follows. Consider any four grid squares, which are corners of a rectangle, i.e. in positions $(i, k), (i, l), (j, k), (j, l)$ for some $1\leq i, j, k, l\leq n$, such that $i<j$ and $k<l$. A stone move consists of either removing one stone from each of $(i, k)$ and $(j, l)$ and moving them to $(i, l)$ and $(j, k)$ respectively, or removing one stone from each of $(i, l)$ and $(j, k)$ and moving them to $(i, k)$ and $(j, l)$ respectively. Two ways of piling the stones are equivalent if they can be obtained from one another by a sequence of stone moves. How many different non-equivalent ways can Steve pile the stones on the grid?

Compute the number of subsets $S$ of $\{0,1,\dots,14\}$ with the property that for each $n=0,1,\dots, 6$, either $n$ is in $S$ or both of $2n+1$ and $2n+2$ are in $S$. [i]Proposed by Evan Chen[/i]

A game is played by $n$ girls ($n \geq 2$), everybody having a ball. Each of the $\binom{n}{2}$ pairs of players, is an arbitrary order, exchange the balls they have at the moment. The game is called nice [b]nice[/b] if at the end nobody has her own ball and it is called [b]tiresome[/b] if at the end everybody has her initial ball. Determine the values of $n$ for which there exists a nice game and those for which there exists a tiresome game.

How many three-digit numbers $\underline{abc}$ have the property that when it is added to $\underline{cba}$, the number obtained by reversing its digits, the result is a palindrome? (Note that $\underline{cba}$ is not necessarily a three-digit number since before reversing, $c$ may be equal to $0$.)

Unconventional dice are to be designed such that the six faces are marked with numbers from $1$ to $6$ with $1$ and $2$ appearing on opposite faces. Further, each face is colored either red or yellow with opposite faces always of the same color. Two dice are considered to have the same design if one of them can be rotated to obtain a dice that has the same numbers and colors on the corresponding faces as the other one. Find the number of distinct dice that can be designed.

Let $A$ and $E$ be opposite vertices of an octagon. A frog starts at vertex $A.$ From any vertex except $E$ it jumps to one of the two adjacent vertices. When it reaches $E$ it stops. Let $a_n$ be the number of distinct paths of exactly $n$ jumps ending at $E$. Prove that: \[ a_{2n-1}=0, \quad a_{2n}={(2+\sqrt2)^{n-1} - (2-\sqrt2)^{n-1} \over\sqrt2}. \]

Does there exist a nonnegative integer $a$ for which the equation \[\left\lfloor\frac{m}{1}\right\rfloor + \left\lfloor\frac{m}{2}\right\rfloor + \left\lfloor\frac{m}{3}\right\rfloor + \cdots + \left\lfloor\frac{m}{m}\right\rfloor = n^2 + a\] has more than one million different solutions $(m, n)$ where $m$ and $n$ are positive integers? [i]The expression $\lfloor x\rfloor$ denotes the integer part (or floor) of the real number $x$. Thus $\lfloor\sqrt{2}\rfloor = 1, \lfloor\pi\rfloor =\lfloor 22/7 \rfloor = 3, \lfloor 42\rfloor = 42,$ and $\lfloor 0 \rfloor = 0$.[/i]

The SET game is a deck with $81$ unique cards that vary in four features across three possibilities for each kind of feature: shape (oval, squiggle or diamond), color (red, green or purple), number of shapes (one, two or three) and shading (solid, striped or open). A $\textbf{set}$ consists in three cards whose characteristics, when considered individually, are the same on each card or different on all of them. All features have to satisfy this rule. In other words: the shape must be the same on all three cards or different on all them, the color must be the same on the three cards or different on all them, and so on. Ana and Bárbara divided among themselves the $81$ SET cards. Ana got $40$ cards and Bárbara got $41$. Each girl counted the number of ways she could form a three-card $\textbf{set}$ with her cards. What are the possible values of the sum of these two numbers?

Let $\mathbb{N}^2$ denote the set of ordered pairs of positive integers. A finite subset $S$ of $\mathbb{N}^2$ is [i]stable[/i] if whenever $(x,y)$ is in $S$, then so are all points $(x',y')$ of $\mathbb{N}^2$ with both $x'\leq x$ and $y'\leq y$. Prove that if $S$ is a stable set, then among all stable subsets of $S$ (including the empty set and $S$ itself), at least half of them have an even number of elements. [i]Ashwin Sah and Mehtaab Sawhney[/i]

$(GDR 3)$ Find the number of permutations $a_1, \cdots, a_n$ of the set $\{1, 2, . . ., n\}$ such that $|a_i - a_{i+1}| \neq 1$ for all $i = 1, 2, . . ., n - 1.$ Find a recurrence formula and evaluate the number of such permutations for $n \le 6.$

We say that a positive integer is guarani if the sum of the number with its reverse is a number that only has odd digits. For example, $249$ and $30$ are guarani, since $249 + 942 = 1191$ and $30 + 03 = 33$. a) How many $2021$-digit numbers are guarani? b) How many $2023$-digit numbers are guarani?

Let $n$ be a positive integer. How many integer solutions $(i, j, k, l) , \ 1 \leq i, j, k, l \leq n$, does the following system of inequalities have: \[1 \leq -j + k + l \leq n\]\[1 \leq i - k + l \leq n\]\[1 \leq i - j + l \leq n\]\[1 \leq i + j - k \leq n \ ?\]

There are 12 gold stars arranged in a circle on a blue background. Giorgi wants to label each star with one of the letters $G$, $E$, or $O$, such that no two consecutive stars have the same letter. Determine the number of distinct ways Giorgi can label the stars. [img]https://i.imgur.com/qIxdJ8j.jpeg[/img] [i]Proposed by Giorgi Arabidze, Georgia [/i]

Six men and some number of women stand in a line in random order. Let $p$ be the probability that a group of at least four men stand together in the line, given that every man stands next to at least one other man. Find the least number of women in the line such that $p$ does not exceed 1 percent.

Let $ k$ be a positive integer. Suppose that the integers $ 1,2,3,\dots,3k \plus{} 1$ are written down in random order. What is the probability that at no time during this process, the sum of the integers that have been written up to that time is a positive integer divisible by $ 3$ ? Your answer should be in closed form, but may include factorials.

Let $ n $ be a natural number. How many numbers of the form $ \pm 1\pm 2\pm 3\pm\cdots\pm n $ are there?

We define the [i]Fibonacci sequence[/i] $\{F_n\}_{n\ge0}$ by $F_0=0$, $F_1=1$, and for $n\ge2$, $F_n=F_{n-1}+F_{n-2}$; we define the [i]Stirling number of the second kind[/i] $S(n,k)$ as the number of ways to partition a set of $n\ge1$ distinguishable elements into $k\ge1$ indistinguishable nonempty subsets. For every positive integer $n$, let $t_n = \sum_{k=1}^{n} S(n,k) F_k$. Let $p\ge7$ be a prime. Prove that \[ t_{n+p^{2p}-1} \equiv t_n \pmod{p} \] for all $n\ge1$. [i]Proposed by Victor Wang[/i]