Found problems: 85335
A $100\times 100$ chessboard is cut into dominoes ($1\times 2$ rectangles). Two persons play the following game: At each turn, a player glues together two adjacent cells (which were formerly separated by a cut-edge). A player loses if, after his turn, the $100\times 100$ chessboard becomes connected, i. e. between any two cells there exists a way which doesn't intersect any cut-edge. Which player has a winning strategy - the starting player or his opponent?
Twenty-four congruent squares are arranged as shown in the figure. In how many ways can we select $12$ of the squares so that no two are diagonally adjacent? Directly adjacent spaces are acceptable.
For any positive integer $n$ the sum $\displaystyle 1+\frac 12+ \cdots + \frac 1n$ is written in the form $\displaystyle \frac{P(n)}{Q(n)}$, where $P(n)$ and $Q(n)$ are relatively prime.
a) Prove that $P(67)$ is not divisible by 3;
b) Find all possible $n$, for which $P(n)$ is divisible by 3.
We are given a positive integer $n$ which is not a power of two. Show that ther exists a positive integer $m$ with the following two properties:
(a) $m$ is the product of two consecutive positive integers;
(b) the decimal representation of $m$ consists of two identical blocks with $n$ digits.
[i](4th Middle European Mathematical Olympiad, Team Competition, Problem 8)[/i]
Estimate the value of $e^f$ , where $f = e^e$ .
Let p be an odd prime, A be a non-empty subset of residue classes modulo p, $f:A\to\mathbb R$. Suppose that f is not constant and satisfies $f(x) \leq \frac{f(x + h) + f(x-h)}{2}$ whenever $x,x+h,x-h\in A$. Prove that $|A| \leq \frac{p + 1}{2}$.
Evaluate $$\sum^{\infty}_{k=0} \left( \frac{-1}{8}\right)^k {2k \choose k}$$
In the country of PUMaC-land, there are $5$ villages and $3$ cities. Vedant is building roads
between the $8$ settlements according to the following rules:
a) There is at most one road between any two settlements;
b) Any city has exactly three roads connected to it;
c) Any village has exactly one road connected to it;
d) Any two settlements are connected by a path of roads.
In how many ways can Vedant build the roads?
For any positive integer $ k$, let $ f_k$ be the number of elements in the set $ \{ k \plus{} 1, k \plus{} 2, \ldots, 2k\}$ whose base 2 representation contains exactly three 1s.
(a) Prove that for any positive integer $ m$, there exists at least one positive integer $ k$ such that $ f(k) \equal{} m$.
(b) Determine all positive integers $ m$ for which there exists [i]exactly one[/i] $ k$ with $ f(k) \equal{} m$.
A cat is tied to one corner of the base of a tower. The base forms an equilateral triangle of side length $4$ m, and the cat is tied with a leash of length $8$ m. Let $A$ be the area of the region accessible to the cat. If we write $A = \frac{m}{n} k - \sqrt{\ell}$, where $m,n, k, \ell$ are positive integers such that $m$ and $n$ are relatively prime, and $\ell$ is squarefree, what is the value of $m + n + k + \ell$ ?
Find all $k>0$ such that there exists a function $f : [0,1]\times[0,1] \to [0,1]$ satisfying the following conditions:
$f(f(x,y),z)=f(x,f(y,z))$;
$f(x,y) = f(y,x)$;
$f(x,1)=x$;
$f(zx,zy) = z^{k}f(x,y)$, for any $x,y,z \in [0,1]$
Consider the system of congruences $$\begin{cases} xy \equiv - 1 \,\, (mod z) \\ yz \equiv 1 \, \, (mod x) \\zx \equiv 1 \, \, (mod y)\end {cases}$$
Find the number of triples $(x,y, z) $ of distinct positive integers satisfying this system such that one of the numbers $x,y, z$ equals $19$.
$L(a)$ is the line connecting the points of the unit circle corresponding to the angles $a$ and $\pi - 2a$.
Prove that if $a + b + c = 2\pi$, then the lines $L (a), L (b)$ and $L (c)$ intersect at one point.
Express the number 1988 as the sum of some positive integers in such a way that the product of these positive integers is maximal.
Find all integral solutions to $x^y - y^x = 1$
A ball $K$ of radius $r$ is touched from the outside by mutually equal balls of radius $R$. Two of these balls are tangent to each other. Moreover, for two balls $K_1$ and $K_2$ tangent to $K$ and tangent to each other there exist two other balls tangent to $K_1,K_2$ and also to $K$. How many balls are tangent to $K$? For a given $r$ determine $R$.
Suppose that $ \sin a \plus{} \sin b \equal{} \sqrt {\frac {5}{3}}$ and $ \cos a \plus{} \cos b \equal{} 1.$ What is $ \cos(a \minus{} b)?$
$ \textbf{(A)}\ \sqrt {\frac {5}{3}} \minus{} 1 \qquad \textbf{(B)}\ \frac {1}{3}\qquad \textbf{(C)}\ \frac {1}{2}\qquad \textbf{(D)}\ \frac {2}{3}\qquad \textbf{(E)}\ 1$
In a tetrahedron, all three pairs of opposite (skew) edges are mutually perpendicular. Prove that the midpoints of the six edges of the tetrahedron lie on one sphere.
Arvin ate 11 halves of tarts, Bernice ate 12 quarters of tarts, Chrisandra ate 13 eighths of tarts, and Drake ate 14 sixteenths of tarts. How many tarts were eaten?
William is biking from his home to his school and back, using the same route. When he travels to school, there is an initial $20^\circ$ incline for $0.5$ kilometers, a flat area for $2$ kilometers, and a $20^\circ$ decline for $1$ kilometer. If William travels at $8$ kilometers per hour during uphill $20^\circ$ sections, $16$ kilometers per hours during flat sections, and $20$ kilometers per hour during downhill $20^\circ$ sections, find the closest integer to the number of minutes it take William to get to school and back.
[i]Proposed by William Yue[/i]
A circle touches the extensions of sides $CA$ and $CB$ of triangle $ABC$, and also touches side $AB$ of this triangle at point $P$. Prove that the radius of the circle tangent to segments $AP$, $CP$ and the circumscribed circle of this triangle is equal to the radius of the inscribed circle in this triangle.
Let $ABCD$ be a convex quadrilateral. We assume that there exists a point $P$ inside the quadrilateral such that
the areas of the triangles $ABP, BCP, CDP$, and $DAP$ are equal. Show that at least one of the diagonals of the
quadrilateral bisects the other diagonal.
Let $ (a_{n})_{n\ge 1}$ be a sequence of positive integers satisfying $ (a_{m},a_{n}) = a_{(m,n)}$ (for all $ m,n\in N^ +$). Prove that for any $ n\in N^ + ,\prod_{d|n}{a_{d}^{\mu (\frac {n}{d})}}$ is an integer. where $ d|n$ denotes $ d$ take all positive divisors of $ n.$ Function $ \mu (n)$ is defined as follows: if $ n$ can be divided by square of certain prime number, then $ \mu (1) = 1;\mu (n) = 0$; if $ n$ can be expressed as product of $ k$ different prime numbers, then $ \mu (n) = ( - 1)^k.$
[b]p1.[/b] A light beam shines from the origin into the unit square at an angle of $\theta$ to one of the sides such that $\tan \theta = \frac{13}{17}$ . The light beam is reflected by the sides of the square. How many times does the light beam hit a side of the square before hitting a vertex of the square?
[img]https://cdn.artofproblemsolving.com/attachments/5/7/1db0aad33ed9bf82bee3303c7fbbe0b7c2574f.png[/img]
[b]p2.[/b] Alex is given points $A_1,A_2,...,A_{150}$ in the plane such that no three are collinear and $A_1$, $A_2$, $...$, $A_{100}$ are the vertices of a convex polygon $P$ containing $A_{101}$, $A_{102}$, $ ...$, $A_{150}$ in its interior. He proceeds to draw edges $A_iA_j$ such that no two edges intersect (except possibly at their endpoints), eventually dividing $P$ up into triangles. How many triangles are there?
[img]https://cdn.artofproblemsolving.com/attachments/d/5/12c757077e87809837d16128b018895a8bcc94.png[/img]
[b]p3. [/b]The polynomial P(x) has the property that $P(1)$, $P(2)$, $P(3)$, $P(4)$, and $P(5)$ are equal to $1$, $2$, $3$, $4$,$5$ in some order. How many possibilities are there for the polynomial $P$, given that the degree of $P$ is strictly less than $4$?
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Calculate the sum of the series $\sum_{-\infty}^{\infty}\frac{\sin^33^k}{3^k}$.