Found problems: 85335
$n$ students take a test with $m$ questions, where $m,n\ge 2$ are integers. The score given to every question is as such: for a certain question, if $x$ students fails to answer it correctly, then those who answer it correctly scores $x$ points, while those who answer it wrongly scores $0$. The score of a student is the sum of his scores for the $m$ questions. Arrange the scores in descending order $p_1\ge p_2\ge \ldots \ge p_n$. Find the maximum value of $p_1+p_n$.
The function $\mu: \mathbb{N}\to \mathbb{C}$ is defined by \[\mu(n) = \sum^{}_{k \in R_{n}}\left( \cos \frac{2k\pi}{n}+i \sin \frac{2k\pi}{n}\right),\] where $R_{n}=\{ k \in \mathbb{N}\vert 1 \le k \le n, \gcd(k, n)=1 \}$. Show that $\mu(n)$ is an integer for all positive integer $n$.
Consider positive numbers $h, s_1, s_2$, and a spatial triangle $\vartriangle ABC$. How many ways are there to select a point $D$ so that the height of tetrahedron $ABCD$ drawn from $D$ equals $h$, and the areas of faces $ACD$ and $BCD$ equal $s_1$ and $s_2$, respectively?
The integer $202020$ is a multiple of $91$. For each positive integer $n$, show how $n$ additional $2$'s may be inserted into the digits of $202020$ such that the resulting $(n+6)$-digit number is also a multiple of $91$.
For example, a possible way to do this when $n=5$ is [u]2[/u]2020[u]2[/u]20[u]222[/u] (the inserted $2$'s are underlined).
David wanted to calculate the volume of a prism with an equilateral triangular base. He was given the height of the prism $H=15$ and the height of the base $h=6$. He accidentally swapped the values of $H$ and $h$ in his calculations. By what number should he multiply his result to get the correct volume?
Let $C$ be a cube. Let $P$, $Q$, and $R$ be random vertices of $C$, chosen uniformly and independently from the set of vertices of $C$. (Note that $P$, $Q$, and $R$ might be equal.) Compute the probability that some face of $C$ contains $P$, $Q$, and $R$.
$ABC$ is a triangle. $U$ is a point on the line $BC$. $I$ is the midpoint of $BC$. The line through $C$ parallel to $AI$ meets the line $AU$ at $E$. The line through $E$ parallel to $BC$ meets the line $AB$ at $F$. The line through $E$ parallel to $AB$ meets the line $BC$ at $H$. The line through $H$ parallel to $AU$ meets the line $AB$ at $K$. The lines $HK$ and $FG$ meet at $T. V$ is the point on the line $AU$ such that $A$ is the midpoint of $UV$. Show that $V, T$ and $I$ are collinear.
$S_{1}$ and $S_{2}$ are two circles that intersect at distinct points $P$ and $Q$. $\ell_{1}$ and $\ell_{2}$ are two parallel lines through $P$ and $Q$. $\ell_{1}$ intersects $S_{1}$ and $S_{2}$ at points $A_{1}$ and $A_{2}$, different from $P$, respectively. $\ell_{2}$ intersects $S_{1}$ and $S_{2}$ at points $B_{1}$ and $B_{2}$, different from $Q$, respectively. Show that the perimeters of the triangles $A_{1}QA_{2}$ and $B_{1}PB_{2}$ are equal.
Show that $r = 2$ is the largest real number $r$ which satisfies the following condition:
If a sequence $a_1$, $a_2$, $\ldots$ of positive integers fulfills the inequalities
\[a_n \leq a_{n+2} \leq\sqrt{a_n^2+ra_{n+1}}\]
for every positive integer $n$, then there exists a positive integer $M$ such that $a_{n+2} = a_n$ for every $n \geq M$.
Let $k,n$ be positive integers. There are $kn$ points $P_1, P_2, \cdots, P_{kn}$ on a circle. We can color each points with one of color $ c_1, c_2, \cdots , c_k $. In how many ways we can color the points satisfying the following conditions?
(a) Each color is used $ n $ times.
(b) $ \forall i \not = j $, if $ P_a $ and $ P_b $ is colored with color $ c_i $ , and $ P_c $ and $ P_d $ is colored with color $ c_j $, then the segment $ P_a P_b $ and segment $ P_c P_d $ doesn't meet together.
All vertices of a convex polyhedron are endpoints of exactly four edges. Find the minimal possible number of triangular faces of the polyhedron.
Let $f_n$ be the Fibonacci numbers, defined by $f_0 = 1$, $f_1 = 1$, and $f_n = f_{n-1}+f_{n-2}$. For each $i$, $1 \le i \le 200$, we calculate the greatest common divisor $g_i$ of $f_i$ and $f_{2007}$. What is the sum of the distinct values of $g_i$?
Dirock has a very neat rectangular backyard that can be represented as a $32\times 32$ grid of unit squares. The rows and columns are each numbered $1,2,\ldots, 32$. Dirock is very fond of rocks, and places a rock in every grid square whose row and column number are both divisible by $3$. Dirock would like to build a rectangular fence with vertices at the centers of grid squares and sides parallel to the sides of the yard such that
[list] [*] The fence does not pass through any grid squares containing rocks; [*] The interior of the fence contains exactly 5 rocks. [/list]
In how many ways can this be done?
[i]Ray Li[/i]
Prove that any irreducible fraction $p/q$, where $p$ and $q$ are positive integers and $q$ is odd, is equal to a fraction $\frac{n}{2^k-1}$ for some positive integers $n$ and $k$.
We assume a truck as a $1 \times (k + 1)$ tile. Our parking is a $(2k + 1) \times (2k + 1)$ table and there are $t$ trucks parked in it. Some trucks are parked horizontally and some trucks are parked vertically in the parking. The vertical trucks can only move vertically (in their column) and the horizontal trucks can only move horizontally (in their row). Another truck is willing to enter the parking lot (it can only enter from somewhere on the boundary).
For $3k + 1 < t < 4k$, prove that we can move other trucks forward or backward in such a way that the new truck would be able to enter the lot.
Prove that the statement is not necessarily true for $t = 3k + 1$.
How many zeroes does the function $f(x)=2^x -1 -x^2 $ have on the real line?
Suppose $a$, $b$ and $c$ are positive integers with the property that $ab$, $bc$, and $ac$ are pairwise distinct perfect squares. What is the smallest possible value of $a+b+c$?
[i]Proposed by David Altizio[/i]
Let $A$ be a set of $2025$ non-negative integers and $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ be a function with the following two properties:
1) For every two distinct positive integers $x,y$ there exists $a\in A$, such that $x-y$ divides $f(x+a) - f(y+a)$.
2) For every positive integer $N$ there exists a positive integer $t$ such that $f(x) \neq f(y)$ whenever $x,y \in [t, t+N]$ are distinct.
Prove that there are infinitely many primes $p$ such that $p$ divides $f(x)$ for some positive integer $x$.
There is a city with $n$ metro stations, each located at a vertex of a regular n-polygon. Metro Line 1 is a line which only connects two non-neighboring stations $A$ and $B$. Metro Line 2 is a cyclic line which passes through all the stations in a shape of regular n-polygon. For each line metro can run in any direction, and $A$ and $B$ are the stations which one can transfer into other line. The line between two neighboring stations is called 'metro interval'. For each station there is one stationmaster, and there are at least one female stationmaster and one male stationmaster. If $n$ is odd, prove that for any integer $k$ $(0<k<n)$ there is a path that starts from a station with a male stationmaster and ends at a station with a female stationmaster, passing through $k$ metro intervals.
Given an integer $n \ge 3$. Find the largest positive integer $k $ with the following property:
For $n$ points in general position, there exists $k$ ways to draw a non-intersecting polygon with those $n$ points as it’s vertices.
[hide=Different wording]Given $n$, find the maximum $k$ so that for every general position of $n$ points , there are at least $k$ ways of connecting the points to form a polygon.[/hide]
We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ .
[i]Proposed by Abbas Mehrabian, Iran[/i]
For every positive $a, b,c, d$ such that $a + c \le ac$ and $b + d \le bd$
prove that $\frac{ab}{a + b} +\frac{bc}{b + c} +\frac{cd}{c + d} +\frac{da}{d + a} \ge 4$
Calculate
\[\int\cdots\int \exp\left(-\sum_{1\le i\le j\le n}x_ix_j\right)dx_1\cdots dx_n\]
Let $m$ circles intersect in points $A$ and $B$. We write numbers using the following algorithm: we write $1$ in points $A$ and $B$, in every midpoint of the open arc $AB$ we write $2$, then between every two numbers written in the midpoint we write their sum and so on repeating $n$ times. Let $r(n,m)$
be the number of appearances of the number $n$ writing all of them on our $m$ circles.
a) Determine $r(n,m)$;
b) For $n=2006$, find the smallest $m$ for which $r(n,m)$ is a perfect square.
Example for half arc: $1-1$;
$1-2-1$;
$1-3-2-3-1$;
$1-4-3-5-2-5-3-4-1$;
$1-5-4-7-3-8-5-7-2-7-5-8-3-7-4-5-1$...
Construct the semicircle $ h$ with the diameter $ AB$ and the midpoint $ M$. Now construct the semicircle $ k$ with the diameter $ MB$ on the same side as $ h$. Let $ X$ and $ Y$ be points on $ k$, such that the arc $ BX$ is $ \frac{3}{2}$ times the arc $ BY$. The line $ MY$ intersects the line $ BX$ in $ D$ and the semicircle $ h$ in $ C$.
Show that $ Y$ ist he midpoint of $ CD$.