There are $ 11$ coins, which are indistinguishable by sight. Nevertheless, among them there are $ 10$ geniune coins ( of weight $ 20$ g each) and one counterfeit (of weight $ 21$ g). You have a two-pan scale which is blanced when the weight in the left-hand pan is twice as much as the weight in the right-hand one. Using this scale only, find the false coin by three weighings.

Let \(p\) a prime number, and \(N\) the number of matrices \(p \times p\) \[\begin{array}{cccc} a_{11} & a_{12} & \ldots & a_{1p}\\ a_{21} & a_{22} & \ldots & a_{2p}\\ \vdots & \vdots & \ddots & \vdots \\ a_{p1} & a_{p2} & \ldots & a_{pp} \end{array}\] such that \(a_{ij} \in \{0,1,2,\ldots,p\} \) and if \(i \leq i^\prime\) and \(j \leq j^\prime\), then \(a_{ij} \leq a_{i^\prime j^\prime}\). Find \(N \pmod{p}\).

A subset $S$ of the set of integers 0 - 99 is said to have property $A$ if it is impossible to fill a crossword-puzzle with 2 rows and 2 columns with numbers in $S$ (0 is written as 00, 1 as 01, and so on). Determine the maximal number of elements in the set $S$ with the property $A.$

Find the largest positive integer $N$ so that the number of integers in the set $\{1,2,\dots,N\}$ which are divisible by 3 is equal to the number of integers which are divisible by 5 or 7 (or both).

Students are in classroom with $n$ rows. In each row there are $m$ tables. It's given that $m,n \geq 3$. At each table there is exactly one student. We call neighbours of the student students sitting one place right, left to him, in front of him and behind him. Each student shook hands with his neighbours. In the end there were $252$ handshakes. How many students were in the classroom?

Denote $U$ as the set of $20$ diagonals of the regular polygon $P_1P_2P_3P_4P_5P_6P_7P_8$. Find the number of sets $S$ which satisfies the following conditions. 1. $S$ is a subset of $U$. 2. If $P_iP_j \in S$ and $P_j P_k \in S$, and $i \neq k$, $P_iP_k \in S$.

Consider a $m\times n$ rectangular board consisting of $mn$ unit squares. Two of its unit squares are called [i]adjacent[/i] if they have a common edge, and a [i]path[/i] is a sequence of unit squares in which any two consecutive squares are adjacent. Two parths are called [i]non-intersecting[/i] if they don't share any common squares. Each unit square of the rectangular board can be colored black or white. We speak of a [i]coloring[/i] of the board if all its $mn$ unit squares are colored. Let $N$ be the number of colorings of the board such that there exists at least one black path from the left edge of the board to its right edge. Let $M$ be the number of colorings of the board for which there exist at least two non-intersecting black paths from the left edge of the board to its right edge. Prove that $N^{2}\geq M\cdot 2^{mn}$.

The total number of solutions of $xyz=2520$ (A)$2520$ (B)$2160$ (C)$540$ (D)None of these

In how many distinguishable ways can $10$ distinct pool balls be formed into a pyramid ($6$ on the bottom, $3$ in the middle, one on top), assuming that all rotations of the pyramid are indistinguishable?

A permutation of the integers $1, 2, \ldots, m$ is called [i]fresh[/i] if there exists no positive integer $k < m$ such that the first $k$ numbers in the permutation are $1, 2, \ldots, k$ in some order. Let $f_m$ be the number of fresh permutations of the integers $1, 2, \ldots, m$. Prove that $f_n \ge n \cdot f_{n - 1}$ for all $n \ge 3$. [i]For example, if $m = 4$, then the permutation $(3, 1, 4, 2)$ is fresh, whereas the permutation $(2, 3, 1, 4)$ is not.[/i]

