This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 85335

Let $G$ be a group and $A$ a nonempty subset of $G$. Let $AA=\{xy\mid x,y\in A\}$. [list=a] [*] Prove that if $G$ is finite, then $AA=A$ if and only if $|A|=|AA|$ and $e\in A$. [*] Give an example of a group $G$ and a nonempty subset $A$ of $G$ such that $AA\neq A$, $|AA|=|A|$ and $AA$ is a proper subgroup of $G$. [/list] [i]Mathematical Gazette - Robert Rogozsan[/i]
Suppose that $a$ and $ b$ are distinct positive integers satisfying $20a + 17b = p$ and $17a + 20b = q$ for certain primes $p$ and $ q$. Determine the minimum value of $p + q$.
Given a $15\times 15$ chessboard. We draw a closed broken line without self-intersections such that every edge of the broken line is a segment joining the centers of two adjacent cells of the chessboard. If this broken line is symmetric with respect to a diagonal of the chessboard, then show that the length of the broken line is $\leq 200$.
Define a function $w:\mathbb{Z}\times\mathbb{Z}\to\mathbb{Z}$ as follows. For $|a|,|b|\le 2,$ let $w(a,b)$ be as in the table shown; otherwise, let $w(a,b)=0.$ \[\begin{array}{|lr|rrrrr|}\hline &&&&b&&\\ &w(a,b)&-2&-1&0&1&2\\ \hline &-2&-1&-2&2&-2&-1\\ &-1&-2&4&-4&4&-2\\ a&0&2&-4&12&-4&2\\ &1&-2&4&-4&4&-2\\ &2&-1&-2&2&-2&-1\\ \hline\end{array}\] For every finite subset $S$ of $\mathbb{Z}\times\mathbb{Z},$ define \[A(S)=\sum_{(\mathbf{s},\mathbf{s'})\in S\times S} w(\mathbf{s}-\mathbf{s'}).\] Prove that if $S$ is any finite nonempty subset of $\mathbb{Z}\times\mathbb{Z},$ then $A(S)>0.$ (For example, if $S=\{(0,1),(0,2),(2,0),(3,1)\},$ then the terms in $A(S)$ are $12,12,12,12,4,4,0,0,0,0,-1,-1,-2,-2,-4,-4.$)
A monic quadratic polynomial $f$ with integer coefficients attains prime values at three consecutive integer points.show that it attains a prime value at some other integer point as well.
Let $A'$ be a point on one of the sides of the trapezoid $ABCD$ such that line $AA'$ divides the area of the trapezoid in half. Points $B'$, $C'$, $D'$ are defined similarly. Prove that the intersection points of the diagonals of quadrilaterals $ABCD$ and $A'B'C'D'$ are symmetrical wrt the midpoint of midline of trapezoid $ABCD$.
Let $ABC$ be a isosceles triangle, with $AB=AC$. A line $r$ that pass through the incenter $I$ of $ABC$ touches the sides $AB$ and $AC$ at the points $D$ and $E$, respectively. Let $F$ and $G$ be points on $BC$ such that $BF=CE$ and $CG=BD$. Show that the angle $\angle FIG$ is constant when we vary the line $r$.
The flag of the United Nations consists of a polar map of the world, with the North Pole as its center, extending to approximately $45^\circ$ South Latitude. The parallels of latitude are concentric circles with radii proportional to their co-latitudes. Australia is near the periphery of the map and is intersected by the parallel of latitude $30^\circ$ S.In the very close vicinity of this parallel how much are East and West distances exaggerated as compared to North and South distances?
Find all functions $g:R\rightarrow R$ for which there exists a strictly increasing function $ f:R\rightarrow R $ such that $f(x+y)=f(x)g(y)+f(y)$ $\forall x,y \in R$.
Each vertex of a regular $1997$-gon is labeled with an integer, so that the sum of the integers is $1$. We write down the sums of the first $k$ integers read counterclockwise, starting from some vertex $(k=1,2,\ldots,1997)$. Can we always choose the starting vertex so that all these sums are positive? If yes, how many possible choices are there?
From an initial triangle $\Delta A_0B_0C_0$, a sequence of triangles $\Delta A_1B_1C_1$, $A_2B_2C_2$, ... is formed such that, at each stage, $A_{k + 1}$, $B_{k + 1}$ and $C_{k + 1}$ are the points where the incircle of $\Delta A_kB_kC_k$ touches the sides $B_kC_k$, $C_kA_k$ and $A_kB_k$ respectively. (a) Express $\angle A_{k + 1}B_{k + 1}C_{k + 1}$ in terms of $\angle A_kB_kC_k$. (b) Deduce that, as $k$ increases, $\angle A_kB_kC_k$ tends to $60^{\circ}$.
Four boys and four girls each bring one gift to a Christmas gift exchange. On a sheet of paper, each boy randomly writes down the name of one girl, and each girl randomly writes down the name of one boy. At the same time, each person passes their gift to the person whose name is written on their sheet. Determine the probability that [i]both[/i] of these events occur: [list] [*] (i) Each person receives exactly one gift; [*] (ii) No two people exchanged presents with each other (i.e., if $A$ gave his gift to $B$, then $B$ did not give her gift to $A$).[/list]
For any given real $a, b, c$ solve the following system of equations: $$\left\{\begin{array}{l}ax^3+by=cz^5,\\az^3+bx=cy^5,\\ay^3+bz=cx^5.\end{array}\right.$$ [i]Proposed by Oleksiy Masalitin, Bogdan Rublov[/i]
Given a triangle $ABC$ for which $C=90$ degrees, prove that given $n$ points inside it, we can name them $P_1, P_2 , \ldots , P_n$ in some way such that: $\sum^{n-1}_{k=1} \left( P_K P_{k+1} \right)^2 \leq AB^2$ (the sum is over the consecutive square of the segments from $1$ up to $n-1$). [i]Edited by orl.[/i]
Find all positive integers $n$ such that $A=2^{n+2}(2^n-1)-8\cdot 3^n +1$ is a perfect square.
This problem is generalization of [url=http://www.mathlinks.ro/Forum/viewtopic.php?t=5918]this one[/url]. Suppose $G$ is a graph and $S\subset V(G)$. Suppose we have arbitrarily assign real numbers to each element of $S$. Prove that we can assign numbers to each vertex in $G\backslash S$ that for each $v\in G\backslash S$ number assigned to $v$ is average of its neighbors.
Let $N_{10}$ be the answer to problem 10. Compute the number of ordered pairs of integers $(m,n)$ that satisfy the equation \[ m^2+n^2=mn+N_{10}. \]
Let $p$ be an odd prime number. Let $S=a_1,a_2,\dots$ be the sequence defined as follows: $a_1=1,a_2=2,\dots,a_{p-1}=p-1$, and for $n\ge p$, $a_n$ is the smallest integer greater than $a_{n-1}$ such that in $a_1,a_2,\dots,a_n$ there are no arithmetic progressions of length $p$. We say that a positive integer is a [i]ghost[/i] if it doesn’t appear in $S$. What is the smallest ghost that is not a multiple of $p$? [i]Proposed by Guerrero[/i]
Let $k$ be a real number. Show that the polynomial $p (x) = x^3-24x + k$ has at most an integer root.
Let $\mathbb{N}$ and $\mathbb{N}^*$ be the sets containing the natural numbers/positive integers respectively. We define a binary relation on $\mathbb{N}$ by $a\acute{\in}b$ iff the $a$-th bit in the binary representation of $b$ is $1$. We define a binary relation on $\mathbb{N}^*$ by $a\tilde{\in}b$ iff $b$ is a multiple of the $a$-th prime number $p_a$. i) Prove that there is no bijection $f:\mathbb{N}\to \mathbb{N}^*$ such that $a\acute{\in}b\Leftrightarrow f(a)\tilde{\in}f(b)$. ii) Prove that there is a bijection $g:\mathbb{N}\to \mathbb{N}^*$ such that $(a\acute{\in}b \vee b\acute{\in}a)\Leftrightarrow (g(a)\tilde{\in}g(b) \vee g(b)\tilde{\in}g(a))$.
An escalator (moving staircase) of $ n$ uniform steps visible at all times descends at constant speed. Two boys, $ A$ and $ Z$, walk down the escalator steadily as it moves, $ A$ negotiating twice as many escalator steps per minute as $ Z$. $ A$ reaches the bottom after taking $ 27$ steps while $ Z$ reaches the bottom after taking $ 18$ steps. Then $ n$ is: $ \textbf{(A)}\ 63 \qquad \textbf{(B)}\ 54 \qquad \textbf{(C)}\ 45 \qquad \textbf{(D)}\ 36 \qquad \textbf{(E)}\ 30$
Let $s$ be the circumcircle of triangle $ABC, L$ and $W$ be common points of angle's $A$ bisector with side $BC$ and $s$ respectively, $O$ be the circumcenter of triangle $ACL$. Restore triangle $ABC$, if circle $s$ and points $W$ and $O$ are given. (D.Prokopenko)
A positive integer is called a [b]double number[/b] if its decimal representation consists of a block of digits, not commencing with 0, followed immediately by an identical block. So, for instance, 360360 is a double number, but 36036 is not. Show that there are infinitely many double numbers which are perfect squares.
For a fixed $k$ with $4 \le k \le 9$ consider the set of all positive integers with $k$ decimal digits such that each of the digits from $1$ to $k$ occurs exactly once. Show that it is possible to partition this set into two disjoint subsets such that the sum of the cubes of the numbers in the first set is equal to the sum of the cubes in the second set.
Let $ABCD$ be a quadrilateral $\angle B = \angle D$ and $AD = CD$. The incircle of triangle $ABC$ touches the sides $BC$ and $AB$ at points $E$ and $F$ respectively. Prove that the midpoints of segments $AC, BD, AE,$ and $CF$ are concyclic.