Found problems: 85335
Let be a natural number $ n\ge 3 $ and a number $ \alpha $ from the interval $ (0,1). $
Find all $ \text{n-tuples} $ of real numbers $ \left( x_0,x_1,x_2,\ldots, x_{n-1} \right) $ such that $ x_0=x_n,x_1=x_{n+1} $ and
$$ x_{k+1}\le \left( 1-\alpha \right) x_k+\alpha x_{k-1}, $$
for all $ k $ in the set $ \{ 1,2,\ldots n \} . $
[i]Vasile Pop[/i]
Find all positive integers $n$ such that the number \[A=\sqrt{\frac{9n-1}{n+7}}\] is rational.
A circle $K$ centered at $(0,0)$ is given. Prove that for every vector $(a_1,a_2)$ there is a positive integer $n$ such that the circle $K$ translated by the vector $n(a_1,a_2)$ contains a lattice point (i.e., a point both of whose coordinates are integers).
Four couples are to be seated in a row. If it is required that each woman may only sit next to her husband or another woman, how many different possible seating arrangements are there?
Let $A$ be one of the two distinct points of intersection of two unequal coplanar circles $C_1$ and $C_2$ with centers $O_1$ and $O_2$ respectively. One of the common tangents to the circles touches $C_1$ at $P_1$ and $C_2$ at $P_2$, while the other touches $C_1$ at $Q_1$ and $C_2$ at $Q_2$. Let $M_1$ be the midpoint of $P_1Q_1$ and $M_2$ the midpoint of $P_2Q_2$. Prove that $\angle O_1AO_2=\angle M_1AM_2$.
Let $ p_i \geq 2$, $ i \equal{} 1,2, \cdots n$ be $ n$ integers such that any two of them are relatively prime. Let:
\[ P \equal{} \{ x \equal{} \sum_{i \equal{} 1}^{n} x_i \prod_{j \equal{} 1, j \neq i}^{n} p_j \mid x_i \text{is a non \minus{} negative integer}, i \equal{} 1,2, \cdots n \}
\]
Prove that the biggest integer $ M$ such that $ M \not\in P$ is greater than $ \displaystyle \frac {n \minus{} 2}{2} \cdot \prod_{i \equal{} 1}^{n} p_i$, and also find $ M$.
Let $ a\equal{}\pi/2008$. Find the smallest positive integer $ n$ such that
\[ 2[\cos(a)\sin(a)\plus{}\cos(4a)\sin(2a)\plus{}\cos(9a)\sin(3a)\plus{}\cdots\plus{}\cos(n^2a)\sin(na)]\] is an integer.
The first two terms of a sequence are $ a_1 \equal{} 1$ and $ a_2 \equal{} \frac {1}{\sqrt3}$. For $ n\ge1$,
\[ a_{n \plus{} 2} \equal{} \frac {a_n \plus{} a_{n \plus{} 1}}{1 \minus{} a_na_{n \plus{} 1}}.
\]What is $ |a_{2009}|$?
$ \textbf{(A)}\ 0\qquad \textbf{(B)}\ 2 \minus{} \sqrt3\qquad \textbf{(C)}\ \frac {1}{\sqrt3}\qquad \textbf{(D)}\ 1\qquad \textbf{(E)}\ 2 \plus{} \sqrt3$
Determine all composite positive integers $n$ with the following property: If $1 = d_1 < d_2 < \cdots < d_k = n$ are all the positive divisors of $n$, then
$$(d_2 - d_1) : (d_3 - d_2) : \cdots : (d_k - d_{k-1}) = 1:2: \cdots :(k-1)$$
(Walther Janous)
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.
Through the midpoints of the sides of the triangle $T$, straight lines are drawn perpendicular to the bisectors of the opposite angles of the triangle. These lines formed a triangle $T_1$. Prove that the center of the circle circumscribed about $T_1$ is in the midpoint of the segment formed by the center of the inscribed circle and the intersection point of the heights of triangle $T$.
Sugar Station sells $44$ different kinds of candies, packaged one to a box. Each box is priced at a positive integer number of cents, and it costs $\$1.51$ to buy one of every kind. (There is no discount based on the number of candies in a purchase.) Unfortunately, Anna only has $\$0.75$.
[list=a]
[*] Show that Anna can buy at least $22$ boxes, each containing a different candy.
[*] Show that Anna can do even better, buying at least $25$ boxes, each containing a different candy.
[/list]
There are 1000 rooms in a row along a long corridor. Initially the first room contains 1000 people and the remaining rooms are empty. Each minute, the following happens: for each room containing more than one person, someone in that room decides it is too crowded and moves to the next room. All these movements are simultaneous (so nobody moves more than once within a minute). After one hour, how many different
rooms will have people in them?
Let $ABCD$ be a trapezium with $AD // BC$. Suppose $K$ and $L$ are, respectively, points on the sides $AB$ and $CD$ such that $\angle BAL = \angle CDK$. Prove that $\angle BLA = \angle CKD$.
Let $k\geq 0$ an integer. The sequence $a_0,\ a_1,\ a_2, \ a_3, \ldots$ is defined as follows:
[LIST]
[*] $a_0=k$ [/*]
[*] For $n\geq 1$, we have that $a_n$ is the smallest integer greater than $a_{n-1}$ so that $a_n+a_{n-1}$ is a perfect square. [/*]
[/LIST]
Prove that there are exactly $\left \lfloor{\sqrt{2k}} \right \rfloor$ positive integers that cannot be written as the difference of two elements of such a sequence.
[i]Note.[/i] If $x$ is a real number, $\left \lfloor{x} \right \rfloor$ denotes the greatest integer smaller or equal than $x$.
Let $a_{1}, \ldots, a_{n}$ be an infinite sequence of strictly positive integers, so that $a_{k} < a_{k+1}$ for any $k.$ Prove that there exists an infinity of terms $ a_{m},$ which can be written like $a_m = x \cdot a_p + y \cdot a_q$ with $x,y$ strictly positive integers and $p \neq q.$
Calculate
\[T = \sum \frac{1}{n_1! \cdot n_2! \cdot \cdots n_{1994}! \cdot (n_2 + 2 \cdot n_3 + 3 \cdot n_4 + \ldots + 1993 \cdot n_{1994})!}\]
where the sum is taken over all 1994-tuples of the numbers $n_1, n_2, \ldots, n_{1994} \in \mathbb{N} \cup \{0\}$ satisfying $n_1 + 2 \cdot n_2 + 3 \cdot n_3 + \ldots + 1994 \cdot n_{1994} = 1994.$
Source: 2018 Canadian Open Math Challenge Part C Problem 1
-----
At Math-$e^e$-Mart, cans of cat food are arranged in an pentagonal pyramid of 15 layers high, with 1 can in the top layer, 5 cans in the second layer, 12 cans in the third layer, 22 cans in the fourth layer etc, so that the $k^{\text{th}}$ layer is a pentagon with $k$ cans on each side.
[center][img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvNC9lLzA0NTc0MmM2OGUzMWIyYmE1OGJmZWQzMGNjMGY1NTVmNDExZjU2LnBuZw==&rn=YzFhLlBORw==[/img][img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvYS9hLzA1YWJlYmE1ODBjMzYwZDFkYWQyOWQ1YTFhOTkzN2IyNzJlN2NmLnBuZw==&rn=YzFiLlBORw==[/img][/center]
$\text{(a)}$ How many cans are on the bottom, $15^{\text{th}}$,
[color=transparent](A.)[/color]layer of this pyramid?
$\text{(b)}$ The pentagonal pyramid is rearranged into a prism consisting of 15 identical layers.
[color=transparent](B.)[/color]How many cans are on the bottom layer of the prism?
$\text{(c)}$ A triangular prism consist of indentical layers, each of which has a shape of a triangle.
[color=transparent](C.)[/color](the number of cans in a triangular layer is one of the triangular numbers: 1,3,6,10,...)
[color=transparent](C.)[/color]For example, a prism could be composed of the following layers:
[center][img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvMi85L2NlZmE2M2Y3ODhiN2UzMTRkYzIxY2MzNjFmMDJkYmE0ZTJhMTcwLnBuZw==&rn=YzFjLlBORw==[/img][/center]
Prove that a pentagonal pyramid of cans with any number of layers $l\ge 2$ can be rearranged (without a deficit or leftover) into a triangluar prism of cans with the same number of layers $l$.
Let us denote by $s(n)= \sum_{d|n} d$ the sum of divisors of a positive integer $n$ ($1$ and $n$ included). If $n$ has at most $5$ distinct prime divisors, prove that $s(n) < \frac{77}{16} n.$ Also prove that there exists a natural number $n$ for which $s(n) < \frac{76}{16} n$ holds.
The numbers $1, 2, \ldots, n$ are written on a blackboard. Each minute, a student goes up to the board, chooses two numbers $x$ and $y$, erases them, and writes the number $2x+2y$ on the board. This continues until only one number remains. Prove that this number is at least $\frac{4}{9}n^3$.
[i]Brian Hamrick.[/i]
Do either $(1)$ or $(2)$:
$(1)$ Let $C_a$ be the curve $(y - a^2)^2 = x^2(a^2 - x^2).$ Find the curve which touches all $C_a$ for $a > 0.$ Sketch the solution and at least two of the $C_a.$
$(2)$ Given that $(1 - hx)^{-1}(1 - kx)^{-1} = \sum_{i\geq0}a_i x^i,$ prove that $(1 + hkx)(1 - hkx)^{-1}(1 - h^2x)^{-1}(1 - k^2x)^{-1} = \sum_{i\geq0} a_i^2 x^i.$
The $53$-digit number
$$37,984,318,966,591,152,105,649,545,470,741,788,308,402,068,827,142,719$$
can be expressed as $n^21$ where $n$ is a positive integer. Find $n$.
Given a finite number of boys and girls, a [i]sociable set of boys[/i] is a set of boys such that every girl knows at least one boy in that set; and a [i]sociable set of girls[/i] is a set of girls such that every boy knows at least one girl in that set. Prove that the number of sociable sets of boys and the number of sociable sets of girls have the same parity. (Acquaintance is assumed to be mutual.)
[i](Poland) Marek Cygan[/i]
Does there exist a set $M$ in usual Euclidean space such that for every plane $\lambda$ the intersection $M \cap \lambda$ is finite and nonempty ?
[i]Proposed by Hungary.[/i]
[hide="Remark"]I'm not sure I'm posting this in a right Forum.[/hide]
Prove that there exists a positive real number $C$ with the following property: for any integer $n\ge 2$ and any subset $X$ of the set $\{1,2,\ldots,n\}$ such that $|X|\ge 2$, there exist $x,y,z,w \in X$(not necessarily distinct) such that
\[0<|xy-zw|<C\alpha ^{-4}\]
where $\alpha =\frac{|X|}{n}$.