Eight congruent equilateral triangles, each of a different color, are used to construct a regular octahedron. How many distinguishable ways are there to construct the octahedron? (Two colored octahedrons are distinguishable if neither can be rotated to look just like the other.) [asy]import three; import math; size(180); defaultpen(linewidth(.8pt)); currentprojection=orthographic(2,0.2,1); triple A=(0,0,1); triple B=(sqrt(2)/2,sqrt(2)/2,0); triple C=(sqrt(2)/2,-sqrt(2)/2,0); triple D=(-sqrt(2)/2,-sqrt(2)/2,0); triple E=(-sqrt(2)/2,sqrt(2)/2,0); triple F=(0,0,-1); draw(A--B--E--cycle); draw(A--C--D--cycle); draw(F--C--B--cycle); draw(F--D--E--cycle,dotted+linewidth(0.7));[/asy]$ \textbf{(A)}\ 210 \qquad \textbf{(B)}\ 560 \qquad \textbf{(C)}\ 840 \qquad \textbf{(D)}\ 1260 \qquad \textbf{(E)}\ 1680$

Find all positive integers $ n$ for which the numbers in the set $ S \equal{} \{1,2, \ldots,n \}$ can be colored red and blue, with the following condition being satisfied: The set $ S \times S \times S$ contains exactly $ 2007$ ordered triples $ \left(x, y, z\right)$ such that: [b](i)[/b] the numbers $ x$, $ y$, $ z$ are of the same color, and [b](ii)[/b] the number $ x \plus{} y \plus{} z$ is divisible by $ n$. [i]Author: Gerhard Wöginger, Netherlands[/i]

Rabbits Peter and Pauline have three offspring—Flopsie, Mopsie, and Cotton-tail. These five rabbits are to be distributed to four different pet stores so that no store gets both a parent and a child. It is not required that every store gets a rabbit. In how many different ways can this be done? $\textbf{(A)} \ 96 \qquad \textbf{(B)} \ 108 \qquad \textbf{(C)} \ 156 \qquad \textbf{(D)} \ 204 \qquad \textbf{(E)} \ 372 $

Let $N$ be the number of ways of choosing a subset of $5$ distinct numbers from the set $${10a+b:1\leq a\leq 5, 1\leq b\leq 5}$$ where $a,b$ are integers, such that no two of the selected numbers have the same units digits and no two have the same tens digit. What is the remainder when $N$ is divided by $73$?

Call a positive integer [i]monotonous[/i] if it is a one-digit number or its digits, when read from left to right, form either a strictly increasing or a strictly decreasing sequence. For example, 3, 23578, and 987620 are monotonous, but 88, 7434, and 23557 are not. How many monotonous positive integers are there? $\textbf{(A)} \text{ 1024} \qquad \textbf{(B)} \text{ 1524} \qquad \textbf{(C)} \text{ 1533} \qquad \textbf{(D)} \text{ 1536} \qquad \textbf{(E)} \text{ 2048}$

There are two distinguishable flagpoles, and there are $ 19$ flags, of which $ 10$ are identical blue flags, and $ 9$ are identical green flags. Let $ N$ be the number of distinguishable arrangements using all of the flags in which each flagpole has at least one flag and no two green flags on either pole are adjacent. Find the remainder when $ N$ is divided by $ 1000$.

2500 chess kings have to be placed on a $100 \times 100$ chessboard so that [b](i)[/b] no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex); [b](ii)[/b] each row and each column contains exactly 25 kings. Find the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.) [i]Proposed by Sergei Berlov, Russia[/i]

Given are $n$ different concentric circles on the plane.Inside the disk with the smallest radius (strictly inside it),we consider two distinct points $A,B$.We consider $k$ distinct lines passing through $A$ and $m$ distinct lines passing through $B$.There is no line passing through both $A$ and $B$ and all the lines passing through $k$ intersect with all the lines passing through $B$.The intersections do not lie on some of the circles.Determine the maximum and the minimum number of regions formed by the lines and the circles and are inside the circles.

