Found problems: 85335
Given some $m\times n$ table, and some numbers in its fields. You are allowed to change the sign in one row or one column simultaneously. Prove that you can obtain a table, with nonnegative sums over each row and over each column.
Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.
Let $n$ be a positive integer. A 4-by-$n$ rectangle is divided into $4n$ unit squares in the usual way. Each unit square is colored black or white. Suppose that every white unit square shares an edge with at least one black unit square. Prove that there are at least $n$ black unit squares.
Find all functions $f:\mathbb{N}\to\mathbb{N}$ such that
$$|xf(y)-yf(x)|$$
is a perfect square for every $x,y \in \mathbb{N}$
We consider the set E of all fractions $\frac{1}{n}$, where $n$ is a natural number. A maximal arithmetic progression of length $k$ of the set E is an arithmetic progression of $k$ terms such that all its terms belong to the set E, and it is impossible to extend it to the right or to the left with another element of E.
For example, $\frac{1}{20}, \frac{1}{8}, \frac{1}{5}$, is an arithmetic progression in E of length $3$, and it is maximal, since to extend it towards to the right you have to add $\frac{11}{40}$, which does not belong to E, and to extend it to the left you have to add $\frac{-1}{40}$ which does not belong to E either.
Prove that for every integer $k> 2$, there exists a maximal arithmetic progression of length $k$ of the set E.
A rocket is launched and reaches $120$ m in height; in the fall he loses $60$ m, then it recovers $40$ m, loses $ 30 $ again, gains $24$, loses $20$, etc. If the process continues indefinitely, at what height does it tend to stabilize?
Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.
Points $E$ and $F$ are given on side $BC$ of convex quadrilateral $ABCD$ (with $E$ closer than $F$ to $B$). It is known that $\angle BAE = \angle CDF$ and $\angle EAF = \angle FDE$. Prove that $\angle FAC = \angle EDB$.
[i]M. Smurov[/i]
There are fi ve distinct real positive numbers. It is known that the total sum of their squares and the total sum of their pairwise products are equal.
(a) Prove that we can choose three numbers such that it would not be possible to make a triangle with sides' lengths equal to these numbers.
(b) Prove that the number of such triples is at least six (triples which consist of the same numbers in different order are considered the same).
Let $M$ be a closed, orientable $3$-dimensional differentiable manifold, and let $G$ be a finite group of orientation preserving diffeomorphisms of $M$. Let $P$ and $Q$ denote the set of those points of $M$ whose stabilizer is nontrivial (that is, contains a nonidentity element of $G$) and noncyclic, respectively. Let $\chi (P)$ denote the Euler characteristic of $P$. Prove that the order of $G$ divides $\chi (P)$, and $Q$ is the union of $-2\frac{\chi(P)}{|G|}$ orbits of $G$.
Let $G$ be a group such that every subgroup of $G$ is subnormal. Suppose that there exists $N$ normal subgroup of $G$ such that $Z(N)$ is nontrivial and $G/N$ is cyclic. Prove that $Z(G)$ is nontrivial. ($Z(G)$ denotes the center of $G$).
[b]Note[/b]: A subgroup $H$ of $G$ is subnormal if there exist subgroups $H_1,H_2,\ldots,H_m=G$ of $G$ such that $H\lhd H_1\lhd H_2 \lhd \ldots \lhd H_m= G$ ($\lhd$ denotes normal subgroup).
In a country every 2 cities are connected either by a direct bus route or a direct plane flight. A $clique$ is a set of cities such that every 2 cities in the set are connected by a direct flight. A $cluque$ is a set of cities such that every 2 cities in the set are connected by a direct flight, and every 2 cities in the set are connected to the same number of cities by a bus route. A $claque$ is a set of cities such that every 2 cities in the set are connected by a direct flight, and every 2 numbers of bus routes from a city in the set are different. Prove that the number of cities of any clique is at most the product of the biggest possible number of cities in a cluque and the the biggest possible number of cities in a claque.
Tuymaada 2017 Q3 Juniors
Alice, Bob, and Charlie are each thinking of a number. Alice's number differs from Bob's number by $2$. Bob's number differs from Charlie's number by $6$. Charlie's number differs from Alice's number by $N$. What is the sum of all possible values for $N$?
$\textbf{(A) }4\qquad\textbf{(B) }6\qquad\textbf{(C) }7\qquad\textbf{(D) }12\qquad\textbf{(E) }14$
Prove that given three positive numbers, we can choose two of them, say $x$ and $y,$ with $x >y$ such that $$\frac{x-y}{1 +xy }<1.$$ Prove also that if the number $1$ that appears in the second member of the previous inequality is replaced by a lower number, even if very close to $1$, the previous proposition is false.
The Matini company released a special album with the flags of the $ 12$ countries that compete in the CONCACAM Mathematics Cup. Each postcard envelope has two flags chosen randomly. Determine the minimum number of envelopes that need to be opened to that the probability of having a repeated flag is $50\%$.
In how many ways can the king in the chessboard reach the eighth rank in $7$ moves from its original square on the first row?
Let $x$ and $y$ be integers. Prove that one of the expressions $$2x+3y \text{ and } 9x+5y$$ is divisible by $17$ if and only if so is the other.
Find all pairs of positive integers $(n,t)$ such that $6^n+1=n^2t$, and $(n,29 \times 197)=1$
The point $H$ is the orthocentre of a triangle $ABC$, and the segments $AD,BE,CF$ are its altitudes. The points $I_1,I_2,I_3$ are the incentres of the triangles $EHF,FHD,DHE$ respectively. Prove that the lines $AI_1,BI_2,CI_3$ intersect at a single point.
Prove that among any $43$ positive integers there exist two $a$ and $b$ such that $a^2 - b^2$ is divisible by $100$.
We say a natural number $n$ is perfect if the sum of all the positive divisors of $n$ is equal to $2n$. For example, $6$ is perfect since its positive divisors $1,2,3,6$ add up to $12=2\times 6$. Show that an odd perfect number has at least $3$ distinct prime divisors.
[i]Note: It is still not known whether odd perfect numbers exist. So assume such a number is there and prove the result.[/i]
The diagonals of the trapezoid $ABCD$ are perpendicular ($AD//BC, AD>BC$) . Point $M$ is the midpoint of the side of $AB$, the point $N$ is symmetric of the center of the circumscribed circle of the triangle $ABD$ wrt $AD$. Prove that $\angle CMN = 90^o$.
(A. Mudgal, India)
There are $30$ men with their $30$ wives sitting at a round table. Show that there always exist two men who are on the same distance from their wives. (The seats are arranged at vertices of a regular polygon.)
Fix a positive integer $n\geq 3$. Does there exist infinitely many sets $S$ of positive integers $\lbrace a_1,a_2,\ldots, a_n$, $b_1,b_2,\ldots,b_n\rbrace$, such that $\gcd (a_1,a_2,\ldots, a_n$, $b_1,b_2,\ldots,b_n)=1$, $\lbrace a_i\rbrace _{i=1}^n$, $\lbrace b_i\rbrace _{i=1}^n$ are arithmetic progressions, and $\prod_{i=1}^n a_i = \prod_{i=1}^n b_i$?
A dartboard is the region B in the coordinate plane consisting of points $(x, y)$ such that $|x| + |y| \le 8$. A target T is the region where $(x^2 + y^2 - 25)^2 \le 49$. A dart is thrown at a random point in B. The probability that the dart lands in T can be expressed as $\frac{m}{n} \pi$, where $m$ and $n$ are relatively prime positive integers. What is $m + n$?
$
\textbf{(A) }39 \qquad
\textbf{(B) }71 \qquad
\textbf{(C) }73 \qquad
\textbf{(D) }75 \qquad
\textbf{(E) }135 \qquad
$