Found problems: 85335
A series of figures is shown in the picture below, each one of them created by following a secret rule. If the leftmost figure is considered the first figure, how many squares will the 21st figure have?
[img]http://www.artofproblemsolving.com/Forum/download/file.php?id=49934[/img]
Note: only the little squares are to be counted (i.e., the $2 \times 2$ squares, $3 \times 3$ squares, $\dots$ should not be counted)
Extra (not part of the original problem): How many squares will the 21st figure have, if we consider all $1 \times 1$ squares, all $2 \times 2$ squares, all $3 \times 3$ squares, and so on?.
Let $n$ and $k$ be two integers with $n>k\geqslant 1$. There are $2n+1$ students standing in a circle. Each student $S$ has $2k$ [i]neighbors[/i] - namely, the $k$ students closest to $S$ on the left, and the $k$ students closest to $S$ on the right.
Suppose that $n+1$ of the students are girls, and the other $n$ are boys. Prove that there is a girl with at least $k$ girls among her neighbors.
[i]Proposed by Gurgen Asatryan, Armenia[/i]
Suppose $a$ is a complex number such that
\[a^2+a+\frac{1}{a}+\frac{1}{a^2}+1=0\]
If $m$ is a positive integer, find the value of
\[a^{2m}+a^m+\frac{1}{a^m}+\frac{1}{a^{2m}}\]
Let $n>1$ be an integer. Suppose we are given $2n$ points in the plane such that no three of them are collinear. The points are to be labelled $A_1, A_2, \dots , A_{2n}$ in some order. We then consider the $2n$ angles $\angle A_1A_2A_3, \angle A_2A_3A_4, \dots , \angle A_{2n-2}A_{2n-1}A_{2n}, \angle A_{2n-1}A_{2n}A_1, \angle A_{2n}A_1A_2$. We measure each angle in the way that gives the smallest positive value (i.e. between $0^{\circ}$ and $180^{\circ}$). Prove that there exists an ordering of the given points such that the resulting $2n$ angles can be separated into two groups with the sum of one group of angles equal to the sum of the other group.
In the convex quadrilateral $ABCD$ we have that $\angle BCD = \angle ADC \ge 90 ^o$. The bisectors of $\angle BAD$ and $\angle ABC$ intersect in $M$. Prove that if $M \in CD$, then $M$ is the middle of $CD$.
In an acute-angled triangle $\triangle ABC$, construct $\triangle ACD$ and $\triangle BCE$ externally on sides $CA$ and $CB$ respectively, such that $AD=CD$. Let $M$ be the midpoint of $AB$, and connect $DM$ and $EM$. Given that $DM$ is perpendicular to $EM$, set $\frac{AC}{BC} =u$ and $\frac{DM}{EM}=v$. Express $\frac{DC}{EC}$ in terms of $u$ and $v$.
Consider a triangle such that \[\sin^2\alpha+\sin^2\beta+\sin^2\gamma=2.\] Show that the triangle is right.
Determine all positive integers $n$ with the property that $n = (d(n))^2$. Here $d(n)$ denotes the number of positive divisors of $n$.
Let $S$ be a subset with $673$ elements of the set $\{1,2,\ldots ,2010\}$. Prove that one can find two distinct elements of $S$, say $a$ and $b$, such that $6$ divides $a+b$.
Given a right triangle $T$, where the coordinates of its vertices are integers, let $E$ be the number of points of integer coordinates that belong to the edge of the triangle $T$, $I$ the number of points of integer coordinates that belong to the interior of the triangle $T$. Show that the area $A(T)$ of triangle $T$ is given by: $A(T) = \frac{E}{2}+I -1$.
Call an odd prime $p$ [i]adjective[/i] if there exists an infinite sequence $a_0,a_1,a_2,\ldots$ of positive integers such that \[a_0\equiv1+\frac{1}{a_1}\equiv1+\frac{1}{1+\frac{1}{a_2}}\equiv1+\frac{1}{1+\frac{1}{1+\frac{1}{a_3}}}\equiv\ldots\pmod p.\] What is the sum of the first three odd primes that are [i]not[/i] adjective?
Note: For two common fractions $\frac{a}{b}$ and $\frac{c}{d}$, we say that $\frac{a}{b}\equiv\frac{c}{d}\pmod p$ if $p$ divides $ad-bc$ and $p$ does not divide $bd$.
[i]2019 CCA Math Bonanza Individual Round #14[/i]
In a triangle $ABC$, points $D$ and $E$ are on segments $BC$ and $AC$ such that $BD=3DC$ and $AE=4EC$. Point $P$ is on line $ED$ such that $D$ is the midpoint of segment $EP$. Lines $AP$ and $BC$ intersect at point $S$. Find the ratio $BS/SD$.
Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.
A positive integer $n$ is "[i]olympic[/i]" if there are $n$ non-negative integers $x_1, x_2, ..., x_n$ that satisfy that:
$\bullet$ There is at least one positive integer $j$: $1 \le j \le n$ such that $x_j \ne 0$.
$\bullet$ For any way of choosing $n$ numbers $c_1, c_2, ..., c_n$ from the set $\{-1, 0, 1\}$, where not all $c_i$ are equal to zero, it is true that the sum $c_1x_1 + c_2x_2 +... + c_nx_n$ is not divisible by $n^3$.
Find the largest positive "olympic" integer.
Integer numbers $x, y, z$ satisfy the equation
\[ x^3 + y^3 = z^3.\]
Prove that at least one of them is divisible by $3$.
Let $P(x)$ be a polynomial with integer coefficients. Prove that the polynomial $Q(x) = P(x^4)P(x^3)P(x^2)P(x)+1$ has no integer roots.
Let $n$ be a positive integer. Prove that if the number overbrace $\underbrace{\hbox{99...9}}_{\hbox{n}}$ is divisible by $n$, then the number $\underbrace{\hbox{11...1}}_{\hbox{n}}$ is also divisible by $n$.
(H. Nestra)
Allowing $x$ to be a real number, what is the largest value that can be obtained by the function $25\sin(4x)-60\cos(4x)?$
Find the sum of all positive integers $n\le 2024$ such that all pairs of distinct positive integers $(a,b)$ that satisfy $ab=n$ have a sum that is a perfect square.
Let $ k$ be a positive integer. Set $ A \subseteq \mathbb{Z}$ is called a $ \textbf{k \minus{} set}$ if there exists $ x_1, x_2, \cdots, x_k \in \mathbb{Z}$ such that for any $ i \neq j$, $ (x_i \plus{} A) \cap (x_j \plus{} A) \equal{} \emptyset$, where $ x \plus{} A \equal{} \{ x \plus{} a \mid a \in A \}$. Prove that if $ A_i$ is $ \textbf{k}_i\textbf{ \minus{} set}$($ i \equal{} 1,2, \cdots, t$), and $ A_1 \cup A_2 \cup \cdots \cup A_t \equal{} \mathbb{Z}$, then $ \displaystyle \frac {1}{k_1} \plus{} \frac {1}{k_2} \plus{} \cdots \plus{} \frac {1}{k_t} \geq 1$.
Define the function $ g(\cdot): \mathbb{Z} \to \{0,1\}$ such that $ g(n) \equal{} 0$ if $ n < 0$, and $ g(n) \equal{} 1$ otherwise. Define the function $ f(\cdot): \mathbb{Z} \to \mathbb{Z}$ such that $ f(n) \equal{} n \minus{} 1024g(n \minus{} 1024)$ for all $ n \in \mathbb{Z}$. Define also the sequence of integers $ \{a_i\}_{i \in \mathbb{N}}$ such that $ a_0 \equal{} 1$ e $ a_{n \plus{} 1} \equal{} 2f(a_n) \plus{} \ell$, where $ \ell \equal{} 0$ if $ \displaystyle \prod_{i \equal{} 0}^n{\left(2f(a_n) \plus{} 1 \minus{} a_i\right)} \equal{} 0$, and $ \ell \equal{} 1$ otherwise. How many distinct elements are in the set $ S: \equal{} \{a_0,a_1,\ldots,a_{2009}\}$?
[i](Paolo Leonetti)[/i]
A restricted rook (RR) is a fictional chess piece that can move horizontally or vertically (like a rook), except that each move is restricted to a neighboring square (cell). If RR can only (with at most one exception) move up and to the right, how many possible distinct paths are there to move RR from the bottom left square to the top right square of a standard 8-by-8 chess board? Note that RR may visit some squares more than once. A path is the sequence of squares visited by RR on its way.
The number halfway between $\dfrac{1}{6}$ and $\dfrac{1}{4}$ is
$\text{(A)}\ \dfrac{1}{10} \qquad \text{(B)}\ \dfrac{1}{5} \qquad \text{(C)}\ \dfrac{5}{24} \qquad \text{(D)}\ \dfrac{7}{24} \qquad \text{(E)}\ \dfrac{5}{12}$
Several blue and green rectangular napkins (perhaps of different sizes) with vertical and horizontal sides were placed on the plane. It turned out that any two napkins of different colors can be crossed by a vertical or horizontal line (perhaps along the border). Prove that it is possible to choose a color, two horizontal lines and one vertical line, so that each napkin of the chosen color is intersected by at least one of the chosen lines.
Prove that for any positive integers $x, y, z$ with $xy-z^2 = 1$ one can find non-negative integers $a, b, c, d$ such that $x = a^2 + b^2, y = c^2 + d^2, z = ac + bd$.
Set $z = (2q)!$ to deduce that for any prime number $p = 4q + 1$, $p$ can be represented as the sum of squares of two integers.