Found problems: 133
Find all positive integers $n$ such that the set $\{n,n+1,n+2,n+3,n+4,n+5\}$ can be partitioned into two subsets so that the product of the numbers in each subset is equal.
Consider $A = \{1, 2, ..., 16\}$. A partition of $A$ into nonempty sets $A_1, A_2,..., A_n$ is said to be good if none of the Ai contains elements $a, b, c$ (not necessarily distinct) such that $a = b + c$.
(a) Find a good partition $\{A_1, A_2, A_3, A_4\}$ of $A$.
(b) Prove that no partition $\{A_1, A_2, A_3\}$ of $A$ is good
Let be a bipartition of the set formed by the first $ 13 $ nonnegative numbers. Prove that at least one of these two subsets that form this partition contains an arithmetic progression.
Given a set $S$, of integers, an [i]optimal partition[/i] of S into sets T, U is a partition which minimizes the value $|t - u|$, where $t$ and $u$ are the sum of the elements of $T$ and U respectively.
Let $P$ be a set of distinct positive integers such that the sum of the elements of $P$ is $2k$ for a positive integer $k$, and no subset of $P$ sums to $k$.
Either show that there exists such a $P$ with at least $2020$ different optimal partitions, or show that such a $P$ does not exist.
Let $ A_n $ be the set of partitions of the sequence $ 1,2,..., n $ into several subsequences such that every two neighbouring terms of each subsequence have different parity,and $ B_n $ the set of partitions of the sequence $ 1,2,..., n $ into several subsequences such that all the terms of each subsequence have the same parity ( for example,the partition $ {(1,4,5,8),(2,3),(6,9),(7)} $ is an element of $ A_9 $,and the partition $ {(1,3,5),(2,4),(6)} $ is an element of $ B_6 $ ).
Prove that for every positive integer $ n $ the sets $ A_n $ and $ B_{n+1} $ contain the same number of elements.
Let $n_1, n_2$ be positive integers. Consider in a plane $E$ two disjoint sets of points $M_1$ and $M_2$ consisting of $2n_1$ and $2n_2$ points, respectively, and such that no three points of the union $M_1 \cup M_2$ are collinear. Prove that there exists a straightline $g$ with the following property: Each of the two half-planes determined by $g$ on $E$ ($g$ not being included in either) contains exactly half of the points of $M_1$ and exactly half of the points of $M_2.$
The positive integers are partitioned into two infinite sets so that the sum of any $2023$ distinct integers in one set is also in that set. Prove that one set contains all the odd positive integers, and one set contains all the even positive integers.
[i]Proposed by Evan Chang (squareman), USA[/i]
A cube is partitioned into finitely many rectangular parallelepipeds with the edges parallel to the edges of the cube. Prove that if the sum of the volumes of the circumspheres of these parallelepipeds equals the volume of the circumscribed sphere of the cube, then all the parallelepipeds are cubes.
Let $ A_0 \equal{} (a_1,\dots,a_n)$ be a finite sequence of real numbers. For each $ k\geq 0$, from the sequence $ A_k \equal{} (x_1,\dots,x_k)$ we construct a new sequence $ A_{k \plus{} 1}$ in the following way.
1. We choose a partition $ \{1,\dots,n\} \equal{} I\cup J$, where $ I$ and $ J$ are two disjoint sets, such that the expression
\[ \left|\sum_{i\in I}x_i \minus{} \sum_{j\in J}x_j\right|
\]
attains the smallest value. (We allow $ I$ or $ J$ to be empty; in this case the corresponding sum is 0.) If there are several such partitions, one is chosen arbitrarily.
2. We set $ A_{k \plus{} 1} \equal{} (y_1,\dots,y_n)$ where $ y_i \equal{} x_i \plus{} 1$ if $ i\in I$, and $ y_i \equal{} x_i \minus{} 1$ if $ i\in J$.
Prove that for some $ k$, the sequence $ A_k$ contains an element $ x$ such that $ |x|\geq\frac n2$.
[i]Author: Omid Hatami, Iran[/i]
Is it possible to divide the integers from $1$ to $100$ inclusive into $50$ pairs such that for $1\le k\le 50$, the difference between the two numbers in the $k$-th pair is $k$?
(V Proizvolov)
Let $n \geq 2$ be an integer. Find the minimum $k$ for which there exists a partition of $\{1, 2, . . . , k\}$ into $n$ subsets $X_1,X_2, \cdots , X_n$ such that the following condition holds:
for any $i, j, 1 \leq i < j \leq n$, there exist $x_i \in X_1, x_j \in X_2$ such that $|x_i - x_j | = 1.$
Prove that the set of positive integers cannot be partitioned into three nonempty subsets such that, for any two integers $x,y$ taken from two different subsets, the number $x^2-xy+y^2$ belongs to the third subset.
Determine for which positive integers $ k$ the set \[ X \equal{} \{1990, 1990 \plus{} 1, 1990 \plus{} 2, \ldots, 1990 \plus{} k\}\] can be partitioned into two disjoint subsets $ A$ and $ B$ such that the sum of the elements of $ A$ is equal to the sum of the elements of $ B.$
Let $n$ be a positive integer, and let $A$ be a subset of $\{ 1,\cdots ,n\}$. An $A$-partition of $n$ into $k$ parts is a representation of n as a sum $n = a_1 + \cdots + a_k$, where the parts $a_1 , \cdots , a_k $ belong to $A$ and are not necessarily distinct. The number of different parts in such a partition is the number of (distinct) elements in the set $\{ a_1 , a_2 , \cdots , a_k \} $.
We say that an $A$-partition of $n$ into $k$ parts is optimal if there is no $A$-partition of $n$ into $r$ parts with $r<k$. Prove that any optimal $A$-partition of $n$ contains at most $\sqrt[3]{6n}$ different parts.
Givan the set $S = \{1,2,3,....,n\}$. We want to partition the set $S$ into three subsets $A,B,C$ disjoint (to each other) with $A\cup B\cup C=S$ , such that the sums of their elements $S_{A} S_{B} S_{C}$ to be equal .Examine if this is possible when:
a) $n=2014$
b) $n=2015 $
c) $n=2018$
In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that
[list]
[*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and
[*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color.
[/list]
a) Show that the set $ \mathbb{Q}^{ + }$ of all positive rationals can be partitioned into three disjoint subsets. $ A,B,C$ satisfying the following conditions:
\[ BA = B; \& B^2 = C; \& BC = A;
\]
where $ HK$ stands for the set $ \{hk: h \in H, k \in K\}$ for any two subsets $ H, K$ of $ \mathbb{Q}^{ + }$ and $ H^2$ stands for $ HH.$
b) Show that all positive rational cubes are in $ A$ for such a partition of $ \mathbb{Q}^{ + }.$
c) Find such a partition $ \mathbb{Q}^{ + } = A \cup B \cup C$ with the property that for no positive integer $ n \leq 34,$ both $ n$ and $ n + 1$ are in $ A,$ that is,
\[ \text{min} \{n \in \mathbb{N}: n \in A, n + 1 \in A \} > 34.
\]
In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that
[list]
[*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and
[*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color.
[/list]
Anton has an isosceles right triangle, which he wants to cut into $9$ triangular parts in the way shown in the picture. What is the largest number of the resulting $9$ parts that can be equilateral triangles?
A more formal description of partitioning. Let triangle $ABC$ be given. We choose two points on its sides so that they go in the order $AC_1C_2BA_1A_2CB_1B_2$, and no two coincide. In addition, the segments $C_1A_2$, $A_1B_2$ and $B_1C_2$ must intersect at one point. Then the partition is given by segments $C_1A_2$, $A_1B_2$, $B_1C_2$, $A_1C_2$, $B_1A_2$ and $C_1B_2$.
[img]https://cdn.artofproblemsolving.com/attachments/0/5/5dd914b987983216342e23460954d46755d351.png[/img]
Does there exist an integer $ n > 1$ which satisfies the following condition? The set of positive integers can be partitioned into $ n$ nonempty subsets, such that an arbitrary sum of $ n \minus{} 1$ integers, one taken from each of any $ n \minus{} 1$ of the subsets, lies in the remaining subset.
Let $N$ be a positive integer. It is given set of weights which satisfies following conditions:
$i)$ Every weight from set has some weight from $1,2,...,N$;
$ii)$ For every $i\in {1,2,...,N}$ in given set there exists weight $i$;
$iii)$ Sum of all weights from given set is even positive integer.
Prove that set can be partitioned into two disjoint sets which have equal weight
Let P be a set of 4n points in the plane such that none of the three points are collinear. Prove that if n is large enough, then the following two statements are equivalent.
(i) P can be divided into n four-element subsets such that each subset forms the vertices of a convex quadrilateral.
(ii) P can not be split into two sets A and B, each with an odd number of elements, so that each convex quadrilateral whose vertices are in P has an even number of vertices in A and B.
$(HUN 3)$ In the plane $4000$ points are given such that each line passes through at most $2$ of these points. Prove that there exist $1000$ disjoint quadrilaterals in the plane with vertices at these points.
We call an even positive integer $n$ [i]nice[/i] if the set $\{1, 2, \dots, n\}$ can be partitioned into $\frac{n}{2}$ two-element subsets, such that the sum of the elements in each subset is a power of $3$. For example, $6$ is nice, because the set $\{1, 2, 3, 4, 5, 6\}$ can be partitioned into subsets $\{1, 2\}$, $\{3, 6\}$, $\{4, 5\}$. Find the number of nice positive integers which are smaller than $3^{2022}$.
Let $N$ be a positive integer, and consider an $N \times N$ grid. A [i]right-down path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell below the previous cell in the sequence. A [i]right-up path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell above the previous cell in the sequence.
Prove that the cells of the $N \times N$ grid cannot be partitioned into less than $N$ right-down or right-up paths. For example, the following partition of the $5 \times 5$ grid uses $5$ paths.
[asy]
size(4cm);
draw((5,-1)--(0,-1)--(0,-2)--(5,-2)--(5,-3)--(0,-3)--(0,-4)--(5,-4),gray+linewidth(0.5)+miterjoin);
draw((1,-5)--(1,0)--(2,0)--(2,-5)--(3,-5)--(3,0)--(4,0)--(4,-5),gray+linewidth(0.5)+miterjoin);
draw((0,0)--(5,0)--(5,-5)--(0,-5)--cycle,black+linewidth(2.5)+miterjoin);
draw((0,-1)--(3,-1)--(3,-2)--(1,-2)--(1,-4)--(4,-4)--(4,-3)--(2,-3)--(2,-2),black+linewidth(2.5)+miterjoin);
draw((3,0)--(3,-1),black+linewidth(2.5)+miterjoin);
draw((1,-4)--(1,-5),black+linewidth(2.5)+miterjoin);
draw((4,-3)--(4,-1)--(5,-1),black+linewidth(2.5)+miterjoin);
[/asy]
[i]Proposed by Zixiang Zhou, Canada[/i]