For a positive integer $n$, an $n$-configuration is a family of sets $\left\langle A_{i,j}\right\rangle_{1\le i,j\le n}.$ An $n$-configuration is called [i]sweet[/i] if for every pair of indices $(i, j)$ with $1\le i\le n -1$ and $1\le j\le n$ we have $A_{i,j}\subseteq A_{i+1,j}$ and $A_{j,i}\subseteq A_{j,i+1}.$ Let $f(n, k)$ denote the number of sweet $n$-configurations such that $A_{n,n}\subseteq \{1, 2,\ldots , k\}$. Determine which number is larger: $f\left(2024, 2024^2\right)$ or $f\left(2024^2, 2024\right).$

In how many ways can $6$ juniors and $6$ seniors form $3$ disjoint teams of $4$ people so that each team has $2$ juniors and $2$ seniors? $ \textbf{(A) }720 \qquad \textbf{(B) }1350 \qquad \textbf{(C) }2700 \qquad \textbf{(D) }3280 \qquad \textbf{(E) }8100 \qquad $

Let $K_1, K_2, K_3, K_4, K_5$ be 5 distinguishable keys, and let $D_1, D_2, D_3, D_4, D_5$ be $5$ distinguishable doors. For $1 \leq i \leq 5$, key $K_i$ opens doors $D_{i}$ and $D_{i+1}$ (where $D_6 = D_1$) and can only be used once. The keys and doors are placed in some order along a hallway. Key\$ha walks into the hallway, picks a key and opens a door with it, such that she never obtains a key before all the doors in front of it are unlocked. In how many orders can the keys and doors be placed such that Key\$ha can open all of the doors? [i]Author: Mitchell Lee[/i] [hide="Clarifications"] [list=1][*]The doors and keys are in series. In other words, the doors aren't lined up along the side of the hallway. They are blocking Key\$ha's path to the end, and the only way she can get past them is by getting the appropriate keys along the hallway. [*]The doors and keys appear consecutively along the hallway. For example, she might find $K_1 D_1 K_2 D_2 K_3 D_3 K_4 D_4 K_5 D_5$ down the hallway in that order. Also, by "she never obtains a key before all the doors in front of it are unlocked," we mean that she cannot obtain a key before all the doors appearing before the key are unlocked. In essence, it merely states that locked doors cannot be passed. [*]The doors and keys do not need to alternate down the hallway.[/list][/hide]

Let $n$ be a positive integer. A sequence of $n$ positive integers (not necessarily distinct) is called [b]full[/b] if it satisfies the following condition: for each positive integer $k\geq2$, if the number $k$ appears in the sequence then so does the number $k-1$, and moreover the first occurrence of $k-1$ comes before the last occurrence of $k$. For each $n$, how many full sequences are there ?

Find all positive integers $ n$ for which the numbers in the set $ S \equal{} \{1,2, \ldots,n \}$ can be colored red and blue, with the following condition being satisfied: The set $ S \times S \times S$ contains exactly $ 2007$ ordered triples $ \left(x, y, z\right)$ such that: [b](i)[/b] the numbers $ x$, $ y$, $ z$ are of the same color, and [b](ii)[/b] the number $ x \plus{} y \plus{} z$ is divisible by $ n$. [i]Author: Gerhard Wöginger, Netherlands[/i]

Let $E$ be the set of $1983^3$ points of the space $\mathbb R^3$ all three of whose coordinates are integers between $0$ and $1982$ (including $0$ and $1982$). A coloring of $E$ is a map from $E$ to the set {red, blue}. How many colorings of $E$ are there satisfying the following property: The number of red vertices among the $8$ vertices of any right-angled parallelepiped is a multiple of $4$ ?

An urn contains balls of $k$ different colors; there are $n_i$ balls of $i-th$ color. Balls are selected at random from the urn, one by one, without replacement, until among the selected balls $m$ balls of the same color appear. Find the greatest number of selections.