Found problems: 85335
There is a central train station in point $O$, which is connected to other train stations $A_1, A_2, \ldots, A_8$ with tracks. There is also a track between stations $A_i$ and $A_{i+1}$ for each $i$ from $1$ to $8$ (here $A_9 = A_1$). The length of each track $A_iA_{i+1}$ is equal to $1$, and the length of each track $OA_i$ is equal to $2$, for each $i$ from $1$ to $8$.
There are also $8$ trains $B_1, B_2, \ldots, B_8$, with speeds $1, 2, \ldots, 8$ correspondently. Trains can move only by the tracks above, in both directions. No time is wasted on changing directions. If two or more trains meet at some point, they will move together from now on, with the speed equal to that of the fastest of them.
Is it possible to arrange trains into stations $A_1, A_2, \ldots, A_8$ (each station has to contain one train initially), and to organize their movement in such a way, that all trains arrive at $O$ in time $t < \frac{1}{2}$?
[i](Proposed by Bogdan Rublov)[/i]
Let $n$ be a positive integer. Andrés has $n+1$ cards and each of them has a positive integer written, in such a way that the sum of the $n+1$ numbers is $3n$. Show that Andrés can place one or more cards in a red box and one or more cards in a blue box in such a way that the sum of the numbers of the cards in the red box is equal to twice the sum of the numbers of the cards in the blue box.
Clarification: Some of Andrés's letters can be left out of the boxes.
The decimal representation of $m/n$, where $m$ and $n$ are relatively prime positive integers and $m < n$, contains the digits 2, 5, and 1 consecutively, and in that order. Find the smallest value of $n$ for which this is possible.
Find all real solutions $(x,y,z)$ of the system $$\begin{cases}\dfrac{4x^2}{1+4x^2}= y\\ \\\dfrac{4y^2}{1+4y^2}= z\\
\\ \dfrac{4z^2}{1+4z^2}= x \end{cases}$$
What’s the greatest pyramid volume one can form using edges of length $2, 3, 3, 4, 5, 5$, respectively?
We want to cover totally a square(side is equal to $k$ integer and $k>1$) with this rectangles:
$1$ rectangle ($1\times 1$), $2$ rectangles ($2\times 1$), $4$ rectangles ($3\times 1$),...., $2^n$ rectangles ($n + 1 \times 1$), such that the rectangles can't overlap and don't exceed the limits of square.
Find all $k$, such that this is possible and for each $k$ found you have to draw a solution
For which integers $n = 1, \ldots , 6$ does the equation $$a^n + b^n = c^n + n$$ have a solution in integers?
Let $n$ be a natural composite number. For each proper divisor $d$ of $n$ we write the number $d + 1$ on the board. Determine all natural numbers $n$ for which the numbers written on the board are all the proper divisors of a natural number $m$. (The proper divisors of a natural number $a> 1$ are the positive divisors of $a$ different from $1$ and $a$.)
How many non-congruent triangles with perimeter $ 7$ have integer side lengths?
$ \textbf{(A)}\ 1 \qquad
\textbf{(B)}\ 2 \qquad
\textbf{(C)}\ 3 \qquad
\textbf{(D)}\ 4 \qquad
\textbf{(E)}\ 5$
Let $S$ be the sum of all positive integers $n$ such that $\frac{3}{5}$ of the positive divisors of $n$ are multiples of $6$ and $n$ has no prime divisors greater than $3$. Compute $\frac{S}{36}$.
An engineer is designing an engine. Each cycle, it ignites a negligible amount of fuel, releasing $ 2000 \, \text{J} $ of energy into the cubic decimeter of air, which we assume here is gaseous nitrogen at $ 20^\circ \, \text{C} $ at $ 1 \, \text{atm} $ in the engine in a process which we can regard as instantaneous and isochoric. It then expands adiabatically until its pressure once again reaches $ 1 \, \text{atm} $, and shrinks isobarically until it reaches its initial state. What is the efficiency of this engine?
[i]Problem proposed by B. Dejean[/i]
Shivani has a single square with vertices labeled $ABCD$. She is able to perform the following transformations:
$\bullet$ She does nothing to the square.
$\bullet$ She rotates the square by $90$, $180$, or $270$ degrees.
$\bullet$ She reflects the square over one of its four lines of symmetry.
For the first three timesteps, Shivani only performs reflections or does nothing. Then for the next three timesteps, she only performs rotations or does nothing. She ends up back in the square’s original configuration. Compute the number of distinct ways she could have achieved this.
Let $OABC$ be a tetrahedron such that $\angle AOB = \angle BOC = \angle COA = 90^\circ$ and its faces have integral surface areas. If $[OAB] = 20$ and $[OBC] = 14$, find the sum of all possible values of $[OCA][ABC]$. (Here $[\triangle]$ denotes the area of $\triangle$.)
[i]Proposed by Robin Park[/i]
Given a point $P_0$ in the plane of the triangle $A_1A_2A_3$. Define $A_s=A_{s-3}$ for all $s\ge4$. Construct a set of points $P_1,P_2,P_3,\ldots$ such that $P_{k+1}$ is the image of $P_k$ under a rotation center $A_{k+1}$ through an angle $120^o$ clockwise for $k=0,1,2,\ldots$. Prove that if $P_{1986}=P_0$, then the triangle $A_1A_2A_3$ is equilateral.
Cut the $9 \times 10$ grid rectangle along the grid lines into several squares so that there are exactly two of them with odd sidelengths.
When Ringo places his marbles into bags with $6$ marbles per bag, he has $4$ marbles left over. When Paul does the same with his marbles, he has $3$ marbles left over. Ringo and Paul pool their marbles and place them into as many bags as possible, with $6$ marbles per bag. How many marbles will be left over?
$ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5 $
For a real number $x$, let $f(x)=\int_0^{\frac{\pi}{2}} |\cos t-x\sin 2t|\ dt$.
(1) Find the minimum value of $f(x)$.
(2) Evaluate $\int_0^1 f(x)\ dx$.
[i]2011 Tokyo Institute of Technology entrance exam, Problem 2[/i]
Let $ S$ be a set with $ n$ elements, and $ F$ be a family of subsets of $ S$ with $ 2^{n\minus{}1}$ elements, such that for each $ A,B,C\in F$, $ A\cap B\cap C$ is not empty. Prove that the intersection of all of the elements of $ F$ is not empty.
Imagine a square scheme consisting of $n\times n$ fields with edge length $1$, where $n$ is an arbitrary positive integer. What is the maximum possible length of a route you can follow along the edges of the fields from point $A$ in the lower left corner to point $B$ in the upper right corner if you must never return to one point where you have been before? (The figure shows for $n = 5$ an example of a permitted route and an example of a not permitted route).
[img]https://cdn.artofproblemsolving.com/attachments/6/e/92931d87f11b9fb3120b8dccc2c37c35a04456.png[/img]
Let $ M^n \subset \mathbb{R}^{n\plus{}1}$ be a complete, connected hypersurface embedded into the Euclidean space. Show that $ M^n$ as a Riemannian manifold decomposes to a nontrivial global metric direct product if and only if it is a real cylinder, that is, $ M^n$ can be decomposed to a direct product of the form $ M^n\equal{}M^k \times \mathbb{R}^{n\minus{}k} \;(k<n)$ as well, where $ M^k$ is a hypersurface in some $ (k\plus{}1)$-dimensional subspace $ E^{k\plus{}1} \subset \mathbb{R}^{n\plus{}1} , \mathbb{R}^{n\minus{}k}$ is the orthogonal complement of $ E^{k\plus{}1}$.
[i]Z. Szabo[/i]
Let $n$ be a positive integer. Find the largest integer $N$ for which there exists a set of $n$ weights such that it is possible to determine the mass of all bodies with masses of $1, 2, ..., N$ using a balance scale .
(i.e. to determine whether a body with unknown mass has a mass $1, 2, ..., N$, and which namely).
Find the sum of all the integers $N > 1$ with the properties that the each prime factor of $N $ is either $2, 3,$ or $5,$ and $N$ is not divisible by any perfect cube greater than $1.$
Find the number of ordered pairs of integers $(m,n)$ with $0 \le m,n \le 22$ such that $k^2+mk+n$ is not a multiple of $23$ for all integers $k.$
Let $r\geq 2$ be a positive integer, and let each positive integer be painted in one of $r$ different colors. For every positive integer $n$ and every pair of colors $a$ and $b$, if the difference between the number of divisors of $n$ that are painted in color $a$ and the number of divisors of $n$ that are painted in color $b$ is at most $1$, find all possible values of $r$.
$n$ persons sit around a round table. The number of persons having the same gender than the person at the right of them is the same as the number of those it isn't true for.
Show that $4|n$.